The proximal alternating minimization algorithm for two-block separable convex optimization problems with linear constraints (Q2315259): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:17, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The proximal alternating minimization algorithm for two-block separable convex optimization problems with linear constraints |
scientific article |
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
