A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS^*

REFERENCES

• Bauschke , H. H. and Combettes , P. L. 2001 . A weak-to-strong convergence principle for Fejér-monotone methods in Hilbert spaces . Mathematics of Operations Research , 26 : 248 – 264 .
   Web of Science ®Google Scholar
• Bruck , R. E. 1975 . An iterative solution of a variational inequality for certain monotone operators in a Hilbert space . Bulletin of the American Mathematical Society , 81 : 890 – 892 .
   Web of Science ®Google Scholar
• Burachik , R. S. , Iusem , A. N. and Svaiter , B. F. 1996 . “ Enlargement of monotone operators with applications to variational inequalities ” . In Tech. Rep. 02/96 Rio de Janeiro , , Brazil : Pontificia Universidade Catolica do Rio de Janeiro .
   Google Scholar
• Burachik , R. S. , Iusem , A. N. and Svaiter , B. F. 1997 . Enlargement of monotone operators with applications to variational inequalities . Set-Valued Analysis , 5 : 159 – 180 .
   Google Scholar
• Burachik , R. S. , Sagastizábal , C. A. and Svaiter , B. F. 1999 . “ Bundle methods for maximal monotone operators ” . In Ill-posed variational problems and regularization techniques Edited by: Tichatschke , R. and Théra , M. 49 – 64 . Springer-Verlag . Lecture Notes in Economics and Mathematical Systems, No. 477
   Google Scholar
• Burachik , R. S. , Sagastizábal , C. A. and Svaiter , B. F. 1999 . “ ε-Enlargements of maximal monotone operators: Theory and applications ” . In Reformulation – Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods Edited by: Fukushima , M. and Qi , L. 25 – 44 . Kluwer Academic Publishers .
   Google Scholar
• Burachik , R. S. and Svaiter , B. F. 1999 . ε-Enlargements of maximal monotone operators in Banach spaces . Set-Valued Analysis , 7 : 117 – 132 .
   Google Scholar
• Burke , J. V. and Qian , M. 1998 . A variable metric proximal point algorithm for monotone operators . SIAM Journal on Control and Optimization , 37 : 353 – 375 .
   Web of Science ®Google Scholar
• Clarke , F. H. 1983 . Optimization and Nonsmooth Analysis New York : John Wiley & Sons .
   Google Scholar
• Cominetti , R. 1997 . Coupling the proximal point algorithm with approximation methods . Journal of Optimization Theory and Applications , 95 : 581 – 600 .
   Web of Science ®Google Scholar
• Dembo , R. S. , Eisenstat , S. C. and Steihaug , T. 1982 . Inexact Newton methods . SIAM Journal on Numerical Analysis , 19 : 400 – 408 .
   Web of Science ®Google Scholar
• Eckstein , J. 1998 . Approximate iterations in Bregman-function-based proximal algorithms . Mathematical Programming , 83 : 113 – 123 .
   Web of Science ®Google Scholar
• Ferris , M. C. and Kanzow , C. 2000 . “ Complementarity and related problems ” . In Handbook of Applied Optimization Edited by: Pardalos , P. M. and Resende , M. G.C. Oxford University Press .
   Google Scholar
• Fischer , A. 1997 . Solution of monotone complementarity problems with locally Lipschitzian functions . Mathematical Programming , 76 : 513 – 532 .
   Web of Science ®Google Scholar
• Fukushima , M. 1992 . Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems . Mathematical Programming , 53 : 99 – 110 .
   Web of Science ®Google Scholar
• Fukushima , M. and Qi , L. , eds. 1999 . Reformulation – Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods Kluwer Academic Publishers .
   Google Scholar
• Gabay , D. 1983 . “ Applications of the method of multipliers to variational inequalities ” . In Augmented Lagrangian Methods: Applications to the Solution of Boundary-Value Problems Edited by: Fortin , M. and Glowinski , R. 299 – 331 . North-Holland .
   Google Scholar
• Güler , O. 1991 . On the convergence of the proximal point algorithm for convex minimization . SIAM Journal on Control and Optimization , 29 : 403 – 419 .
   Web of Science ®Google Scholar
• Kanzow , C. and Fukushima , M. 1998 . Solving box constrained variational inequality problems by using the natural residual with D-gap function globalization . Operations Research Letters , 23 : 45 – 51 .
   Web of Science ®Google Scholar
• Lemaire , B. 1989 . “ The proximal algorithm ” . In New Methods of Optimization and Their Industrial Use. International Series of Numerical Mathematics 87 Edited by: Penot , J.-P. 73 – 87 . Basel : Birkhauser .
   Google Scholar
• De Luca , T. , Facchinei , F. and Kanzow , C. 2000 . A theoretical and numerical comparison of some semismooth algorithms for complementarity problems . Computational Optimization and Applications , 16 : 173 – 205 .
   Web of Science ®Google Scholar
• Mifflin , R. 1977 . Semismooth and semiconvex functions in constrained optimization . SIAM Journal on Control and Optimization , 15 : 957 – 972 .
   Web of Science ®Google Scholar
• Opial , Z. 1967 . Weak convergence of the sequence of successive approximations for nonexpansive mappings . Bulletin of the American Mathematical Society , 73 : 591 – 597 .
   Web of Science ®Google Scholar
• Pang , J.-S. 1986 . Inexact Newton methods for the nonlinear complementarity problem . Mathematical Programming , 36 : 54 – 71 .
   Web of Science ®Google Scholar
• Pang , J.-S. 1995 . “ Complementarity problems ” . In Handbook of Global Optimization Edited by: Horst , R. and Pardalos , P. 271 – 338 . Boston , , Massachusetts : Kluwer Academic Publishers .
   Google Scholar
• Pang , J.-S. and Gabriel , S. A. 1993 . NE/SQP: A robust algorithm for the nonlinear complementarity problem . Mathematical Programming , 60 : 295 – 337 .
   Web of Science ®Google Scholar
• Pang , J.-S. and Qi , L. 1993 . Nonsmooth equations: Motivation and algorithms . SIAM Journal on Optimization , 3 : 443 – 465 .
   Web of Science ®Google Scholar
• Qi , L. 1993 . Convergence analysis of some algorithms for solving nonsmooth equations . Mathematics of Operations Research , 18 : 227 – 244 .
   Web of Science ®Google Scholar
• Qi , L. and Sun , J. 1993 . A nonsmooth version of Newton's method . Mathematical Programming , 58 : 353 – 367 .
   Web of Science ®Google Scholar
• Robinson , S. M. 1987 . Local structure of feasible sets in nonlinear programming, Part III: Stability and sensitivity . Mathematical Programming Study , 30 : 45 – 66 .
   Web of Science ®Google Scholar
• Rockafellar , R. T. 1976 . Monotone operators and the proximal point algorithm . SIAM Journal on Control and Optimization , 14 : 877 – 898 .
   Web of Science ®Google Scholar
• Sagastizábal , C. A. and Solodov , M. V. 2001 . “ On the relation between bundle methods for maximal monotone inclusions and hybrid proximal point algorithms ” . In Inherently Parallel Algorithms in Feasibility and Optimization and their Applications, volume 8 of Studies in Computational Mathematics Edited by: Butnariu , D. , Censor , Y. and Reich , S. 441 – 455 . Elsevier Science B.V. .
   Google Scholar
• Sibony , M. 1970 . Méthodes itératives pour les équations et inéquations aux dérivées partielles nonlinéares de type monotone . Calcolo , 7 : 65 – 183 .
   Google Scholar
• Solodov , M. V. and Svaiter , B. F. 1999 . A new projection method for variational inequality problems . SIAM Journal on Control and Optimization , 37 : 765 – 776 .
   Web of Science ®Google Scholar
• Solodov , M. V. and Svaiter , B. F. 2000 . A truly globally convergent Newton-type method for the monotone nonlinear complementarity problem . SIAM Journal on Optimization , 10 : 605 – 625 .
   Web of Science ®Google Scholar
• Solodov , M. V. and Svaiter , B. F. 1999 . “ A globally convergent inexact Newton method for systems of monotone equations ” . In Reformulation – Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods Edited by: Fukushima , M. and Qi , L. 355 – 369 . Kluwer Academic Publishers .
   Google Scholar
• Solodov , M. V. and Svaiter , B. F. 1999 . A hybrid approximate extragradient–proximal point algorithm using the enlargement of a maximal monotone operator . Set-Valued Analysis , 7 : 323 – 345 .
   Google Scholar
• Solodov , M. V. and Svaiter , B. F. 1999 . A hybrid projection–proximal point algorithm . Journal of Convex Analysis , 6 : 59 – 70 .
   Web of Science ®Google Scholar
• Solodov , M. V. and Svaiter , B. F. 2000 . Error bounds for proximal point subproblems and associated inexact proximal point algorithms . Mathematical Programming , 88 : 371 – 389 .
   Web of Science ®Google Scholar
• Solodov , M. V. and Svaiter , B. F. 2000 . Forcing strong convergence of proximal point iterations in a Hilbert space . Mathematical Programming , 87 : 189 – 202 .
   Web of Science ®Google Scholar
• Solodov , M. V. and Svaiter , B. F. 2000 . An inexact hybrid generalized proximal point algorithm and some new results on the theory of Bregman functions . Mathematics of Operations Research , 25 : 214 – 230 .
   Web of Science ®Google Scholar
• Tossings , P. 1994 . The perturbed proximal point algorithm and some of its applications . Applied Mathematics and Optimization , 29 : 125 – 159 .
   Web of Science ®Google Scholar
• Tseng , P. 1990 . Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming . Mathematical Programming , 48 : 249 – 263 .
   Web of Science ®Google Scholar
• Tseng , P. 2000 . A modified forward-backward splitting method for maximal monotone mappings . SIAM Journal on Control and Optimization , 38 : 431 – 446 .
   Web of Science ®Google Scholar
• Zhao , Y.-B. and Li , D. 2001 . Monotonicity of fixed point and normal mappings associated with variational inequality and its application . SIAM Journal on Optimization , 11 : 962 – 973 .
   Web of Science ®Google Scholar
• Zhu , D. L. and Marcotte , P. 1996 . Co-coercivity and its role in the convergence of iterative schemes for solving variational inequalities . SIAM Journal on Optimization , 6 : 714 – 726 .
   Web of Science ®Google Scholar