Convergence study on strictly contractive peaceman-Rachford splitting method for nonseparable convex minimization models with quadratic coupling terms
type: Item
instance of: scholarly article
title: Convergence study on strictly contractive peaceman-Rachford splitting method for nonseparable convex minimization models with quadratic coupling terms
zbMATH Open document ID: 1468.90086
author: Peixuan Li
author: Yuan Shen
author: Zehua Liu
author: Caihua Chen
author: Su-Hong Jiang
published in: Computational Optimization and Applications
publication date: 2021-05-20T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C06
zbMATH DE Number: 7350281
zbMATH Keywords: nonseparable convex minimization model
zbMATH Keywords: quadratic coupling terms
zbMATH Keywords: 2-block SC-PRSM
zbMATH Keywords: iterative convergence
zbMATH Keywords: convergence rate
describes a project that uses: PDCO
MaRDI profile type: Publication
full work available at URL: s10589-020-00229-4
OpenAlex ID: W3091571693
cites work: Generalized symmetric ADMM for separable convex optimization
cites work: Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
cites work: The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
cites work: Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights
cites work: A General Inertial Proximal Point Algorithm for Mixed Variational Inequality Problem
cites work: Atomic decomposition by basis pursuit
cites work: Fast Algorithms for Projection on an Ellipsoid
cites work: Parallel multi-block ADMM with \(o(1/k)\) convergence
cites work: On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
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: Q3995612
cites work: Q4144736
cites work: Inexact alternating-direction-based contraction methods for separable linearly constrained convex optimization
cites work: An ADM-based splitting method for 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: Alternating direction method with Gaussian back substitution for separable convex programming
cites work: Convergence Rate Analysis for the Alternating Direction Method of Multipliers with a Substitution Procedure for Separable Convex Programming
cites work: On the proximal Jacobian decomposition of ALM for multiple-block separable convex minimization problems and its relationship to ADMM
cites work: On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
cites work: Multiplier and gradient methods
cites work: On the linear convergence of the alternating direction method of multipliers
cites work: Comparison of several fast algorithms for projection onto an ellipsoid
cites work: A Convergent $3$-Block Semi-Proximal ADMM for Convex Minimization Problems with One Strongly Convex Block
cites work: Splitting Algorithms for the Sum of Two Nonlinear Operators
cites work: The Numerical Solution of Parabolic and Elliptic Differential Equations
cites work: Q5590418
cites work: A Symmetric Alternating Direction Method of Multipliers for Separable Nonconvex Minimization Problems
cites work: Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
cites work: Q4908856
DOI: 10.1007/S10589-020-00229-4
description: scientific article; zbMATH DE number 7350281