A proximal Peaceman-Rachford splitting method for compressive sensing

DOI10.1007/s12190-015-0874-xzbMath1330.90079OpenAlexW2002956129MaRDI QIDQ2634343

Jing Liu, Min Sun

Publication date: 9 February 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-0874-x

zbMATH Keywords

global convergencecompressive sensingproximal Peaceman-Rachford splitting method

Mathematics Subject Classification ID

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

Related Items (11)

Modified hybrid decomposition of the augmented Lagrangian method with larger step size for three-block separable convex programming ⋮ Generalized Peaceman-Rachford splitting method for multiple-block separable convex programming with applications to robust PCA ⋮ The symmetric ADMM with indefinite proximal regularization and its application ⋮ Generalized peaceman-Rachford splitting method for separable convex programming with applications to image processing ⋮ Linearized generalized ADMM-based algorithm for multi-block linearly constrained separable convex programming in real-world applications ⋮ A linearized Peaceman-Rachford splitting method for structured convex optimization with application to stable principal component pursuit ⋮ A symmetric version of the generalized alternating direction method of multipliers for two-block separable convex programming ⋮ Improved proximal ADMM with partially parallel splitting for multi-block separable convex programming ⋮ Relaxed inertial proximal Peaceman-Rachford splitting method for separable convex programming ⋮ Strictly contractive Peaceman-Rachford splitting method to recover the corrupted low rank matrix ⋮ Iteration complexity on the generalized Peaceman–Rachford splitting method for separable convex programming

Cites Work

• Unnamed Item
• An inexact alternating directions algorithm for constrained total variation regularized compressive sensing problems
• An ADM-based splitting method for separable convex programming
• Linearized alternating directions method for \(\ell_1\)-norm inequality constrained \(\ell_1\)-norm minimization
• On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
• A Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming
• Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
• An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing
• The Numerical Solution of Parabolic and Elliptic Differential Equations
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization

This page was built for publication: A proximal Peaceman-Rachford splitting method for compressive sensing