Proximal Methods for Cohypomonotone Operators
Authors:
- Patrick L. CombettesPCPatrick L. Combettes
- Teemu PennanenTPTeemu Pennanen
- 1 January 2004
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control and Optimization
- Vol. 43 (2) , 731-742
Abstract
Conditions are given for the viability and the weak convergence of an inexact, relaxed proximal point algorithm for finding a common zero of countably many cohypomonotone operators in a Hilbert space. In turn, new convergence results are obtained for an extended version of the proximal method of multipliers in nonlinear programming.Keywords
This publication has 23 references indexed in Scilit:
- Cyclic Hypomonotonicity, Cyclic Submonotonicity, and IntegrationJournal of Optimization Theory and Applications, 2004
- Inexact Variants of the Proximal Point Algorithm without MonotonicitySIAM Journal on Optimization, 2003
- A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert SpacesMathematics of Operations Research, 2001
- Lipschitzian Multifunctions and a Lipschitzian Inverse Mapping TheoremMathematics of Operations Research, 2001
- Smooth methods of multipliers for complementarity problemsMathematical Programming, 1999
- Hilbertian Convex Feasibility Problem: Convergence of Projection MethodsApplied Mathematics & Optimization, 1997
- Characterizations of Strong Regularity for Variational Inequalities over Polyhedral Convex SetsSIAM Journal on Optimization, 1996
- On the Douglas—Rachford splitting method and the proximal point algorithm for maximal monotone operatorsMathematical Programming, 1992
- Produits infinis de resolvantesIsrael Journal of Mathematics, 1978
- Convergence theorems for sequences of nonlinear operators in Banach spacesMathematische Zeitschrift, 1967