Abstract
An approximate diagonal version of the iteration method for a nonexpansive self mapping of a Banach space (hence with possible non unique fixed-point if any) is considered. Two kinds of properties satisfied by this method that cover widely recent results on the prox or gradient-prox method for convex optimization and monotone inclusions are presented: localization and selection.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
P. Alart & B. Lemaire, Penalization in nonclassical convex programming via variational convergence, Math. Progr. 51, 1991, 307–331.
H. Attouch & R.J.B. Wets, Isometries for the Legendre-Fenchel transform, Transactions of the AMS,Vol. 296, 1984, 33–60.
A. Auslender, R. Cominetti & J.P. Crouzeix, Convex functions with unbounded level sets and application to duality theory, SIAM Journal on Optimization, vol. 3, n o 4, 1993, 669–687.
J.B. Baillon & G. Haddad, Quelques propriétés des opérateurs angle-bornés et n-cycliquement monotones, Israel J. Math. 26 (1977), 137–150.
M.A. Bahraoui & B. Lemaire, Convergence of diagonally stationary segences in Convex Optimization, Set-Valued Analysis 2, 1994, 1–13.
R. Cominetti, Coupling the proximal point algorithm with approximation methods, accepted to appear in JOTA.
J.C. Dunn, Convexity, monotonicity and gradient process in Hilbert spaces, Journal of Mathematical Analysis and Applications, 53, 1976, 145–158.
A. Kaplan & R. Tichatschke, Stable methods for ill-posed problems, Akademie Verlag, Berlin, 1994.
N. Lehdili, Mthodes proximales de slection et de dcomposition pour les inclusions monotones, Thse de Doctorat, Universit Montpellier 2, 1996.
N. Lehdili & A. Moudafi, Combining the proximal algorithm and Tikhonov regularization, Optimization, vol. 00, 1996, 1–14.
B. Lemaire, Coupling optimization methods and variational convergence, in Trends in Mathematical Optimization, International Series of Numerical Mathematics, Vol 84(c), Birkhäuser Verlag, 1988, 163–179.
B. Lemaire, About the convergence of the proximal method, Advances in Optimization, Proceedings Lambrecht 1991, Lecture Notes in Economics and Mathematical Systems 382, Springer-Verlag, 1992, 39–51.
B. Lemaire, Bounded Diagonally Stationary Sequences in Convex Optimization, Journal of Convex Analysis, Helderman, Berlin, first issue, 1994, 75–86.
B. Lemaire, On the convergence of some iterative method for convex minimization, Recents Developments in Optimization, R. Durier & C. Michelot Eds., Lectures Notes in Economics and Mathematical Systems, Springer, 1995, 252–268.
B. Lemaire, Bonne position, conditionnement, et bon comportement asymptotique,Séminaire d’Analyse Convexe, Montpellier, 1992, exposé n o 5.
B. Lemaire, Stability of the iteration method for nonexpansive mappings, Serdica Mathematical Journal 22, 1996, 1001–1010.
B. Lemaire, An asymptotical variational principle associated with the steepest descent method for a convex function, Journal of Convex Analysis, Vol. 3, n o 1, 1996, 63–70.
J.L. Lions, Contrle optimal de systmes gouverns par des quations aux drives partielles, 1968, Dunod Gauthier-Villars.
K. Mouallif, Convergence variationnelle et méthodes perturbées pour les problèmes d’optimisation et de point selle,Thèse d’Etat, Université de Liège, 1989.
A. Moudafi, Coupling proximal algorithm and Tikhonov method, Nonlinear Times and digest 1, 1994, 203–210.
A.S. Ould, Thse de Doctorat, Universit de Montpellier, in preparation.
A. Renaud, Algorithmes de rgularisation et dcomposition pour les problmes variationels monotones, Thse de Doctorat, Ecole des Mines de Paris, 1993.
R.T. Rockafellar, Monotone operators and the proximal point algorithm, SIAM J. Control and Optimization, 1976, 877–898.
P. Tossings, Sur les zéros des opérateurs maximaux monotones et applications, Thèse de Doctorat, Université de Liège, 1990.
G. Vigé, Algorithme du point proximal et applications, Thèse de Doctorat, Université de Limoges, 1996.
D.L. Zhu & P. Marcotte, Co-coercivity and its rle in the convergence of iterative schemes for solving variational inequalities, to appear in SIAM Journal on Optimization.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lemaire, B. (1997). Which Fixed Point Does the Iteration Method Select?. In: Gritzmann, P., Horst, R., Sachs, E., Tichatschke, R. (eds) Recent Advances in Optimization. Lecture Notes in Economics and Mathematical Systems, vol 452. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-59073-3_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-59073-3_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63022-7
Online ISBN: 978-3-642-59073-3
eBook Packages: Springer Book Archive