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

DOI10.1080/02331934.2019.1636246MaRDI QIDQ5239082zbMATHOpenAlexFDO

Authors Xueqing Zhang, J. W. 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)

Recommendations

• Generalized Peaceman-Rachford splitting method with substitution for convex programming
• Peaceman-Rachford splitting for a class of nonconvex optimization problems
• Convergence of the Peaceman-Rachford Splitting Method for a Class of Nonconvex Programs
• A strictly contractive Peaceman-Rachford splitting method for convex programming
• Inertial generalized proximal Peaceman-Rachford splitting method for separable convex programming
• Complexity of the relaxed Peaceman-Rachford splitting method for the sum of two maximal strongly monotone operators
• Relaxed inertial proximal Peaceman-Rachford splitting method for separable convex programming
• Application of the strictly contractive Peaceman-Rachford splitting method to multi-block separable convex programming
• Iteration methods to compute the separable convex minimization problems
• A splitting method for separable convex programming

Cites work

• scientific article; zbMATH DE number 3833218 (Why is no real title available?)
• scientific article; zbMATH DE number 3914081 (Why is no real title available?)
• scientific article; zbMATH DE number 45081 (Why is no real title available?)
• scientific article; zbMATH DE number 3574917 (Why is no real title available?)
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• A proximal Peaceman-Rachford splitting method for compressive sensing
• A strictly contractive Peaceman-Rachford splitting method for convex programming
• A strictly contractive Peaceman-Rachford splitting method with logarithmic-quadratic proximal regularization for convex programming
• Convex Analysis
• Distributed optimization and statistical learning via the alternating direction method of multipliers
• Generalized Peaceman-Rachford splitting method for multiple-block separable convex programming with applications to robust PCA
• Generalized Peaceman-Rachford splitting method for separable convex programming with applications to image processing
• Local Linear Convergence of the Alternating Direction Method of Multipliers for Quadratic Programs
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
• Some convergence properties of a method of multipliers for linearly constrained monotone variational inequalities
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• The Numerical Solution of Parabolic and Elliptic Differential Equations

Cited in

(5)

• Generalized Peaceman-Rachford splitting method with substitution for convex programming
• Relaxed inertial proximal Peaceman-Rachford splitting method for separable convex programming
• Complexity of the relaxed Peaceman-Rachford splitting method for the sum of two maximal strongly monotone operators
• A generalized Peaceman-Rachford splitting method with indefinite proximal term
• Convergence of the Peaceman-Rachford Splitting Method for a Class of Nonconvex Programs

This page was built for publication: Iteration complexity on the generalized Peaceman–Rachford splitting method for separable convex programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5239082)