An inertial proximal Peaceman-Rachford splitting method

DOI10.1360/N012016-00134MaRDI QIDQ5063818zbMATH OpenOpenAlexFDO

Authors Mingyuan Dou, Huiyun Li, Xinwei Liu

Publication date 21 March 2022

Published in SCIENTIA SINICA Mathematica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1360/n012016-00134

zbMATH Keywords

convex programminginertial proximal point algorithmPeaceman-Rachford splitting methodsemi-proximal splitting method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Convex programming (90C25) Interior-point methods (90C51)

Recommendations

• Inertial generalized proximal Peaceman-Rachford splitting method for separable convex programming
• Relaxed inertial proximal Peaceman-Rachford splitting method for separable convex programming
• Inertial proximal strictly contractive peaceman-Rachford splitting method with an indefinite term for convex optimization
• A strictly contractive Peaceman-Rachford splitting method for convex programming
• A generalized Peaceman-Rachford splitting method with indefinite proximal term

Cited in

(20)

• A modified strictly contractive peaceman-Rachford splitting method for multi-block separable convex programming
• Relaxed inertial proximal Peaceman-Rachford splitting method for separable convex programming
• Convergence study on strictly contractive peaceman-Rachford splitting method for nonseparable convex minimization models with quadratic coupling terms
• An inertial proximal partially symmetric ADMM-based algorithm for linearly constrained multi-block nonconvex optimization problems with applications
• Generalized Peaceman-Rachford splitting method with substitution for convex programming
• Inertial proximal strictly contractive peaceman-Rachford splitting method with an indefinite term for convex optimization
• An indefinite proximal Peaceman-Rachford splitting method with substitution procedure for convex programming
• An inertial proximal algorithm with dry friction: finite convergence results
• Inertial generalized proximal Peaceman-Rachford splitting method for separable convex programming
• A modified inertial three-term conjugate gradient projection method for constrained nonlinear equations with applications in compressed sensing
• A foreground extraction algorithm based on the Peaceman-Rachford splitting method
• Inertial, corrected, primal-dual proximal splitting
• A generalized Peaceman-Rachford splitting method with indefinite proximal term
• Multi-step inertial strictly contractive PRSM algorithms for convex programming problems with applications
• A family of three-term conjugate gradient projection methods with a restart procedure and their relaxed-inertial extensions for the constrained nonlinear pseudo-monotone equations with applications
• Convergence of Bregman Peaceman-Rachford splitting method for nonconvex nonseparable optimization
• Accelerated stochastic Peaceman-Rachford method for empirical risk minimization
• A partially inertial customized Douglas-Rachford splitting method for a class of structured optimization problems
• An IDFPM-based algorithm without Lipschitz continuity to constrained nonlinear equations for sparse signal and blurred image restoration problems
• A half-proximal symmetric splitting method for non-convex separable optimization

This page was built for publication: An inertial proximal Peaceman-Rachford splitting method

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