Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming (Q5219557): Difference between revisions

Latest revision as of 16:22, 30 December 2024

scientific article; zbMATH DE number 7179756

Language	Label	Description	Also known as
English	Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming	scientific article; zbMATH DE number 7179756

Statements

instance of

scholarly article

0 references

title

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

0 references

0 references

0 references

0 references

Mathematics of Operations Research

0 references

publication date

12 March 2020

0 references

full work available at URL

https://arxiv.org/abs/1508.02134

0 references

zbMATH Keywords

ADMM

0 references

calmness

0 references

Q-linear convergence

0 references

multiblock

0 references

composite conic programming

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Local Linear Convergence of the Alternating Direction Method of Multipliers on Quadratic or Linear Programs

0 references

Q4503250

0 references

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

0 references

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

0 references

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

0 references

A note on the convergence of ADMM for linearly constrained convex optimization problems

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

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

0 references

Characterization of the Robust Isolated Calmness for a Class of Conic Programming Problems

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

Q3466913

0 references

Hankel Matrix Rank Minimization with Applications to System Identification and Realization

0 references

Q3038523

0 references

Local Duality of Nonlinear Programs

0 references

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

0 references

Lectures on numerical methods for non-linear variational problems

0 references

On Alternating Direction Methods of Multipliers: A Historical Perspective

0 references

Q4144736

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

On the linear convergence of the alternating direction method of multipliers

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

Splitting Algorithms for the Sum of Two Nonlinear Operators

0 references

Asymptotic Convergence Analysis of the Proximal Point Algorithm

0 references

Local Duality of Nonlinear Semidefinite Programming

0 references

Some continuity properties of polyhedral multifunctions

0 references

Q4235027

0 references

Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming

0 references

Monotone Operators and the Proximal Point Algorithm

0 references

Variational Analysis

0 references

Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization

0 references

A Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type Constraints

0 references

A class of linearized proximal alternating direction methods

0 references

Linear Convergence of the Alternating Direction Method of Multipliers for a Class of Convex Optimization Problems

0 references

Identifiers

zbMATH Open document ID

1440.90047

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

10.1287/MOOR.2017.0875

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5219557

@@ Property / DOI @@
-.1287/moor.2017.0875
@@ Property / DOI: 10.1287/moor.2017.0875 / rank @@
-Normal rank
@@ Property / DOI @@
+.1287/MOOR.2017.0875
@@ Property / DOI: 10.1287/MOOR.2017.0875 / rank @@
+Normal rank