Iteration-complexity of block-decomposition algorithms and the alternating direction method of multipliers

SIAM Journal on Optimization

Volumn 23, Issue 1, 2013, Pages 475-507

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

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b IMPA   (Brazil)

Author keywords

Complexity; Decomposition; Extragradient; Inclusion problem; Monotone operator; Proximal

Indexed keywords

CONSENSUS ALGORITHM; MATHEMATICAL OPERATORS;

ALTERNATING DIRECTIONS METHOD OF MULTIPLIERS; BLOCK DECOMPOSITION; COMPLEXITY; ERGODICS; EXTRAGRADIENT; INCLUSION PROBLEM; MAXIMAL MONOTONE OPERATORS; MONOTONE OPERATORS; PROXIMAL; SUB-PROBLEMS;

ITERATIVE METHODS;

EID: 84877788900     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/110849468     Document Type: Article

References (30)

1. R. S. BURACHIK, A. N. IUSEM, ÄND B. F. SVAiTER, Enlargement of monotone operators with applications to variational inequalities, Set-Valued Anal., 5 (1997), pp. 159-180.
2. R. S. BURACHIK, C. A. SAGASTiZÁBAL, AND B. F. SVAiTER, t-enlargements of maximal monotone operators: Theory and applications, in Reformulation: Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods (Lausanne, 1997), Appl. Optim. 22, Kluwer, Dordrecht, The Netherlands 1999, pp. 25-43.
3. R. S. BURACHIK AND B. F. SVAITER, Maximal monotone operators, convex functions, and a special family of enlargements, Set-Valued Anal., 10 (2002), pp. 297-316.
4. S. BURER, Optimizing a polyhedral-semidefinite relaxation of completely positive programs, Math. Program. Comput., 2 (2010), pp. 1-19.
5. S. BURER AND D. VANDENBUSSCHE, Solving lift-and-roject relaxations of binary integer pro- grams, SIAM J. Optim., 16 (2006), pp. 726-750.
6. A. CHAMBOLLE AND T. PoCK, A first-order primal-dual algorithm for convex problems with applications to imaging, J. Math. Imaging Vision, 40 (2011), pp. 120-145.
7. J. EcKSTEIN AND B. F. SVAITER, A family of projective splitting methods for the sum of two maximal monotone operators, Math. Program., 111 (2008), pp. 173-199.
8. J. EcKSTEIN AND B. F. SVAITER, General projective splitting methods for sums of maximal monotone operators, SIAM J. Control Optim., 48 (2009), pp. 787-811.
9. F. FACCHINEI AND J.-S. PÄNG, Finite-Dimensional Variational Inequalities and Complemen- tarity Problems, Volume II, Springer-Verlag, New York, 2003.
10. D. GABAY AND B. MiRCIER, A dual algorithm for the solution ofnonlinear variational problems viafinite element approximation, Comput. Math. Appl., 2 (1976), pp. 17-40.
11. R. GLOWINSKI AND A. MARROCO, Sur l'approximation, par ́eements finis d'ordre un, et la ŕesolution, par penalisation-dualit'e, d'une classe de probl̀emes de Dirichlet non lińeaires, RAIRO Anal. Numer., 9 (1975), pp. 41-76.
12. F. JARRE AND F. RiNDL, An augmented primal-dual method for linear conic programs, SIAM J. Optim., 19 (2008), pp. 808-823.
13. G. M. KoRPELEVIč, An extragradient method for finding saddle points and for other problems, Ekonom. i Mat. Metody, 12 (1976), pp. 747-756.
14. J. MALiuCK, J. PoVH, F. RiNDL, AND A. WiEGELE, Regularization methods for semidefinite programming, SIAM J. Optim., 20 (2009), pp. 336-356.
15. R. D. C. MoNTEIRO AND B. F. SVAITER, On the complexity ofthe hybridproximal extragradient method for the iterates and the ergodic mean, SIAM J. Optim., 20 (2010), pp. 2755-2787.
16. 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-oint and convex optimization problems, SIAM J. Optim., 21 (2011), pp. 1688-1720.
17. A. NEMIROVSKI, Prox-method with rate of convergence O(1/t) for variational inequalities with Lipschitz continuous monotone operators and smooth convex-concave saddle point problems, SIAM J. Optim., 15 (2004), pp. 229-251.
18. Y. NESTEROV, Dual extrapolation and its applications to solving variational inequalities and related problems, Math. Program., 109 (2007), pp. 319-344.
19. M. A. NoOR, An extraresolvent method for monotone mixed variational inequalities, Math. Comput. Modelling, 29 (1999), pp. 95-100.
20. A. OUOROU, Epsilon-roximal decomposition method, Math. Program., 99 (2004), pp. 89-108.
21. J. PoVH, F. RENDL, AND A. WiEGELE, A boundary point method to solve semidefinite programs, Computing, 78 (2006), pp. 277-286.
22. R. T. Rockafellar, On the maximal monotonicity of subdifferential mappings, Pacific J. Math., 33 (1970), pp. 209-216.
23. R. T. Rockafellar, Monotone operators and the proximal point algorithm, SIAM J. Control Optim., 14 (1976), pp. 877-898.
24. M. V. SoLODOV, A class of decomposition methods for convex optimization and monotone variational inclusions via the hybrid inexact proximal point framework, Optim. Methods Softw., 19 (2004), pp. 557-575.
25. M. V. SoLODOV AND B. F. SVAITER, A hybrid approximate extragradient-roximal point algo- rithm using the enlargement of a maximal monotone operator, Set-Valued Anal., 7 (1999), pp. 323-345.
26. M. V. SoLODOV AND B. F. SVAITER, A hybrid projection-roximal point algorithm, J. Convex Anal., 6 (1999), pp. 59-70.
27. 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.
28. 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.
29. B. F. SVAITER, A family of enlargements of maximal monotone operators, Set-Valued Anal., 8 (2000), pp. 311-328.
30. P. TSENG, A modified forward-backward splitting method for maximal monotone mappings, SIAM J. Control Optim., 38 (2000), pp. 431-446.