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

DOI10.1080/02331934.2019.1636246zbMATH Open1431.90114OpenAlexW2953868345MaRDI QIDQ5239082FDOQ5239082

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

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

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

• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• Title not available (Why is that?)
• 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
• Convex Analysis
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Numerical Solution of Parabolic and Elliptic Differential Equations
• Local Linear Convergence of the Alternating Direction Method of Multipliers for Quadratic Programs
• Some convergence properties of a method of multipliers for linearly constrained monotone variational inequalities
• A proximal Peaceman-Rachford splitting method for compressive sensing
• A Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming
• Generalized peaceman-Rachford splitting method for separable convex programming with applications to image processing
• A Strictly Contractive Peaceman-Rachford Splitting Method with Logarithmic-Quadratic Proximal Regularization for Convex Programming
• Generalized Peaceman-Rachford splitting method for multiple-block separable convex programming with applications to robust PCA

Cited In (4)

• Convergence of the Peaceman-Rachford Splitting Method for a Class of Nonconvex Programs
• Generalized Peaceman-Rachford splitting method with substitution for 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

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)