Global Complexity Bound of a Proximal ADMM for Linearly Constrained Nonseparable Nonconvex Composite Programming (Q6136662)

scientific article; zbMATH DE number 7790175

Language	Label	Description	Also known as
English	Global Complexity Bound of a Proximal ADMM for Linearly Constrained Nonseparable Nonconvex Composite Programming	scientific article; zbMATH DE number 7790175

Statements

instance of

scholarly article

0 references

title

Global Complexity Bound of a Proximal ADMM for Linearly Constrained Nonseparable Nonconvex Composite Programming (English)

0 references

author

WeiWei Kong

0 references

Renato D. C. Monteiro

0 references

published in

SIAM Journal on Optimization

0 references

publication date

17 January 2024

0 references

full work available at URL

https://arxiv.org/abs/2110.12502

0 references

zbMATH Keywords

proximal ADMM

0 references

nonseparable nonconvex composite optimization

0 references

iteration complexity

0 references

under-relaxed update

0 references

augmented Lagrangian function

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Q2825953

0 references

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

0 references

An inertial proximal alternating direction method of multipliers for nonconvex optimization

0 references

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

0 references

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

0 references

Operator-Splitting Methods for Monotone Affine Variational Inequalities, with a Parallel Application to Optimal Control

0 references

Q4311908

0 references

A family of projective splitting methods for the sum of two maximal monotone operators

0 references

General Projective Splitting Methods for Sums of Maximal Monotone Operators

0 references

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

0 references

Q4144736

0 references

Convergence rate bounds for a proximal ADMM with over-relaxation stepsize parameter for solving nonconvex linearly constrained problems

0 references

An incremental aggregated proximal ADMM for linearly constrained nonconvex optimization with application to sparse logistic regression problems

0 references

Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis

0 references

Complexity of a Quadratic Penalty Accelerated Inexact Proximal Point Method for Solving Linearly Constrained Nonconvex Composite Programs

0 references

An efficient adaptive accelerated inexact proximal point method for solving linearly constrained nonconvex composite problems

0 references

An accelerated inexact dampened augmented Lagrangian method for linearly-constrained nonconvex composite optimization problems

0 references

Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers

0 references

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

0 references

An augmented Lagrangian decomposition method for block diagonal linear programming problems

0 references

An adaptive superfast inexact proximal augmented Lagrangian method for smooth nonconvex composite optimization problems

0 references

Douglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results

0 references

Global convergence of ADMM in nonconvex nonsmooth optimization

0 references

A Proximal Alternating Direction Method of Multiplier for Linearly Constrained Nonconvex Minimization

0 references

Identifiers

arXiv ID

2110.12502

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6136662