Iteration complexity on the generalized Peaceman–Rachford splitting method for separable convex programming (Q5239082)
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: Iteration complexity on the generalized Peaceman–Rachford splitting method for separable convex programming |
scientific article; zbMATH DE number 7119971
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Iteration complexity on the generalized Peaceman–Rachford splitting method for separable convex programming |
scientific article; zbMATH DE number 7119971 |
Statements
Iteration complexity on the generalized Peaceman–Rachford splitting method for separable convex programming (English)
0 references
21 October 2019
0 references
convex minimization problem
0 references
generalized Peaceman-Rachford splitting method
0 references
iteration complexity
0 references
Lasso problem
0 references
matrix optimization
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.92775756
0 references
0.91903657
0 references
0.91165656
0 references
0.91030777
0 references
0.9082442
0 references
0.9056931
0 references
0.90379596
0 references
0.89797056
0 references
0.8959929
0 references
0.8940753
0 references
