A proximal splitting method for separable convex programming and its application to compressive sensing

DOI10.22436/JNSA.009.02.05MaRDI QIDQ3455368zbMATH OpenOpenAlexFDO

Authors Hongchun Sun, M. Sun, Houchun Zhou

Publication date 4 December 2015

Published in The Journal of Nonlinear Sciences and Applications (Search for Journal in Brave)

Full work available at URL http://www.tjnsa.com/includes/files/articles/Vol9_Iss2_392--403_A_proximal_splitting_method_for_sep.pdf

zbMATH Keywords

compressive sensingproximal Peaceman-Rachford splitting methodseparable convex programming

Mathematics Subject Classification ID

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

Recommendations

• A proximal Peaceman-Rachford splitting method for compressive sensing
• A novel projection method for split feasibility problems with applications to compressive sensing
• A primal Douglas-Rachford splitting method for the constrained minimization problem in compressive sensing
• A proximal multiplier method for separable convex minimization
• An accelerated proximal augmented Lagrangian method and its application in compressive sensing
• A proximal partially parallel splitting method for separable convex programs
• Proximal splitting methods in signal processing
• Two proximal splitting methods for multi-block separable programming with applications to stable principal component pursuit
• A fast proximal point algorithm for \(\ell_{1}\)-minimization problem in compressed sensing

Cited in

(10)

• The symmetric ADMM with indefinite proximal regularization and its application
• A primal Douglas-Rachford splitting method for the constrained minimization problem in compressive sensing
• An accelerated proximal augmented Lagrangian method and its application in compressive sensing
• A proximal Peaceman-Rachford splitting method for compressive sensing
• Inertial generalized proximal Peaceman-Rachford splitting method for separable convex programming
• A proximal strictly contractive Peaceman-Rachford splitting method for convex programming with applications to imaging
• scientific article; zbMATH DE number 6850057 (Why is no real title available?)
• A symmetric version of the generalized alternating direction method of multipliers for two-block separable convex programming
• Compressed data separation via unconstrained l1-split analysis
• An improved Dai-Liao-style hybrid conjugate gradient-based method for solving unconstrained nonconvex optimization and extension to constrained nonlinear monotone equations

This page was built for publication: A proximal splitting method for separable convex programming and its application to compressive sensing

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