Relaxed inertial proximal Peaceman-Rachford splitting method for separable convex programming
type: Item
instance of: scholarly article
title: Relaxed inertial proximal Peaceman-Rachford splitting method for separable convex programming
zbMATH Open document ID: 1401.90154
author: Yongguang He
author: Huiyun Li
author: Xinwei Liu
published in: Frontiers of Mathematics in China
publication date: 2018-10-04T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 6947215
zbMATH Keywords: convex programming
zbMATH Keywords: inertial proximal Peaceman-Rachford splitting method
zbMATH Keywords: relaxation factor
zbMATH Keywords: global convergence
describes a project that uses: RecPF
MaRDI profile type: Publication
full work available at URL: s11464-018-0706-z
OpenAlex ID: W2805240903
cites work: An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
cites work: Q3690580
cites work: Linearized alternating directions method for \(\ell_1\)-norm inequality constrained \(\ell_1\)-norm minimization
cites work: Inertial Proximal ADMM for Linearly Constrained Separable Convex Optimization
cites work: On the global and linear convergence of the generalized alternating direction method of multipliers
cites work: An inertial proximal Peaceman-Rachford splitting method
cites work: A dual algorithm for the solution of nonlinear variational problems via finite element approximation
cites work: On Alternating Direction Methods of Multipliers: A Historical Perspective
cites work: Convergence of ADMM for multi-block nonconvex separable optimization models
cites work: Local Linear Convergence of the Alternating Direction Method of Multipliers for Quadratic Programs
cites work: Application of the Strictly Contractive Peaceman-Rachford Splitting Method to Multi-Block Separable Convex Programming
cites work: A Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming
cites work: Convergence Study on the Symmetric Version of ADMM with Larger Step Sizes
cites work: A Proximal Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming with Applications to Imaging
cites work: Splitting Algorithms for the Sum of Two Nonlinear Operators
cites work: A symmetric version of the generalized alternating direction method of multipliers for two-block separable convex programming
cites work: Nonlinear total variation based noise removal algorithms
cites work: A proximal Peaceman-Rachford splitting method for compressive sensing
cites work: Generalized peaceman-Rachford splitting method for separable convex programming with applications to image processing
cites work: Generalized Peaceman-Rachford splitting method for multiple-block separable convex programming with applications to robust PCA
cites work: A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
Wikidata QID: Q129743622
DOI: 10.1007/S11464-018-0706-Z
Recommended article: Inertial generalized proximal Peaceman-Rachford splitting method for separable convex programming
Recommended article: An inertial proximal Peaceman-Rachford splitting method
Recommended article: Inertial proximal strictly contractive peaceman-Rachford splitting method with an indefinite term for convex optimization
Recommended article: Peaceman-Rachford splitting for a class of nonconvex optimization problems
Recommended article: A proximal Peaceman–Rachford splitting method for solving the multi-block separable convex minimization problems
Recommended article: An indefinite proximal Peaceman-Rachford splitting method with substitution procedure for convex programming
Recommended article: Q5196880
Recommended article: A Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming
Recommended article: Relaxed-inertial proximal point type algorithms for quasiconvex minimization
Recommended article: Iteration complexity on the generalized Peaceman–Rachford splitting method for separable convex programming
description: scientific article; zbMATH DE number 6947215