Relaxed inertial proximal Peaceman-Rachford splitting method for separable convex programming
From MaRDI portal
Publication:1787117
DOI10.1007/s11464-018-0706-zzbMath1401.90154OpenAlexW2805240903WikidataQ129743622 ScholiaQ129743622MaRDI QIDQ1787117
Yongguang He, Huiyun Li, Xin-Wei Liu
Publication date: 4 October 2018
Published in: Frontiers of Mathematics in China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11464-018-0706-z
global convergenceconvex programmingrelaxation factorinertial proximal Peaceman-Rachford splitting method
Related Items (3)
Inertial generalized proximal Peaceman-Rachford splitting method for separable convex programming ⋮ A Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAP ⋮ Generalized Peaceman-Rachford splitting method with substitution for convex programming
Uses Software
Cites Work
- Unnamed Item
- Nonlinear total variation based noise removal algorithms
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Generalized peaceman-Rachford splitting method for separable convex programming with applications to image processing
- A symmetric version of the generalized alternating direction method of multipliers for two-block separable convex programming
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Convergence of ADMM for multi-block nonconvex separable optimization models
- Generalized Peaceman-Rachford splitting method for multiple-block separable convex programming with applications to robust PCA
- On the global and linear convergence of the generalized alternating direction method of multipliers
- Linearized alternating directions method for \(\ell_1\)-norm inequality constrained \(\ell_1\)-norm minimization
- A proximal Peaceman-Rachford splitting method for compressive sensing
- A Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming
- Convergence Study on the Symmetric Version of ADMM with Larger Step Sizes
- A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
- A Proximal Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming with Applications to Imaging
- Inertial Proximal ADMM for Linearly Constrained Separable Convex Optimization
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- An inertial proximal Peaceman-Rachford splitting method
- On Alternating Direction Methods of Multipliers: A Historical Perspective
- Application of the Strictly Contractive Peaceman-Rachford Splitting Method to Multi-Block Separable Convex Programming
- Local Linear Convergence of the Alternating Direction Method of Multipliers for Quadratic Programs
- An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
This page was built for publication: Relaxed inertial proximal Peaceman-Rachford splitting method for separable convex programming
