Convergence study on strictly contractive peaceman-Rachford splitting method for nonseparable convex minimization models with quadratic coupling terms (Q2026767)

From MaRDI portal

Jump to:navigation, search

scientific article

In more languages

Language	Label	Description	Also known as
English	Convergence study on strictly contractive peaceman-Rachford splitting method for nonseparable convex minimization models with quadratic coupling terms	scientific article

Statements

scholarly article

Convergence study on strictly contractive peaceman-Rachford splitting method for nonseparable convex minimization models with quadratic coupling terms (English)

Computational Optimization and Applications

publication date

20 May 2021

zbMATH Keywords

nonseparable convex minimization model

quadratic coupling terms

2-block SC-PRSM

iterative convergence

convergence rate

describes a project that uses

MaRDI profile type

MaRDI publication profile

full work available at URL

https://doi.org/10.1007/s10589-020-00229-4

Generalized symmetric ADMM for separable convex optimization

Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers

The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent

Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights

A General Inertial Proximal Point Algorithm for Mixed Variational Inequality Problem

Atomic Decomposition by Basis Pursuit

Fast Algorithms for Projection on an Ellipsoid

Parallel multi-block ADMM with \(o(1/k)\) convergence

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

On Alternating Direction Methods of Multipliers: A Historical Perspective

Inexact alternating-direction-based contraction methods for separable linearly constrained convex optimization

An ADM-based splitting method for separable convex programming

A Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming

Convergence Study on the Symmetric Version of ADMM with Larger Step Sizes

Alternating Direction Method with Gaussian Back Substitution for Separable Convex Programming

Convergence Rate Analysis for the Alternating Direction Method of Multipliers with a Substitution Procedure for Separable Convex Programming

On the proximal Jacobian decomposition of ALM for multiple-block separable convex minimization problems and its relationship to ADMM

On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method

Multiplier and gradient methods

On the linear convergence of the alternating direction method of multipliers

Comparison of several fast algorithms for projection onto an ellipsoid

A Convergent $3$-Block Semi-Proximal ADMM for Convex Minimization Problems with One Strongly Convex Block

Splitting Algorithms for the Sum of Two Nonlinear Operators

The Numerical Solution of Parabolic and Elliptic Differential Equations

A Symmetric Alternating Direction Method of Multipliers for Separable Nonconvex Minimization Problems

Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization

Identifiers

zbMATH Open document ID

Mathematics Subject Classification ID

zbMATH DE Number

10.1007/S10589-020-00229-4

Sitelinks

Mathematics(1 entry)

mardi Publication:2026767

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2026767&oldid=38839204"