Generalized peaceman-Rachford splitting method for separable convex programming with applications to image processing

DOI10.1007/s12190-015-0922-6zbMath1338.90307OpenAlexW1199941660MaRDI QIDQ295499

Jing Liu, Min Sun

Publication date: 13 June 2016

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12190-015-0922-6

zbMATH Keywords

convex programmingPeaceman-Rachford splitting methodimage deblurring problems

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30)

Related Items (7)

Inertial generalized proximal Peaceman-Rachford splitting method for separable convex programming ⋮ Linearized generalized ADMM-based algorithm for multi-block linearly constrained separable convex programming in real-world applications ⋮ Generalized Peaceman-Rachford splitting method with substitution for convex programming ⋮ Proximal ADMM with larger step size for two-block separable convex programming and its application to the correlation matrices calibrating problems ⋮ Improved proximal ADMM with partially parallel splitting for multi-block separable convex programming ⋮ Relaxed inertial proximal Peaceman-Rachford splitting method for separable convex programming ⋮ Iteration complexity on the generalized Peaceman–Rachford splitting method for separable convex programming

Cites Work

• 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
• A proximal Peaceman-Rachford splitting method for compressive sensing
• A Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming
• The Numerical Solution of Parabolic and Elliptic Differential Equations
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• Local Linear Convergence of the Alternating Direction Method of Multipliers for Quadratic Programs
• Linearized Alternating Direction Method of Multipliers for Constrained Linear Least-Squares Problem
• Unnamed Item
• Unnamed Item

This page was built for publication: Generalized peaceman-Rachford splitting method for separable convex programming with applications to image processing