# American Institute of Mathematical Sciences

July  2014, 10(3): 743-759. doi: 10.3934/jimo.2014.10.743

## Relaxed augmented Lagrangian-based proximal point algorithms for convex optimization with linear constraints

 1 School of Applied Mathematics, Nanjing University of Finance & Economics, Nanjing, 210023, China 2 School of Mathematical Sciences, University of Electronic Science and Technology of China, Chengdu, 611731, China 3 Department of Mathematics, Nanjing University, Nanjing, 210093

Received  February 2012 Revised  December 2012 Published  November 2013

The classical augmented Lagrangian method (ALM) is an efficient method for solving convex optimization with linear constraints. However, the efficiency of ALM, to some extent, is hinged by the computational efforts on solving the resulting subproblems. For the convex optimization with some favorable structures, e.g., either the objective function is separable or the matrices in linear constraints are well-posed, a relaxation to the subproblems of ALM can substantially result in solutions with closed-form. Unfortunately, the relaxation skill can not be extended directly to the generic convex optimization without special structures, particularly for the case of objective function with coupled variables. In this paper, by further relaxing the resulting subproblems of ALM, we propose several novel augmented Lagrangian-based proximal point algorithms. Algorithmically, the next iterate is produced by integrating the predictor, which is obtained in either primal-dual or dual-primal order, with the current iterate. Numerical results demonstrate the promising performances of the proposed algorithms.
Citation: Yuan Shen, Wenxing Zhang, Bingsheng He. Relaxed augmented Lagrangian-based proximal point algorithms for convex optimization with linear constraints. Journal of Industrial & Management Optimization, 2014, 10 (3) : 743-759. doi: 10.3934/jimo.2014.10.743
##### References:
 [1] M. V. Afonso, J. M. Bioucas-Dias and M. A. Figueiredo, An augmented lagrangian approach to the constrained optimization formulation of imaging inverse problems,, IEEE Trans. Imag. Process., 20 (2011), 681.  doi: 10.1109/TIP.2010.2076294.  Google Scholar [2] D. P. Bertsekas, Multiplier methods: A survey,, Automatica, 12 (1976), 133.  doi: 10.1016/0005-1098(76)90077-7.  Google Scholar [3] D. P. Bertsekas, Constrained Optimization and Lagrange Multiplier Methods,, Academic Press, (1982).   Google Scholar [4] S. Boyd, N. Parikh, E. Chu, B. Peleato and J. Eckstein, Distributed optimization and statistical learning via the alternating direction method of multipliers,, Found. Trends Mach. Learn., 3 (2010), 1.  doi: 10.1561/2200000016.  Google Scholar [5] G. Chen and M. Teboulle, A proximal-based decomposition method for convex minimization problems,, Math. Program., 64 (1994), 81.  doi: 10.1007/BF01582566.  Google Scholar [6] J. Eckstein, Some saddle-function splitting methods for convex programming,, Optim. Methods Softw., 4 (1994), 75.  doi: 10.1080/10556789408805578.  Google Scholar [7] J. Eckstein and D. P. Bertsekas, On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators,, Math. Program., 55 (1992), 293.  doi: 10.1007/BF01581204.  Google Scholar [8] J. Eckstein and M. Fukushima, Some reformulation and applications of the alternating direction method of multipliers,, in Large Scale Optimization: State of the Art (Eds. W. W. Hager, (1994), 115.   Google Scholar [9] E. Esser, Applications of Lagrangian-Based Alternating Direction Methods and Connections to Split Bregman,, UCLA CAM Report, (2009), 9.   Google Scholar [10] F. Facchinei and J. S. Pang, Finite-Dimensional Variational Inequalities and Complementarity Problems,, Springer-Verlag, (2003).   Google Scholar [11] X. L. Fu and B. S. He, Self-adaptive projection-based prediction-correction method for constrained variational inequalities,, Front. Math. China, 5 (2010), 3.  doi: 10.1007/s11464-009-0045-1.  Google Scholar [12] M. Fukushima, Application of the alternating direction method of multipliers to separable convex programming problems,, Comput. Optim. Appl., 1 (1992), 93.  doi: 10.1007/BF00247655.  Google Scholar [13] D. Gabay, Applications of the method of multipliers to variational inequalities,, in Augmented Lagrangian Methods: Applications to the Numerical Solution of Boundary-Value Problems (eds. M. Fortin and R. Glowinski), (1983), 299.  doi: 10.1016/S0168-2024(08)70034-1.  Google Scholar [14] R. Glowinski, Numerical Methods for Nonlinear Variational Problems,, Springer-Verlag, (1984).   Google Scholar [15] R. Glowinski and P. Le Tallec, Augmented Lagrangian and Operator-Splitting Methods in Nonlinear Mechanics,, SIAM, (1989).  doi: 10.1137/1.9781611970838.  Google Scholar [16] T. Goldstein and S. Osher, The split bregman method for l1-regularized problems,, SIAM J. Imag. Sci., 2 (2009), 323.  doi: 10.1137/080725891.  Google Scholar [17] G. H. Golub and C. F. Van Loan, Matrix Computations,, Johns Hopkins University Press, (1996).   Google Scholar [18] B. He, L. Liao, D. Han and H. Yang, A new inexact alternating directions method for monotone variational inequalities,, Math. Program., 92 (2002), 103.  doi: 10.1007/s101070100280.  Google Scholar [19] B. He, L. Liao and X. Wang, Proximal-like contraction methods for monotone variational inequalities in a unified framework,, Comput. Optim. Appl., 51 (2012), 649.  doi: 10.1007/s10589-010-9372-0.  Google Scholar [20] B. He and H. Yang, Some convergence properties of a method of multipliers for linearly constrained monotone variational inequalities,, Oper. Res. Lett., 23 (1998), 151.  doi: 10.1016/S0167-6377(98)00044-3.  Google Scholar [21] B. He and X. Yuan, On the $\mathcalO(1/t)$ convergence rate of the alternating direction method,, SIAM J. Numer. Anal., 50 (2012), 700.  doi: 10.1137/110836936.  Google Scholar [22] M. R. Hestenes, Multiplier and gradient methods,, J. Optim. Theory App., 4 (1969), 303.  doi: 10.1007/BF00927673.  Google Scholar [23] Z. Lin, M. Chen, L. Wu and Y. Ma, The augmented lagrange multiplier method for exact recovery of a corrupted low-rank matrices,, preprint, ().   Google Scholar [24] A. Nagurney, Network Economics, A Variational Inequality Approach,, Kluwer Academics Publishers, (1993).  doi: 10.1007/978-94-011-2178-1.  Google Scholar [25] M. J. D. Powell, A method for nonlinear constraints in minimization problems,, in Optimization (ed. R. Fletcher), (1969), 283.   Google Scholar [26] S. Ramani and J. A. Fessler, Parallel mr image reconstruction using augmented lagrangian methods,, IEEE Trans. Medical Imaging, 30 (2011), 694.  doi: 10.1109/TMI.2010.2093536.  Google Scholar [27] R. T. Rockafellar, Augmented Lagrangians and applications of the proximal point algorithm in convex programming,, Math. Oper. Res., 1 (1976), 97.  doi: 10.1287/moor.1.2.97.  Google Scholar [28] Y. Shen, Partial convolution total variation problem by augmented Lagrangian-based proximal point descent algorithm,, submitted to J. Comput. Math., (2013).   Google Scholar [29] Y. Shen and B. He, New augmented Lagrangian-based proximal point algorithms for constrained optimization,, Submitted to Front. Math. China, ().   Google Scholar [30] Y. Wang, J. Yang, W. Yin and Y. Zhang, A new alternating minimization algorithm for total variation image reconstruction,, SIAM J. Imaging. Sci., 1 (2008), 248.  doi: 10.1137/080724265.  Google Scholar [31] J. Yang and Y. Zhang, Alternating direction algorithms for $l_1$-problems in compressive sensing,, SIAM J. Sci. Comput., 33 (2011), 250.  doi: 10.1137/090777761.  Google Scholar [32] J. Yang, Y. Zhang and W. Yin, An efficient tvl1 algorithm for deblurring multichannel images corrupted by impulsive noise,, SIAM J. Sci. Comput., 31 (2009), 2842.  doi: 10.1137/080732894.  Google Scholar [33] W. Yin, S. Osher, D. Goldfarb and J. Darbon, Bregman iterative algorithms for $l_1$-minimization with applications to compressed sensing,, SIAM J. Imaging Sci., 1 (2008), 143.  doi: 10.1137/070703983.  Google Scholar

show all references

##### References:
 [1] M. V. Afonso, J. M. Bioucas-Dias and M. A. Figueiredo, An augmented lagrangian approach to the constrained optimization formulation of imaging inverse problems,, IEEE Trans. Imag. Process., 20 (2011), 681.  doi: 10.1109/TIP.2010.2076294.  Google Scholar [2] D. P. Bertsekas, Multiplier methods: A survey,, Automatica, 12 (1976), 133.  doi: 10.1016/0005-1098(76)90077-7.  Google Scholar [3] D. P. Bertsekas, Constrained Optimization and Lagrange Multiplier Methods,, Academic Press, (1982).   Google Scholar [4] S. Boyd, N. Parikh, E. Chu, B. Peleato and J. Eckstein, Distributed optimization and statistical learning via the alternating direction method of multipliers,, Found. Trends Mach. Learn., 3 (2010), 1.  doi: 10.1561/2200000016.  Google Scholar [5] G. Chen and M. Teboulle, A proximal-based decomposition method for convex minimization problems,, Math. Program., 64 (1994), 81.  doi: 10.1007/BF01582566.  Google Scholar [6] J. Eckstein, Some saddle-function splitting methods for convex programming,, Optim. Methods Softw., 4 (1994), 75.  doi: 10.1080/10556789408805578.  Google Scholar [7] J. Eckstein and D. P. Bertsekas, On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators,, Math. Program., 55 (1992), 293.  doi: 10.1007/BF01581204.  Google Scholar [8] J. Eckstein and M. Fukushima, Some reformulation and applications of the alternating direction method of multipliers,, in Large Scale Optimization: State of the Art (Eds. W. W. Hager, (1994), 115.   Google Scholar [9] E. Esser, Applications of Lagrangian-Based Alternating Direction Methods and Connections to Split Bregman,, UCLA CAM Report, (2009), 9.   Google Scholar [10] F. Facchinei and J. S. Pang, Finite-Dimensional Variational Inequalities and Complementarity Problems,, Springer-Verlag, (2003).   Google Scholar [11] X. L. Fu and B. S. He, Self-adaptive projection-based prediction-correction method for constrained variational inequalities,, Front. Math. China, 5 (2010), 3.  doi: 10.1007/s11464-009-0045-1.  Google Scholar [12] M. Fukushima, Application of the alternating direction method of multipliers to separable convex programming problems,, Comput. Optim. Appl., 1 (1992), 93.  doi: 10.1007/BF00247655.  Google Scholar [13] D. Gabay, Applications of the method of multipliers to variational inequalities,, in Augmented Lagrangian Methods: Applications to the Numerical Solution of Boundary-Value Problems (eds. M. Fortin and R. Glowinski), (1983), 299.  doi: 10.1016/S0168-2024(08)70034-1.  Google Scholar [14] R. Glowinski, Numerical Methods for Nonlinear Variational Problems,, Springer-Verlag, (1984).   Google Scholar [15] R. Glowinski and P. Le Tallec, Augmented Lagrangian and Operator-Splitting Methods in Nonlinear Mechanics,, SIAM, (1989).  doi: 10.1137/1.9781611970838.  Google Scholar [16] T. Goldstein and S. Osher, The split bregman method for l1-regularized problems,, SIAM J. Imag. Sci., 2 (2009), 323.  doi: 10.1137/080725891.  Google Scholar [17] G. H. Golub and C. F. Van Loan, Matrix Computations,, Johns Hopkins University Press, (1996).   Google Scholar [18] B. He, L. Liao, D. Han and H. Yang, A new inexact alternating directions method for monotone variational inequalities,, Math. Program., 92 (2002), 103.  doi: 10.1007/s101070100280.  Google Scholar [19] B. He, L. Liao and X. Wang, Proximal-like contraction methods for monotone variational inequalities in a unified framework,, Comput. Optim. Appl., 51 (2012), 649.  doi: 10.1007/s10589-010-9372-0.  Google Scholar [20] B. He and H. Yang, Some convergence properties of a method of multipliers for linearly constrained monotone variational inequalities,, Oper. Res. Lett., 23 (1998), 151.  doi: 10.1016/S0167-6377(98)00044-3.  Google Scholar [21] B. He and X. Yuan, On the $\mathcalO(1/t)$ convergence rate of the alternating direction method,, SIAM J. Numer. Anal., 50 (2012), 700.  doi: 10.1137/110836936.  Google Scholar [22] M. R. Hestenes, Multiplier and gradient methods,, J. Optim. Theory App., 4 (1969), 303.  doi: 10.1007/BF00927673.  Google Scholar [23] Z. Lin, M. Chen, L. Wu and Y. Ma, The augmented lagrange multiplier method for exact recovery of a corrupted low-rank matrices,, preprint, ().   Google Scholar [24] A. Nagurney, Network Economics, A Variational Inequality Approach,, Kluwer Academics Publishers, (1993).  doi: 10.1007/978-94-011-2178-1.  Google Scholar [25] M. J. D. Powell, A method for nonlinear constraints in minimization problems,, in Optimization (ed. R. Fletcher), (1969), 283.   Google Scholar [26] S. Ramani and J. A. Fessler, Parallel mr image reconstruction using augmented lagrangian methods,, IEEE Trans. Medical Imaging, 30 (2011), 694.  doi: 10.1109/TMI.2010.2093536.  Google Scholar [27] R. T. Rockafellar, Augmented Lagrangians and applications of the proximal point algorithm in convex programming,, Math. Oper. Res., 1 (1976), 97.  doi: 10.1287/moor.1.2.97.  Google Scholar [28] Y. Shen, Partial convolution total variation problem by augmented Lagrangian-based proximal point descent algorithm,, submitted to J. Comput. Math., (2013).   Google Scholar [29] Y. Shen and B. He, New augmented Lagrangian-based proximal point algorithms for constrained optimization,, Submitted to Front. Math. China, ().   Google Scholar [30] Y. Wang, J. Yang, W. Yin and Y. Zhang, A new alternating minimization algorithm for total variation image reconstruction,, SIAM J. Imaging. Sci., 1 (2008), 248.  doi: 10.1137/080724265.  Google Scholar [31] J. Yang and Y. Zhang, Alternating direction algorithms for $l_1$-problems in compressive sensing,, SIAM J. Sci. Comput., 33 (2011), 250.  doi: 10.1137/090777761.  Google Scholar [32] J. Yang, Y. Zhang and W. Yin, An efficient tvl1 algorithm for deblurring multichannel images corrupted by impulsive noise,, SIAM J. Sci. Comput., 31 (2009), 2842.  doi: 10.1137/080732894.  Google Scholar [33] W. Yin, S. Osher, D. Goldfarb and J. Darbon, Bregman iterative algorithms for $l_1$-minimization with applications to compressed sensing,, SIAM J. Imaging Sci., 1 (2008), 143.  doi: 10.1137/070703983.  Google Scholar
 [1] Mohsen Abdolhosseinzadeh, Mir Mohammad Alipour. Design of experiment for tuning parameters of an ant colony optimization method for the constrained shortest Hamiltonian path problem in the grid networks. Numerical Algebra, Control & Optimization, 2021, 11 (2) : 321-332. doi: 10.3934/naco.2020028 [2] Yuri Chekanov, Felix Schlenk. Notes on monotone Lagrangian twist tori. Electronic Research Announcements, 2010, 17: 104-121. doi: 10.3934/era.2010.17.104 [3] Sandrine Anthoine, Jean-François Aujol, Yannick Boursier, Clothilde Mélot. Some proximal methods for Poisson intensity CBCT and PET. Inverse Problems & Imaging, 2012, 6 (4) : 565-598. doi: 10.3934/ipi.2012.6.565 [4] J. Frédéric Bonnans, Justina Gianatti, Francisco J. Silva. On the convergence of the Sakawa-Shindo algorithm in stochastic control. Mathematical Control & Related Fields, 2016, 6 (3) : 391-406. doi: 10.3934/mcrf.2016008 [5] Vakhtang Putkaradze, Stuart Rogers. Numerical simulations of a rolling ball robot actuated by internal point masses. Numerical Algebra, Control & Optimization, 2021, 11 (2) : 143-207. doi: 10.3934/naco.2020021 [6] Demetres D. Kouvatsos, Jumma S. Alanazi, Kevin Smith. A unified ME algorithm for arbitrary open QNMs with mixed blocking mechanisms. Numerical Algebra, Control & Optimization, 2011, 1 (4) : 781-816. doi: 10.3934/naco.2011.1.781 [7] Joel Fotso Tachago, Giuliano Gargiulo, Hubert Nnang, Elvira Zappale. Multiscale homogenization of integral convex functionals in Orlicz Sobolev setting. Evolution Equations & Control Theory, 2021, 10 (2) : 297-320. doi: 10.3934/eect.2020067 [8] Ardeshir Ahmadi, Hamed Davari-Ardakani. A multistage stochastic programming framework for cardinality constrained portfolio optimization. Numerical Algebra, Control & Optimization, 2017, 7 (3) : 359-377. doi: 10.3934/naco.2017023 [9] Luke Finlay, Vladimir Gaitsgory, Ivan Lebedev. Linear programming solutions of periodic optimization problems: approximation of the optimal control. Journal of Industrial & Management Optimization, 2007, 3 (2) : 399-413. doi: 10.3934/jimo.2007.3.399 [10] Armin Lechleiter, Tobias Rienmüller. Factorization method for the inverse Stokes problem. Inverse Problems & Imaging, 2013, 7 (4) : 1271-1293. doi: 10.3934/ipi.2013.7.1271 [11] Lei Liu, Li Wu. Multiplicity of closed characteristics on $P$-symmetric compact convex hypersurfaces in $\mathbb{R}^{2n}$. Discrete & Continuous Dynamical Systems - A, 2020  doi: 10.3934/dcds.2020378 [12] Qiang Guo, Dong Liang. An adaptive wavelet method and its analysis for parabolic equations. Numerical Algebra, Control & Optimization, 2013, 3 (2) : 327-345. doi: 10.3934/naco.2013.3.327 [13] Hong Seng Sim, Wah June Leong, Chuei Yee Chen, Siti Nur Iqmal Ibrahim. Multi-step spectral gradient methods with modified weak secant relation for large scale unconstrained optimization. Numerical Algebra, Control & Optimization, 2018, 8 (3) : 377-387. doi: 10.3934/naco.2018024 [14] Abdulrazzaq T. Abed, Azzam S. Y. Aladool. Applying particle swarm optimization based on Padé approximant to solve ordinary differential equation. Numerical Algebra, Control & Optimization, 2021  doi: 10.3934/naco.2021008 [15] Reza Lotfi, Yahia Zare Mehrjerdi, Mir Saman Pishvaee, Ahmad Sadeghieh, Gerhard-Wilhelm Weber. A robust optimization model for sustainable and resilient closed-loop supply chain network design considering conditional value at risk. Numerical Algebra, Control & Optimization, 2021, 11 (2) : 221-253. doi: 10.3934/naco.2020023 [16] Tao Wu, Yu Lei, Jiao Shi, Maoguo Gong. An evolutionary multiobjective method for low-rank and sparse matrix decomposition. Big Data & Information Analytics, 2017, 2 (1) : 23-37. doi: 10.3934/bdia.2017006 [17] Deren Han, Zehui Jia, Yongzhong Song, David Z. W. Wang. An efficient projection method for nonlinear inverse problems with sparsity constraints. Inverse Problems & Imaging, 2016, 10 (3) : 689-709. doi: 10.3934/ipi.2016017 [18] Boris Kramer, John R. Singler. A POD projection method for large-scale algebraic Riccati equations. Numerical Algebra, Control & Optimization, 2016, 6 (4) : 413-435. doi: 10.3934/naco.2016018 [19] Petra Csomós, Hermann Mena. Fourier-splitting method for solving hyperbolic LQR problems. Numerical Algebra, Control & Optimization, 2018, 8 (1) : 17-46. doi: 10.3934/naco.2018002 [20] Christina Surulescu, Nicolae Surulescu. Modeling and simulation of some cell dispersion problems by a nonparametric method. Mathematical Biosciences & Engineering, 2011, 8 (2) : 263-277. doi: 10.3934/mbe.2011.8.263

2019 Impact Factor: 1.366