A Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming
From MaRDI portal
Publication:2934468
DOI10.1137/13090849XzbMath1327.90210OpenAlexW2054489122WikidataQ41908913 ScholiaQ41908913MaRDI QIDQ2934468
Han Liu, Zhaoran Wang, Xiao-Ming Yuan, Bing-sheng He
Publication date: 12 December 2014
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/13090849x
contractionconvex programmingconvergence rateDouglas-Rachford splitting methodPeaceman-Rachford splitting method
Convex programming (90C25) Nonlinear programming (90C30) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Related Items
A proximal Peaceman–Rachford splitting method for solving the multi-block separable convex minimization problems ⋮ 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 ⋮ Alternating direction method of multipliers with variable metric indefinite proximal terms for convex optimization ⋮ An inexact generalized PRSM with LQP regularization for structured variational inequalities and its applications to traffic equilibrium problems ⋮ Generalized peaceman-Rachford splitting method for separable convex programming with applications to image processing ⋮ Solving total-variation image super-resolution problems via proximal symmetric alternating direction methods ⋮ A proximal Peaceman-Rachford splitting method for compressive sensing ⋮ An algorithm twisted from generalized ADMM for multi-block separable convex minimization models ⋮ On the global and linear convergence of direct extension of ADMM for 3-block separable convex minimization models ⋮ Convergence Study on the Symmetric Version of ADMM with Larger Step Sizes ⋮ Fiber Orientation Distribution Estimation Using a Peaceman--Rachford Splitting Method ⋮ A Proximal Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming with Applications to Imaging ⋮ Modified proximal symmetric ADMMs for multi-block separable convex optimization with linear constraints ⋮ A Symmetric Inertial Alternating Direction Method of Multipliers for Elliptic Equation Constrained Optimization Problem ⋮ Convergence analysis of primal-dual based methods for total variation minimization with finite element approximation ⋮ SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning ⋮ Convergence analysis of positive-indefinite proximal ADMM with a Glowinski's relaxation factor ⋮ Inertial generalized proximal Peaceman-Rachford splitting method for separable convex programming ⋮ Multi-step inertial strictly contractive PRSM algorithms for convex programming problems with applications ⋮ A note on the SDP relaxation of the minimum cut problem ⋮ Block-wise ADMM with a relaxation factor for multiple-block convex programming ⋮ A Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAP ⋮ A symmetric splitting sequential quadratic optimization algorithm for two-block nonlinearly constrained nonconvex optimization ⋮ Linearized generalized ADMM-based algorithm for multi-block linearly constrained separable convex programming in real-world applications ⋮ Convergence of Bregman Peaceman-Rachford splitting method for nonconvex nonseparable optimization ⋮ A cascading l0 regularization reconstruction method in nonsubsampled contourlet domain for limited-angle CT ⋮ A Symmetric Alternating Direction Method of Multipliers for Separable Nonconvex Minimization Problems ⋮ Convergence study on the proximal alternating direction method with larger step size ⋮ A modified strictly contractive peaceman-Rachford splitting method for multi-block separable convex programming ⋮ A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application ⋮ A linearized Peaceman-Rachford splitting method for structured convex optimization with application to stable principal component pursuit ⋮ A partially proximal S-ADMM for separable convex optimization with linear constraints ⋮ The dual step size of the alternating direction method can be larger than 1.618 when one function is strongly convex ⋮ The convergence rate analysis of the symmetric ADMM for the nonconvex separable optimization problems ⋮ Two proximal splitting methods for multi-block separable programming with applications to stable principal component pursuit ⋮ Generalized symmetric ADMM for separable convex optimization ⋮ A symmetric version of the generalized alternating direction method of multipliers for two-block separable convex programming ⋮ Alternating Direction Method of Multipliers for Linear Inverse Problems ⋮ A faster generalized ADMM-based algorithm using a sequential updating scheme with relaxed step sizes for multiple-block linearly constrained separable convex programming ⋮ General splitting methods with linearization for the split feasibility problem ⋮ Convergence analysis of the generalized splitting methods for a class of nonconvex optimization problems ⋮ Convergence study on strictly contractive peaceman-Rachford splitting method for nonseparable convex minimization models with quadratic coupling terms ⋮ A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem ⋮ Relaxed inertial proximal Peaceman-Rachford splitting method for separable convex programming ⋮ Pointwise and ergodic convergence rates of a variable metric proximal alternating direction method of multipliers ⋮ Block-wise Alternating Direction Method of Multipliers for Multiple-block Convex Programming and Beyond ⋮ The augmented Lagrangian method with full Jacobian decomposition and logarithmic-quadratic proximal regularization for multiple-block separable convex programming ⋮ Optimally linearizing the alternating direction method of multipliers for convex programming ⋮ Inertial proximal strictly contractive peaceman-Rachford splitting method with an indefinite term for convex optimization ⋮ A sequential updating scheme of the Lagrange multiplier for separable convex programming ⋮ An LQP-based symmetric alternating direction method of multipliers with larger step sizes ⋮ Strictly contractive Peaceman-Rachford splitting method to recover the corrupted low rank matrix ⋮ An ADMM-based SQP method for separably smooth nonconvex optimization ⋮ An efficient Peaceman–Rachford splitting method for constrained TGV-shearlet-based MRI reconstruction ⋮ On the optimal proximal parameter of an ADMM-like splitting method for separable convex programming ⋮ Iteration complexity on the generalized Peaceman–Rachford splitting method for separable convex programming ⋮ Monotone splitting sequential quadratic optimization algorithm with applications in electric power systems ⋮ An indefinite proximal Peaceman-Rachford splitting method with substitution procedure for convex programming ⋮ Generalized ADMM with optimal indefinite proximal term for linearly constrained convex optimization ⋮ An alternate minimization method beyond positive definite proximal regularization: convergence and complexity ⋮ An inertial proximal partially symmetric ADMM-based algorithm for linearly constrained multi-block nonconvex optimization problems with applications ⋮ A superlinearly convergent splitting feasible sequential quadratic optimization method for two-block large-scale smooth optimization ⋮ An inexact symmetric ADMM algorithm with indefinite proximal term for sparse signal recovery and image restoration problems ⋮ Convergence analysis of an inexact three-operator splitting algorithm ⋮ On the nonexpansive operators based on arbitrary metric: a degenerate analysis ⋮ The lower bound of nonlocal gradient for non-convex and non-smooth image patches based regularization ⋮ Convergence study on the logarithmic-quadratic proximal regularization of strictly contractive Peaceman–Rachford splitting method with larger step-size
Uses Software
