Global Complexity Bound of a Proximal ADMM for Linearly Constrained Nonseparable Nonconvex Composite Programming (Q6136662)
From MaRDI portal
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
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
