Solving monotone inclusions via compositions of nonexpansive averaged operators
OptimizationPublished 1 October 2004
Patrick L. Combettes
Citations481
SJR quartileQ2
SJR score0.70
SNIP1.37
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
Abstract A unified fixed point theoretic framework is proposed to investigate the asymptotic behavior of algorithms for finding solutions to monotone inclusion problems. The basic iterative scheme under consideration involves nonstationary compositions of perturbed averaged nonexpansive operators. The analysis covers proximal methods for common zero problems as well as for various splitting methods for finding a zero of the sum of monotone operators. Keywords: Averaged operatorDouglas–Rachford methodForward–backward methodMonotone inclusionMonotone operatorProximal point algorithmMathematics Subject Classifications 2000: 47B3347H0547H1054H25 Notes E-mail: [email protected] Additional informationNotes on contributorsPatrick L. Combettes Footnote* E-mail: [email protected]
Keywords
Computer ScienceMathematics
Springer series in computational mathematicsMatrix Iterative Analysis
5,787 Citations2000Richard S. Varga
SIAM Journal on Control and OptimizationMonotone Operators and the Proximal Point Algorithm
3,620 Citations1976R. T. Rockafellar
Journal of the Society for Industrial and Applied MathematicsThe Numerical Solution of Parabolic and Elliptic Differential Equations
3,241 Citations1955D.W. Peaceman, H.H. Rachford
Mathematical ProgrammingOn the Douglas—Rachford splitting method and the proximal point algorithm for maximal monotone operators
2,877 Citations1992Jonathan Eckstein, Dimitri P. Bertsekas
This paper shows, by means of an operator called asplitting operator, that the Douglas—Rachford splitting method for finding a zero of the sum of two monotone operators is a special case of the proximal point algorithm, which allows the unification and generalization of a variety of convex programming algorithms.
SIAM Journal on Numerical AnalysisSplitting Algorithms for the Sum of Two Nonlinear Operators
1,975 Citations1979Pierre‐Louis Lions, Bertrand Mercier
This work studies two splitting algorithms for (stationary and evolution) problems involving the sum of two monotone operators with real-time requirements.
SIAM ReviewOn Projection Algorithms for Solving Convex Feasibility Problems
1,711 Citations1996Heinz H. Bauschke, Jonathan M. Borwein
A very broad and flexible framework is investigated which allows a systematic discussion of questions on behaviour in general Hilbert spaces and on the quality of convergence in convex feasibility problems.
Transactions of the American Mathematical SocietyOn the numerical solution of heat conduction problems in two and three space variables
1,657 Citations1956Jim Douglas, H.H. Rachford
Bulletin de la Société mathématique de FranceProximité et dualité dans un espace hilbertien
1,386 Citations1965Jean Jacques Moreau
Journal of Policy Analysis and ManagementLecture Notes in Economics and Mathematical Systems
1,294 Citations1985Robert J. Weiner
Mathematics of Operations ResearchAugmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
1,209 Citations1976R. T. Rockafellar
The theory of the proximal point algorithm for maximal monotone operators is applied to three algorithms for solving convex programs, one of which has not previously been formulated and is shown to have much the same convergence properties, but with some potential advantages.
Encyclopedia of Optimization
957 Citations2001Christodoulos A. Floudas, Panos M. Pardalos
The encyclopedia of optimization is universally compatible with any devices to read, so you can download it instantly and enjoy a good book with a cup of tea in the afternoon.
USSR Computational Mathematics and Mathematical PhysicsThe method of projections for finding the common point of convex sets
732 Citations1967L.G. Gubin, B. T. Polyak +1 more
Various methods of finding points from the intersection of sets, using projection on to a separate set as an elementary operation are considered, and the strong convergence of the sequences obtained is proved.
SIAM Journal on Control and OptimizationApplications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
489 Citations1991Paul Tseng
It is shown that the proposed algorithm for minimizing a strongly convex cost over the intersection of closed convex sets is in fact a special case of a splitting algorithm analyzed by Gabay for finding a zero of the sum of two maximal monotone operators.
Mathematics of Operations ResearchA Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
418 Citations2001Heinz H. Bauschke, Patrick L. Combettes
A simple modification of iterative methods arising in numerical mathematics and optimization that makes them strongly convergent without additional assumptions is presented.
Journal of Convex Analysis
357 Citations2012Giuseppe Buttazzo, Lionel Thibault +61 more
Israel Journal of MathematicsQuelques propriétés des opérateurs angle-bornés etn-cycliquement monotones
282 Citations1977Jean-Bernard Baillon, Georges Haddad
Israel Journal of MathematicsProduits infinis de resolvantes
243 Citations1978Haïm Brézis, Pierre‐Louis Lions
Journal of Approximation TheoryFinding best approximation pairs relative to two closed convex sets in Hilbert spaces
210 Citations2004Heinz H. Bauschke, Patrick L. Combettes +1 more
This work investigates systematically the asymptotic behavior of AAR in the general case when the sets do not necessarily intersect and shows that the method produces best approximation pairs provided they exist.
Studies in computational mathematicsQuasi-Fejérian Analysis of Some Optimization Algorithms
206 Citations2001Patrick L. Combettes
A quasi-Fejer sequence is a sequence which satisfies the standard Fejer monotonicityproperty to within an additional error term and is shown to provide a powerful framework to analyze the convergence of a wide range of optimization algorithms in a systematic fashion.
IEEE Transactions on Signal ProcessingInconsistent signal feasibility problems: least-squares solutions in a product space
197 Citations1994Patrick L. Combettes
Presents parallel projection methods to find least-squares solutions to inconsistent convex set theoretic signal synthesis problems and convergence properties of the proposed methods are analyzed and signal synthesis applications are demonstrated.
Journal of Approximation TheoryDykstra′s Alternating Projection Algorithm for Two Sets
189 Citations1994Heinz H. Bauschke, Jonathan M. Borwein
Mathematical ProgrammingApplications of the method of partial inverses to convex programming: Decomposition
153 Citations1985Jonathan E. Spingarn
A primal–dual decomposition method is presented to solve the separable convex programming problem, equivalent to the proximal point algorithm applied to a certain maximal monotone multifunction.
A General Duality Principle for the Sum of Two Operators 1
151 Citations1996Hédy Attouch
Applied Mathematics & OptimizationHilbertian convex feasibility problem: Convergence of projection methods
150 Citations1997Patrick L. Combettes
Mathematical ProgrammingFurther applications of a splitting algorithm to decomposition in variational inequalities and convex programming
133 Citations1990Paul Tseng
This work shows that existing convergence results for this projection algorithm follow from one given by Gabay for a splitting algorithm for finding a zero of the sum of two maximal monotone operators, and obtains a decomposition method that can simultaneously dualize the linear constraints and diagonalize the cost function.
IEEE Transactions on Signal ProcessingHard-constrained inconsistent signal feasibility problems
87 Citations1999Patrick L. Combettes, Pascal Bondon
This work considers the problem of synthesizing feasible signals in a Hilbert space in the presence of inconsistent convex constraints, and proposes a formalism and algorithmic framework that unify and extend existing approaches to inconsistent signal feasibility problems.
SIAM Journal on OptimizationSurrogate Projection Methods for Finding Fixed Points of Firmly Nonexpansive Mappings
64 Citations1997Krzysztof C. Kiwiel, Bożena Łopuch
Lecture notes in economics and mathematical systemsWhich Fixed Point Does the Iteration Method Select?
62 Citations1997B. Lemaire
Applied Mathematics & OptimizationThe perturbed proximal point algorithm and some of its applications
45 Citations1994Patricia Tossings
A perturbed version of the proximal point algorithm is presented and this new algorithm is applied to convex optimization and to variational inclusions or, more particularly, to Variational inequalities.
HAL (Le Centre pour la Communication Scientifique Directe)Algorithmes pour la résolution de problèmes d'optimisation et de minimax
37 Citations1972B. Martinet
Proceedings of the American Mathematical SocietyThe composition of projections onto closed convex sets in Hilbert space is asymptotically regular
37 Citations2002Heinz H. Bauschke
ESAIM Mathematical Modelling and Numerical AnalysisPartial regularization of the sum of two maximal monotone operators
35 Citations1993Philippe Mahey, Pham Dinh Tao
Nonlinear Analysis Real World ApplicationsOn a quasilinear degenerate system arising in semiconductors theory. Part I: Existence and uniqueness of solutions
33 Citations2001Jesús Ildefonso Díaz Díaz, Gonzalo Galiano +1 more
Annales de la faculté des sciences de Toulouse MathématiquesConvergence d'un schéma de minimisation alternée
30 Citations1980Felipe Acker, Marc-Antoine Prestel
Nonlinear AnalysisOn the regularization of the sum of two maximal monotone operators
19 Citations2000Abdellatif Moudafi
Numerical Functional Analysis and OptimizationA SPLITTING METHOD FOR COMPOSITE MAPPINGS
15 Citations2002Teemu Pennanen