A generalization of linearized alternating direction method of multipliers for solving two-block separable convex programming (Q2424935)
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 generalization of linearized alternating direction method of multipliers for solving two-block separable convex programming |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A generalization of linearized alternating direction method of multipliers for solving two-block separable convex programming |
scientific article |
Statements
A generalization of linearized alternating direction method of multipliers for solving two-block separable convex programming (English)
0 references
25 June 2019
0 references
alternating direction method of multipliers
0 references
proximal point algorithm
0 references
separable convex programming
0 references
linearization
0 references
indefinite proximal regularization
0 references
LASSO
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
