On the convergence of the proximal algorithm for saddle-point problems

References

• Auslender , A. 1985 . Two general methods for computing saddle points with applications for decomposing convex programming problems . Appl. Math. Optim , 13 : 79 – 95 .
   Google Scholar
• Auslender , A. , Crouzeix , J.P. and Fedit , P. 1987 . Penalty proximal methods in convex programming . J Optimization Theory Applications , 55 ( 1 ) : 1 – 21 .
   Web of Science ®Google Scholar
• Dunfor , N. and Shwartz , J. 1988 . “ Linear operators, part I, general theory ” . New York
   Google Scholar
• Güler , O. 1991 . On the convergence of the proximal algorithm for minimization problems . SIAM J Control Optimization , 29 : 403 – 419 .
   Web of Science ®Google Scholar
• Lemaire B. W. Coupling optimization methods and variational convergence, Trends in Mathematical Optimization 1988
   Google Scholar
• Lemaire , B. About the convergence of the proximal method . 6th French-German conference on Optimization .
   Google Scholar
• Martinet B. Algorithmes pour la rćsolution des problèmes d’optimisation et minimax Thèse d’Etat universitć de Grenoble 1972 Ph.D.Thesis
   Google Scholar
• Moudafi A. Coupling proximal methods and variational convergence ZOR-Methods and Models of Operations Research 1993 269 280 Ph.D.Thesis
   Google Scholar
• Mouallif , K. 1989 . 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 .
   Google Scholar
• Rockafellar , R.T. 1976 . Monotone operators and the proximal point algorithm . SIAM J. Control Optimization , 14 : 877 – 898 .
   Web of Science ®Google Scholar
• Rockafellar , R.T. 1970 . Monotone operators associated with saddle functions and minimax problems,Nonlinear functional analysis, Part I , Edited by: Browder , F.E. 397 – 407 . Providence : Amer Math. Soc . Symposia in Pure Math
   Google Scholar