The proximal alternating minimization algorithm for two-block separable convex optimization problems with linear constraints (Q2315259)
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: The proximal alternating minimization algorithm for two-block separable convex optimization problems with linear constraints |
scientific article; zbMATH DE number 7088318
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The proximal alternating minimization algorithm for two-block separable convex optimization problems with linear constraints |
scientific article; zbMATH DE number 7088318 |
Statements
The proximal alternating minimization algorithm for two-block separable convex optimization problems with linear constraints (English)
0 references
2 August 2019
0 references
proximal AMA
0 references
Lagrangian
0 references
saddle points
0 references
subdifferential
0 references
convex optimization
0 references
Fenchel duality
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9338874
0 references
0.92683464
0 references
0.9235233
0 references
0.9220796
0 references
0.91394985
0 references
0.9136684
0 references
0 references
0.9106077
0 references
0.90869236
0 references
