A Strictly Contractive Peaceman-Rachford Splitting Method with Logarithmic-Quadratic Proximal Regularization for Convex Programming

References

• Auslender A, Teboulle M (2000) Lagrangian duality and related multiplier methods for variational inequality problems. SIAM J. Optim. 10(4):1097–1115.Crossref, Google Scholar
• Auslender A, Teboulle M (2001) Entropic proximal decomposition methods for convex programs and variational inequalities. Math. Program. 91(1):33–47.Google Scholar
• Auslender A, Teboulle M (2004) Interior gradient and epsilon-subgradient descent methods for constrained convex minimization. Math. Oper. Res. 29(1):1–26.Link, Google Scholar
• Auslender A, Teboulle M (2005) Interior projection-like methods for monotone variational inequalities. Math. Program. 104(1):39–68.Crossref, Google Scholar
• Auslender A, Teboulle M (2006) Interior gradient and proximal methods for convex and conic optimization. SIAM J. Optim. 16(3):697–725.Crossref, Google Scholar
• Auslender A, Teboulle M, Ben-Tiba S (1999) A logarithmic-quadratic proximal method for variational inequalities. Comput. Optim. Appl. 12:31–40.Crossref, Google Scholar
• Bertsekas DP (1982) Constrained Optimization and Lagrange Multiplier Methods (Academic Press, New York).Google Scholar
• Blum E, Oettli W (1975) Mathematische Optimierung. Grundlagen und Verfahren. Ökonometrie und Unternehmensforschung (Springer-Verlag, Berlin, Heidelberg).Google Scholar
• Boyd S, Parikh N, Chu E, Peleato B, Eckstein J (2010) Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations Trends Machine Learning 3:1–122.Crossref, Google Scholar
• Burachik RS, Svaiter BF (2001) A relative error tolerance for a family of generalized proximal point methods. Math. Oper. Res. 26(4):816–831.Link, Google Scholar
• Chan TF, Glowinski R (1978) Finite element approximation and iterative solution of a class of mildly non-linear elliptic equations. Technical report, Stanford University, Stanford, CA.Google Scholar
• Corman E, Yuan XM (2014) A generalized proximal point algorithm and its convergence rate. SIAM J. Optim. 24(4):1614–1638.Crossref, Google Scholar
• Douglas J, Rachford HH (1956) On the numerical solution of the heat conduction problem in 2 and 3 space variables. Trans. Amer. Math. Soc. 82:420–439.Crossref, Google Scholar
• Eckstein J, Yao W (2012) Augmented Lagrangian and alternating direction methods for convex optimization: A tutorial and some illustrative computational results. RUTCOR Research Report RRR 32-2012. http://rutcor.rutgers.edu/pub/rrr/reports2012/32_2012.pdf.Google Scholar
• Facchinei F, Pang JS (2003) Finite-Dimensional Variational Inequalities and Complementarity Problems, Springer Series in Operations Research, Vol. I (Springer-Verlag, New York).Google Scholar
• Gabay D (1983) Applications of the method of multipliers to variational inequalities. Fortin M, Glowinski R, eds. Augmented Lagrange Methods: Applications to the Solution of Boundary-Valued Problems (North Holland, Amsterdam), 299–331.Crossref, Google Scholar
• Gabay D, Mercier B (1976) A dual algorithm for the solution of nonlinear variational problems via finite-element approximations. Comput. Math. Appl. 2:17–40.Crossref, Google Scholar
• Glowinski R (2014) On alternating direction methods of multipliers: A historical perspective. Fitzgibbon W, Kuznetsov YA, Neittaanmäki P, Pironneau O, eds. Modeling, Simulation and Optimization for Science and Technology (Springer, Dordrecht, Netherlands), 59–82.Crossref, Google Scholar
• Glowinski R, Kärkkäinen T, Majava K (2003) On the convergence of operator-splitting methods, Kuznetsov Y, Neittanmäki P, Pironneau O, eds. Numerical Methods for Scientific Computing, Variational Problems and Applications (CIMNE, Barcelona), 67–79.Google Scholar
• Glowinski R, Marrocco A (1975) 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. R.A.I.R.O. 9(R2):41–76.Google Scholar
• Glowinski R, Le Tallec P (1989) Augmented Lagrangian and Operator-Splitting Methods in Nonlinear Mechanics, SIAM Studies in Applied Mathematics (SIAM, Philadelphia).Crossref, Google Scholar
• He BS, Liu H, Wang ZR, Yuan XM (2014) A strictly contractive Peaceman-Rachford splitting method for convex programming. SIAM J. Optim. 24(3):1101–1140.Crossref, Google Scholar
• He BS, Yuan XM (2012) On the O(1/n) convergence rate of Douglas-Rachford alternating direction method. SIAM J. Numer. Anal. 50(2):700–709.Crossref, Google Scholar
• Lions PL, Mercier B (1979) Splitting algorithms for the sum of two nonlinear operators. SIAM J. Numer. Anal. 16(6):964–979.Crossref, Google Scholar
• Nesterov YE (2013) Gradient methods for minimizing composite objective function. Math. Prog., Ser. B 140(1):125–161.Crossref, Google Scholar
• Peaceman DH, Rachford HH (1955) The numerical solution of parabolic elliptic differential equations. SIAM J. Appl. Math. 3(1):28–41.Crossref, Google Scholar
• Shefi R, Teboulle M (2014) Rate of convergence analysis of decomposition methods based on the proximal method of multipliers for convex minimization. SIAM J. Optim. 24(1):269–297.Crossref, Google Scholar
• Tao M, Yuan XM (2012) On the O(1/t) convergence rate of alternating direction method with logarithmic-quadratic proximal regularization. SIAM J. Optim. 22(4):1431–1448.Crossref, Google Scholar
• Yuan XM, Li M (2011) An LQP-based decomposition method for solving a class of variational inequalities. SIAM J. Optim. 21(4):1309–1318.Crossref, Google Scholar