A variable-penalty alternating directions method for convex optimization (Q1290650)
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 variable-penalty alternating directions method for convex optimization |
scientific article; zbMATH DE number 1294698
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A variable-penalty alternating directions method for convex optimization |
scientific article; zbMATH DE number 1294698 |
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
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8020572066307068
0 references
0.7943406105041504
0 references
0.7937148809432983
0 references
