A modified strictly contractive peaceman-Rachford splitting method for multi-block separable convex programming
type: Item
instance of: scholarly article
title: A modified strictly contractive peaceman-Rachford splitting method for multi-block separable convex programming
zbMATH Open document ID: 1412.90109
author: Su-Hong Jiang
author: Min Li
published in: Journal of Industrial and Management Optimization
publication date: 2019-02-05T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90B50
zbMATH DE Number: 7012482
zbMATH Keywords: convex programming
zbMATH Keywords: multi-block
zbMATH Keywords: peaceman-Rachford splitting method
zbMATH Keywords: convergence rate
zbMATH Keywords: resource allocation
MaRDI profile type: Publication
full work available at URL: jimo.2017052
OpenAlex ID: W2674781533
cites work: Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
cites work: On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function
cites work: The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
cites work: On the convergence analysis of the alternating direction method of multipliers with three blocks
cites work: A Generalized Proximal Point Algorithm and Its Convergence Rate
cites work: A sequential updating scheme of the Lagrange multiplier for separable convex programming
cites work: Parallel multi-block ADMM with \(o(1/k)\) convergence
cites work: On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
cites work: Solving a non-smooth eigenvalue problem using operator-splitting methods
cites work: An ADM-based splitting method for separable convex programming
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: A splitting method for separable convex programming
cites work: Alternating direction method with Gaussian back substitution for separable convex programming
cites work: On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
cites work: On non-ergodic convergence rate of Douglas-Rachford alternating direction method of multipliers
cites work: A Convergent $3$-Block Semi-Proximal ADMM for Convex Minimization Problems with One Strongly Convex Block
cites work: A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions
cites work: On the Global Linear Convergence of the ADMM with MultiBlock Variables
cites work: On the sublinear convergence rate of multi-block ADMM
cites work: Splitting Algorithms for the Sum of Two Nonlinear Operators
cites work: Alternating proximal gradient method for convex minimization
cites work: Gradient methods for minimizing composite functions
cites work: A survey on the continuous nonlinear resource allocation problem
cites work: The Numerical Solution of Parabolic and Elliptic Differential Equations
cites work: Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
cites work: Market Mechanisms and Mathematical Programming
DOI: 10.3934/JIMO.2017052
description: scientific article; zbMATH DE number 7012482