Global Complexity Bound of a Proximal ADMM for Linearly Constrained Nonseparable Nonconvex Composite Programming (Q6136662)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Global Complexity Bound of a Proximal ADMM for Linearly Constrained Nonseparable Nonconvex Composite Programming |
scientific article; zbMATH DE number 7790175
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Global Complexity Bound of a Proximal ADMM for Linearly Constrained Nonseparable Nonconvex Composite Programming |
scientific article; zbMATH DE number 7790175 |
Statements
Global Complexity Bound of a Proximal ADMM for Linearly Constrained Nonseparable Nonconvex Composite Programming (English)
0 references
17 January 2024
0 references
proximal ADMM
0 references
nonseparable nonconvex composite optimization
0 references
iteration complexity
0 references
under-relaxed update
0 references
augmented Lagrangian function
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8373373746871948
0 references
0.8288012742996216
0 references
0.8276304006576538
0 references
0.8254836797714233
0 references
