Dual–primal proximal point algorithms for extended convex programming

References

• H.H. Bauschke and P.L. Combettes, Fejér monotonicity and fixed point iterations, in Convex Analysis and Monotone Operator Theory in Hilbert Spaces, K. Dilcher, K. Taylor, eds., CMS Books in Mathematics, Springer, New York, 2011, pp. 75–86.
   Google Scholar
• 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(1) (2011), pp. 1–122. doi: 10.1561/2200000016
   Google Scholar
• J.F. Cai, E.J. Candès, and Z.W. Shen, A singular value thresholding algorithm for matrix completion, SIAM J. Optim. 20 (2010), pp. 1956–1982. doi: 10.1137/080738970
   Web of Science ®Google Scholar
• A. Chambolle and T. Pock, A first-order primal–dual algorithms for convex problem with applications to imaging, J. Math, Imaging Vis. 40 (2011), pp. 120–145. doi: 10.1007/s10851-010-0251-1
   Web of Science ®Google Scholar
• C.H. Chen, B.S. He, Y.Y. Ye, and X.M Yuan, The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent, Optim. Online, 2013, pp. 1–15. Available at http://www.optimization-online.org/DB_FILE/2013/09/4059.pdf.
   Google Scholar
• J. Eckstein, Nonlinear proximal point algorithms using Bregman functions with applications to convex programming, Math. Oper. Res. 18(1) (1993), pp. 202–226. doi: 10.1287/moor.18.1.202
   Web of Science ®Google Scholar
• J. Eckstein, Some saddle-function splitting methods for convex programming, Optim. Methods Softw. 4 (1994), pp. 75–83. doi: 10.1080/10556789408805578
   Google Scholar
• J. Eckstein, Augmented Lagrangian and alternating direction methods for convex optimization: A tutorial and some illustrative computational results, RUTCOR Research Report RRR 32-2012, Rutgers University, 2012.
   Google Scholar
• J. Eckstein and M. Fukushima, Some reformulation and applications of the alternating direction method of multipliers, in Large Scale Optimization: State of the Art, W.W. Hager, D.W. Hearn, P.M. Pardalos, eds., Kluwer Academic Publishers, Dordrecht, 1994, pp. 115–134.
   Google Scholar
• F. Facchinei and J.S. Pang (eds.), Finite-dimensional Variational Inequalities and Complementarity Problems, Springer Series in Operations Research, Springer, Berlin, 2003.
   Google Scholar
• M. Fortin and R. Glowinski (eds.), Augmented Lagrangian Methods: Applications to the solution of boundary-valued problems, North-Holland, Amsterdam, 1983.
   Google Scholar
• M. Fukushima, Application of the alternating direction method of multipliers to separable convex programming problems, Comput. Optim. Appl. 2 (1992), pp. 93–111. doi: 10.1007/BF00247655
   Google Scholar
• D. Gabay, Applications of the method of multipliers to variational inequalities, in Augmented Lagrange Methods: Applications to the Solution of Boundary-valued Problems, M. Fortin and R. Glowinski, eds., North-Holland, Amsterdam, he Netherlands, 1983, pp. 299–331.
   Google Scholar
• D. Gabay and B. Mercier, A dual algorithm for the solution of nonlinear variational problems via finite-element approximations, Comput. Math. Appl. 2 (1976), pp. 17–40. doi: 10.1016/0898-1221(76)90003-1
   Google Scholar
• R. Glowinski, Numerical Methods for Nonlinear Variational Problems, Springer, New York, 1984.
   Google Scholar
• A. Hamdi, A primal-dual proximal point algorithm for constrained convex programs, Appl. Math. Comput. 162(1) (2005), pp. 293–303. doi: 10.1016/j.amc.2003.12.137
   Web of Science ®Google Scholar
• A. Hamdi and S. K. Mishra, Decomposition methods based on augmented Lagrangians: a survey, in Topics in Nonconvex Optimization: Theory and Applications, S.K. Mishra, ed., Springer, Berlin, 2011, pp. 175–203.
   Google Scholar
• D.R. Han, X.M. Yuan, and W.X. Zhang, An augmented-Lagrangian-based parallel splitting method for separable convex minimization with applications to image processing, Math. Comput. 83 (2014), pp. 2263–2291. doi: 10.1090/S0025-5718-2014-02829-9
   Web of Science ®Google Scholar
• B.S. He and X.M. Yuan, A contraction method with implementable proximal regularization for linearly constrained convex programming, Optim. Online, 2011, pp. 1–14. Available at http://www.optimization-online.org/DB_FILE/2010/11/2817.pdf.
   Google Scholar
• B.S. He and X.M. Yuan, On the O(1/n) convergence rate of the Douglas–Rachford alternating direction method, SIAM J. Num. Anal. 50 (2012), pp. 700–709. doi: 10.1137/110836936
   Web of Science ®Google Scholar
• B.S. He, L-Z Liao, D.R. Han, and H. Yang, A new inexact alternating directions method for monotone variational inequalities, Math. Program. Ser. A 92 (2002), pp. 103–118. doi: 10.1007/s101070100280
   Web of Science ®Google Scholar
• B.S. He, M. Tao, and X.M. Yuan, Alternating direction method with Gaussian back substitution for separable convex programming, SIAM J. Optim. 22 (2012), pp. 313–340. doi: 10.1137/110822347
   Web of Science ®Google Scholar
• M. Hong and Z.Q. Luo, On the linear convergence of the alternating direction method of multipliers, arXiv:1208.3922v3 (2013).
   Google Scholar
• S. Kontogiorgis and R.R. Meyer, A variable-penalty alternating directions method for convex optimization, Math. Program. 83 (1998), pp. 29–53.
   Web of Science ®Google Scholar
• B. Martinet, Regularisation, d'inéquations variationelles par approximations successives, Rev. Francaise d'Inform. Recherche Oper. 4 (1970), pp. 154–159.
   Google Scholar
• Y. Nesterov, Gradient methods for minimizing composite objective function, Core Discussion Paper. 2007/76 (2007), pp. 1–30.
   Google Scholar
• R.T. Rockafellar, Augmented Lagrangians and applications of the proximal point algorithm in convex programming, Math. Oper. Res. 1 (1976), pp. 97–116. doi: 10.1287/moor.1.2.97
   Google Scholar
• R.T. Rockafellar, Monotone operators and the proximal point algorithm, SIAM J. Control Optim. 14 (1976), pp. 877–898. doi: 10.1137/0314056
   Web of Science ®Google Scholar