Iteration complexity on the generalized Peaceman–Rachford splitting method for separable convex programming

DOI10.1080/02331934.2019.1636246zbMath1431.90114OpenAlexW2953868345MaRDI QIDQ5239082

Xueqing Zhang, Jian-Wen Peng, Jen-Chih Yao

Publication date: 21 October 2019

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2019.1636246

zbMATH Keywords

convex minimization problemiteration complexitymatrix optimizationLasso problemgeneralized Peaceman-Rachford splitting method

Mathematics Subject Classification ID

Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• Generalized peaceman-Rachford splitting method for separable convex programming with applications to image processing
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• Some convergence properties of a method of multipliers for linearly constrained monotone variational inequalities
• Generalized Peaceman-Rachford splitting method for multiple-block separable convex programming with applications to robust PCA
• A proximal Peaceman-Rachford splitting method for compressive sensing
• On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
• A Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming
• The Numerical Solution of Parabolic and Elliptic Differential Equations
• A Strictly Contractive Peaceman-Rachford Splitting Method with Logarithmic-Quadratic Proximal Regularization for Convex Programming
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• Local Linear Convergence of the Alternating Direction Method of Multipliers for Quadratic Programs
• Convex Analysis