On the convergence rate of inexact majorized sGS ADMM with indefinite proximal terms for convex composite programming (Q5012883)

scientific article; zbMATH DE number 7434126

Language	Label	Description	Also known as
default for all languages	No label defined
English	On the convergence rate of inexact majorized sGS ADMM with indefinite proximal terms for convex composite programming	scientific article; zbMATH DE number 7434126

Statements

instance of

scholarly article

0 references

title

On the Convergence Rate of Inexact Majorized sGS ADMM with Indefinite Proximal Terms for Convex Composite Programming (English)

0 references

0 references

0 references

Asia-Pacific Journal of Operational Research

0 references

publication date

26 November 2021

0 references

zbMATH Keywords

convex composite optimization

0 references

indefinite proximal terms

0 references

inexact

0 references

majorized ADMM

0 references

relative error control

0 references

symmetric Gauss-Seidel

0 references

describes a project that uses

QSDPNAL

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Relative-error inertial-relaxed inexact versions of Douglas-Rachford and ADMM splitting algorithms

0 references

Local linear convergence of the alternating direction method of multipliers on quadratic or linear programs

0 references

Distributed optimization and statistical learning via the alternating direction method of multipliers

0 references

On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function

0 references

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

0 references

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

0 references

An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming

0 references

A unified algorithmic framework of symmetric Gauss-Seidel decomposition based proximal ADMMs for convex composite programming

0 references

Optimization and nonsmooth analysis

0 references

On the convergence properties of a majorized alternating direction method of multipliers for linearly constrained convex optimization problems with coupled objective functions

0 references

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

0 references

On the global and linear convergence of the generalized alternating direction method of multipliers

0 references

Implicit Functions and Solution Mappings

0 references

On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators

0 references

A practical relative error criterion for augmented Lagrangians

0 references

Understanding the convergence of the alternating direction method of multipliers: theoretical and computational perspectives

0 references

Approximate ADMM algorithms derived from Lagrangian splitting

0 references

Relative-error approximate versions of Douglas-Rachford splitting and special cases of the ADMM

0 references

Hankel matrix rank minimization with applications to system identification and realization

0 references

Q3038523

0 references

A dual algorithm for the solution of nonlinear variational problems via finite element approximation

0 references

Q4144736

0 references

Inexact alternating direction methods of multipliers for separable convex optimization

0 references

Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming

0 references

A note on the alternating direction method of multipliers

0 references

Local Linear Convergence of the Alternating Direction Method of Multipliers for Quadratic Programs

0 references

A new inexact alternating directions method for monotone variational inequalities

0 references

Optimal proximal augmented Lagrangian method and its application to full Jacobian splitting for multi-block separable convex minimization problems

0 references

Optimally linearizing the alternating direction method of multipliers for convex programming

0 references

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

0 references

On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method

0 references

Q3141900

0 references

A block successive upper-bound minimization method of multipliers for linearly constrained convex optimization

0 references

On the linear convergence of the alternating direction method of multipliers

0 references

Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries

0 references

Inexact alternating direction methods of multipliers with logarithmic-quadratic proximal regularization

0 references

A convergent 3-block semi-proximal ADMM for convex minimization problems with one strongly convex block

0 references

A majorized ADMM with indefinite proximal terms for linearly constrained convex composite optimization

0 references

A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions

0 references

QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming

0 references

A block symmetric Gauss-Seidel decomposition theorem for convex composite quadratic programming and its applications

0 references

On the Global Linear Convergence of the ADMM with MultiBlock Variables

0 references

Iteration complexity analysis of multi-block ADMM for a family of convex minimization without strong convexity

0 references

Global convergence of unmodified 3-block ADMM for a class of convex minimization problems

0 references

Partial error bound conditions and the linear convergence rate of the alternating direction method of multipliers

0 references

Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem

0 references

Proximité et dualité dans un espace hilbertien

0 references

A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator

0 references

An inexact hybrid generalized proximal point algorithm and some new results on the theory of Bregman functions

0 references

Convergence analysis of the direct extension of ADMM for multiple-block separable convex minimization

0 references

A primal majorized semismooth Newton-CG augmented Lagrangian method for large-scale linearly constrained convex programming

0 references

Solving Multiple-Block Separable Convex Minimization Problems Using Two-Block Alternating Direction Method of Multipliers

0 references

On inexact ADMMs with relative error criteria

0 references

Linear convergence of the alternating direction method of multipliers for a class of convex optimization problems

0 references

A majorization-minimization approach to variable selection using spike and slab priors

0 references

A linearly convergent majorized ADMM with indefinite proximal terms for convex composite programming and its applications

0 references

full work available at URL

https://doi.org/10.1142/s0217595920500359

0 references

Identifiers

zbMATH Open document ID

1481.90254

0 references

DOI

10.1142/S0217595920500359

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5012883