An accelerated hybrid proximal extragradient method for convex optimization and its implications to second-order methods

SIAM Journal on Optimization

Volumn 23, Issue 2, 2013, Pages 1092-1125

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

^a Georgia Institute of Technology   (United States)

^b IMPA   (Brazil)

Author keywords

Accelerated gradient; Accelerated Newton; Complexity; Convex programming; Ergodic convergence; Extragradient; Hybrid; Maximal monotone operator; Proximal point; Variational inequality

Indexed keywords

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

CONVEX OPTIMIZATION; CONVEX PROGRAMMING; FUNCTIONS; VARIATIONAL TECHNIQUES;

ITERATIVE METHODS;

EID: 84880731606     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/110833786     Document Type: Article

References (22)

1. A. Beck and M. Teboulle, A fast iterative shrinkage-thresholding algorithm for linear inverse problems, SIAM J. Imaging Sci., 2 (2009), pp. 183-202.
2. 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.
3. R. S. Burachik and B. F. Svaiter, ∈-enlargements of maximal monotone operators in Banach spaces, Set-Valued Anal., 7 (1999), pp. 117-132.
4. O. Güler, New proximal point algorithms for convex minimization, SIAM J. Optim., 2 (1992), pp. 649-664.
5. J.-B. Hiriart-Urruty and C. Lemaréchal, Convex Analysis and Minimization Algorithms. II, Grundlehren Math. Wiss. 306, Springer-Verlag, Berlin, 1993.
6. B. Martinet, Reégularisation d'inéquations variationnelles par approximations successives, Rev. Françcaise Informat. Recherche Op'erationnelle, 4 (1970), pp. 154-158.
7. J.-E. Mart'inez-Legaz and B. F. Svaiter, Monotone operators representable by l.s.c. convex functions, Set-Valued Anal., 13 (2005), pp. 21-46.
8. 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 (2010), pp. 1688-1720.
9. R. D. C. Monteiro and B. F. Svaiter, Iteration-complexity of block-decomposition algorithms and the alternating direction method of multipliers, SIAM J. Optim. 23 (2013), pp. 475-507.
10. 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.
11. R. D. C. Monteiro and B. F. Svaiter, Iteration-complexity of a Newton proximal extragradient method for monotone variational inequalities and inclusion problems, SIAM J. Optim., 22 (2012), pp. 914-935.
12. Y. Nesterov, Accelerating the cubic regularization of Newton's method on convex problems, Math. Program., 112 (2008), pp. 159-181.
13. Y. E. Nesterov, Smooth minimization of nonsmooth functions, Math. Program., 103 (2005), pp. 127-152.
14. R. T. Rockafellar, On the maximal monotonicity of subdifferential mappings, Pacific J. Math., 33 (1970), pp. 209-216.
15. R. T. Rockafellar, Augmented Lagrangians and applications of the proximal point algorithm in convex programming, Math. Oper. Res., 1 (1976), pp. 97-116.
16. R. T. Rockafellar, Monotone operators and the proximal point algorithm, SIAM J. Control Optimization, 14 (1976), pp. 877-898.
17. S. Salzo and S. Villa, Inexact and accelerated proximal point algorithms, J. Convex Anal., 19 (2012).
18. 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.
19. M. V. Solodov and B. F. Svaiter, A hybrid projection-proximal point algorithm, J. Convex Anal., 6 (1999), pp. 59-70.
20. 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.
21. 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.
22. P. Tseng, On Accelerated Proximal Gradient Methods for Convex-Concave Optimization, Tech. report, Department of Mathematics, University of Washington, 2008.