Iteration-complexity of a newton proximal extragradient method for monotone variational inequalities and inclusion problems

SIAM Journal on Optimization

Volumn 22, Issue 3, 2012, Pages 914-935

  Monteiro, Renato D C ^a   Svaiter, Benar F ^b  

^a Georgia Institute of Technology   (United States)

^b IMPA   (Brazil)

Author keywords

Complexity; Ergodic convergence; Extragradient; Hybrid; Maximal monotone operator; Newton methods; Proximal point; Variational inequality

Indexed keywords

COMPLEXITY; ERGODIC CONVERGENCE; EXTRAGRADIENT; HYBRID; MAXIMAL MONOTONE OPERATORS; PROXIMAL POINTS; VARIATIONAL INEQUALITIES;

CONFORMAL MAPPING; NEWTON-RAPHSON METHOD;

VARIATIONAL TECHNIQUES;

EID: 84867305815     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/11083085X     Document Type: Article

References (27)

1. G. Auchmuty, Variational principles for variational inequalities, Numer. Funct. Anal. Optim., 10 (1989), pp. 863-874.
2. H. Brézis, Opérateurs maximaux monotones et semi-groupes de contractions dans les espaces de Hilbert, North-Holland Math. Stud. 5, North-Holland, Amsterdam, 1973.
3. A. Brøndsted and R. T. Rockafellar, On the subdifferentiability of convex functions, Proc. Amer. Math. Soc., 16 (1965), pp. 605-611.
4. R. S. Burachik, A. N. Iusem, and B. F. Svaiter, Enlargement of monotone operators with applications to variational inequalities, Set-Valued Anal., 5 (1997), pp. 159-180.
5. R. S. Burachik, C. Sagastizábal, and B. F. Svaiter, Bundle methods for maximal monotone operators, in Ill-Posed Variational Problems and Regularization Techniques, Lecture Notes in Econom. and Math. Systems 477, Springer, Berlin, 1999, pp. 49-64.
6. R. S. Burachik, C. A. Sagastizábal, and B. F. Svaiter, ε-enlargements of maximal monotone operators: Theory and applications, in Reformulation: Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods, Appl. Optim. 22, Kluwer Academy, Dordrecht, 1999, pp. 25-43.
7. R. S. Burachik and B. F. Svaiter, ε-enlargements of maximal monotone operators in Banach spaces, Set-Valued Anal., 7 (1999), pp. 117-132.
8. M. Fukushima, Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems, Math. Program., 53 (1992), pp. 99-110.
9. B. Martinet, Régularisation d'inéquations variationnelles par approximations successives, Rev. Française Informat. Recherche Opérationnelle, 4 (1970), pp. 154-158.
10. R. D. C. Monteiro and B. F. Svaiter, Convergence Rate of Inexact Proximal Point Methods with Relative Error Criteria for Convex Optimization, Technical report, Optimization Online, 2010.
11. R. D. C. Monteiro and B. F. Svaiter, Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, 2010.
12. R. D. C. Monteiro and B. F. Svaiter, On the complexity of the hybrid proximal extragradient method for the iterates and the ergodic mean, SIAM J. Optim., 20 (2010), pp. 2755-2787.
13. R. D. C. Monteiro and B. F. Svaiter, Complexity of variants of Tseng's modified F-B splitting and Korpelevich's methods for hemivariational inequalities with applications to saddle-point and convex optimization problems, SIAM J. Optim., 21 (2011), pp. 1688-1720.
14. R. D. C. Monteiro and B. F. Svaiter, Implementation of a block-decomposition algorithm for solving large-scale conic semidefinite programming problems, Technical report, Optimization Online, 2011.
15. Y. Nesterov, Accelerating the cubic regularization of Newton's method on convex problems, Math. Program., 112 (2008), pp. 159-181.
16. Y. Nesterov and B. T. Polyak, Cubic regularization of Newton method and its global performance, Math. Program., 108 (2006), pp. 177-205.
17. Y. E. Nesterov and A. S. Nemirovski, Interior Point Polynomial Algorithms in Convex Programming: Theory and Applications, SIAM, Philadelphia, 1994.
18. J. Povh, F. Rendl, and A. Wiegele, A boundary point method to solve semidefinite programs, Computing, 78 (2006), pp. 277-286.
19. R. T. Rockafellar, On the maximal monotonicity of subdifferential mappings, Pacific J. Math., 33 (1970), pp. 209-216.
20. R. T. Rockafellar, Augmented Lagrangians and applications of the proximal point algorithm in convex programming, Math. Oper. Res., 1 (1976), pp. 97-116.
21. R. T. Rockafellar, Monotone operators and the proximal point algorithm, SIAM J. Control Optim., 14 (1976), pp. 877-898.
22. M. V. Solodov and B. F. Svaiter, A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator, Set-Valued Anal., 7 (1999), pp. 323-345.
23. M. V. Solodov and B. F. Svaiter, A hybrid projection-proximal point algorithm, J. Convex Anal., 6 (1999), pp. 59-70.
24. M. V. Solodov and B. F. Svaiter, Error bounds for proximal point subproblems and associated inexact proximal point algorithms, Math. Program., 88 (2000), pp. 371-389.
25. M. V. Solodov and B. F. Svaiter, An inexact hybrid generalized proximal point algorithm and some new results on the theory of Bregman functions, Math. Oper. Res., 25 (2000), pp. 214-230.
26. M. V. Solodov and B. F. Svaiter, A unified framework for some inexact proximal point algorithms, Numer. Funct. Anal. Optim., 22 (2001), pp. 1013-1035.
27. X.-Y. Zhao, D. Sun, and K.-C. Toh, A Newton-CG augmented Lagrangian method for semidefinite programming, SIAM J. Optim., 20 (2010), pp. 1737-1765.