A faster generalized ADMM-based algorithm using a sequential updating scheme with relaxed step sizes for multiple-block linearly constrained separable convex programming (Q2020565)
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: A faster generalized ADMM-based algorithm using a sequential updating scheme with relaxed step sizes for multiple-block linearly constrained separable convex programming |
scientific article; zbMATH DE number 7337480
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A faster generalized ADMM-based algorithm using a sequential updating scheme with relaxed step sizes for multiple-block linearly constrained separable convex programming |
scientific article; zbMATH DE number 7337480 |
Statements
A faster generalized ADMM-based algorithm using a sequential updating scheme with relaxed step sizes for multiple-block linearly constrained separable convex programming (English)
0 references
23 April 2021
0 references
alternating direction method of multipliers
0 references
augmented Lagrangian
0 references
multi-block
0 references
sequential updating scheme of the Lagrange multiplier
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
