A variable-penalty alternating directions method for convex optimization (Q1290650): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:41, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A variable-penalty alternating directions method for convex optimization |
scientific article |
Statements
A variable-penalty alternating directions method for convex optimization (English)
0 references
3 June 1999
0 references
decomposition
0 references
parallel computing
0 references
alternating directions
0 references
sum of two convex functions
0 references
convergence
0 references
block angular optimization
0 references
