A partially proximal S-ADMM for separable convex optimization with linear constraints (Q2227678)
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 partially proximal S-ADMM for separable convex optimization with linear constraints |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A partially proximal S-ADMM for separable convex optimization with linear constraints |
scientific article |
Statements
A partially proximal S-ADMM for separable convex optimization with linear constraints (English)
0 references
15 February 2021
0 references
separable convex optimization
0 references
multiple blocks
0 references
symmetric alternating direction method of multipliers
0 references
proximal point algorithm
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
