On a decomposition formula for the proximal operator of the sum of two convex functions
Samir Adly, Lo\"ic Bourdin, Fabien Caubet

TL;DR
This paper introduces a new decomposition formula for the proximal operator of the sum of two convex functions, generalizing classical notions and providing a theoretical foundation for numerical algorithms.
Contribution
It defines a new operator, the $f$-proximal operator of $g$, and proves a decomposition formula, enriching the theoretical understanding and computational methods for convex optimization.
Findings
Introduces the $f$-proximal operator of $g$ as a generalization.
Proves the decomposition formula $ ext{prox}_{f+g} = ext{prox}_f ext{circ} ext{prox}_g^f$.
Provides a weakly convergent algorithm for computing the new operator.
Abstract
The main result of the present theoretical paper is an original decomposition formula for the proximal operator of the sum of two proper, lower semicontinuous and convex functions and . For this purpose, we introduce a new operator, called -proximal operator of and denoted by , that generalizes the classical notion. Then we prove the decomposition formula . After collecting several properties and characterizations of , we prove that it coincides with the fixed points of a generalized version of the classical Douglas-Rachford operator. This relationship is used for the construction of a weakly convergent algorithm that computes numerically this new operator , and thus, from the decomposition formula, allows to compute numerically . It…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Variational Analysis · Numerical methods in inverse problems · Mathematical Inequalities and Applications
