A generalization of linearized alternating direction method of multipliers for solving two-block separable convex programming (Q2424935): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q128286676, #quickstatements; #temporary_batch_1728564459526 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q128286676 / rank | |||
Normal rank | |||
Revision as of 14:21, 10 October 2024
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
