On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming (Q2220656)
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: On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming |
scientific article |
Statements
On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming (English)
0 references
25 January 2021
0 references
alternating direction method of multipliers
0 references
augmented Lagrangian method
0 references
symmetric Gauss-Seidel decomposition
0 references
proximal term
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
0 references
0 references
0.91318345
0 references
0.90610814
0 references
0.9028759
0 references
0.90276676
0 references
0.90096104
0 references
0.8938716
0 references
0.89276236
0 references
0.8907251
0 references
0.8902466
0 references
