Convergence study on strictly contractive peaceman-Rachford splitting method for nonseparable convex minimization models with quadratic coupling terms
From MaRDI portal
Publication:2026767
DOI10.1007/s10589-020-00229-4zbMath1468.90086OpenAlexW3091571693MaRDI QIDQ2026767
Peixuan Li, Zehua Liu, Caihua Chen, Yuan Shen, Su-Hong Jiang
Publication date: 20 May 2021
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-020-00229-4
convergence rateiterative convergence2-block SC-PRSMnonseparable convex minimization modelquadratic coupling terms
Related Items (3)
Majorized iPADMM for Nonseparable Convex Minimization Models with Quadratic Coupling Terms ⋮ Convergence analysis of an improved Bregman-type Peaceman-Rachford splitting algorithm for nonconvex nonseparable linearly constrained optimization problems ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Inexact alternating-direction-based contraction methods for separable linearly constrained convex optimization
- Comparison of several fast algorithms for projection onto an ellipsoid
- On the linear convergence of the alternating direction method of multipliers
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Parallel multi-block ADMM with \(o(1/k)\) convergence
- Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights
- Generalized symmetric ADMM for separable convex optimization
- An ADM-based splitting method for separable convex programming
- On the proximal Jacobian decomposition of ALM for multiple-block separable convex minimization problems and its relationship to ADMM
- Multiplier and gradient methods
- Atomic Decomposition by Basis Pursuit
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- Alternating Direction Method with Gaussian Back Substitution for Separable Convex Programming
- A Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming
- A Convergent $3$-Block Semi-Proximal ADMM for Convex Minimization Problems with One Strongly Convex Block
- Convergence Study on the Symmetric Version of ADMM with Larger Step Sizes
- The Numerical Solution of Parabolic and Elliptic Differential Equations
- A General Inertial Proximal Point Algorithm for Mixed Variational Inequality Problem
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- A Symmetric Alternating Direction Method of Multipliers for Separable Nonconvex Minimization Problems
- Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
- On Alternating Direction Methods of Multipliers: A Historical Perspective
- Convergence Rate Analysis for the Alternating Direction Method of Multipliers with a Substitution Procedure for Separable Convex Programming
- Fast Algorithms for Projection on an Ellipsoid
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
This page was built for publication: Convergence study on strictly contractive peaceman-Rachford splitting method for nonseparable convex minimization models with quadratic coupling terms
