Iteration-complexity of block-decomposition algorithms and the alternating minimization augmented Lagrangian method

In this paper, we consider the monotone inclusion problem consisting of the sum of a continuous monotone map and a point-to-set maximal monotone operator with a separable two-block structure and introduce a framework of block-decomposition prox-type algorithms for solving it which allows for each one of the single-block proximal subproblems to be solved in an approximate sense. Moreover, by showing that any method in this framework is also a special instance of the hybrid proximal extragradient (HPE) method introduced by Solodov and Svaiter, we derive corresponding convergence rate results. We also describe some instances of the framework based on specific and inexpensive schemes for solving the singleblock proximal subproblems. Finally, we consider some applications of our methodology to: i) propose new algorithms for the monotone inclusion problem consisting of the sum of two maximal monotone operators, and; ii) study the complexity of the classical alternating minimization augmented Lagrangian method for a class of linearly constrained convex programming problems with proper closed convex objective functions.

[1]  R. Rockafellar,et al.  On the maximal monotonicity of subdifferential mappings. , 1970 .

[2]  R. Glowinski,et al.  Sur l'approximation, par éléments finis d'ordre un, et la résolution, par pénalisation-dualité d'une classe de problèmes de Dirichlet non linéaires , 1975 .

[3]  R. Rockafellar.  Monotone Operators and the Proximal Point Algorithm , 1976 .

[4]  B. Mercier,et al.  A dual algorithm for the solution of nonlinear variational problems via finite element approximation , 1976 .

[5]  A. Iusem,et al.  Enlargement of Monotone Operators with Applications to Variational Inequalities , 1997 .

[6]  M. V. Solodovy,et al.  A Hybrid Projection{proximal Point Algorithm , 1998 .

[7]  B. Svaiter,et al.  ε-Enlargements of Maximal Monotone Operators: Theory and Applications , 1998 .

[8]  M. Solodov,et al.  A Hybrid Approximate Extragradient – Proximal Point Algorithm Using the Enlargement of a Maximal Monotone Operator , 1999 .

[9]  Benar Fux Svaiter,et al.  A Family of Enlargements of Maximal Monotone Operators , 2000 .

[10]  Benar Fux Svaiter,et al.  An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions , 2000, Math. Oper. Res..

[11]  Paul Tseng,et al.  A Modified Forward-backward Splitting Method for Maximal Monotone Mappings 1 , 1998 .

[12]  M. Solodov,et al.  A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS , 2001 .

[13]  Benar Fux Svaiter,et al.  Maximal Monotone Operators, Convex Functions and a Special Family of Enlargements , 2002 .

[14]  F. Facchinei,et al.  Finite-Dimensional Variational Inequalities and Complementarity Problems , 2003 .

[15]  Mikhail V. Solodov,et al.  A class of decomposition methods for convex optimization and monotone variational inclusions via the hybrid inexact proximal point framework , 2004, Optim. Methods Softw..

[16]  Arkadi Nemirovski,et al.  Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems , 2004, SIAM J. Optim..

[17]  Adam Ouorou.  Epsilon-proximal decomposition method , 2004, Math. Program..

[18]  Samuel Burer,et al.  Solving Lift-and-Project Relaxations of Binary Integer Programs , 2006, SIAM J. Optim..

[19]  Franz Rendl,et al.  A Boundary Point Method to Solve Semidefinite Programs , 2006, Computing.

[20]  Benar Fux Svaiter,et al.  A family of projective splitting methods for the sum of two maximal monotone operators , 2007, Math. Program..

[21]  Franz Rendl,et al.  An Augmented Primal-Dual Method for Linear Conic Programs , 2008, SIAM J. Optim..

[22]  Benar Fux Svaiter,et al.  General Projective Splitting Methods for Sums of Maximal Monotone Operators , 2009, SIAM J. Control. Optim..

[23]  Franz Rendl,et al.  Regularization Methods for Semidefinite Programming , 2009, SIAM J. Optim..

[24]  M. Fukushima,et al.  "Reformulation: Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods" , 2010 .

[25]  Antonin Chambolle,et al.  A First-Order Primal-Dual Algorithm for Convex Problems with Applications to Imaging , 2011, Journal of Mathematical Imaging and Vision.

[26]  Samuel Burer,et al.  Optimizing a polyhedral-semidefinite relaxation of completely positive programs , 2010, Math. Program. Comput..

[27]  Renato D. C. Monteiro,et al.  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 , 2011, SIAM J. Optim..