A faster generalized ADMM-based algorithm using a sequential updating scheme with relaxed step sizes for multiple-block linearly constrained separable convex programming (Q2020565): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.cam.2021.113503 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.CAM.2021.113503 / rank | |||
Normal rank | |||
Latest revision as of 18:57, 16 December 2024
scientific article
| 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 |
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
