Iteration complexity on the generalized Peaceman–Rachford splitting method for separable convex programming (Q5239082)
From MaRDI portal
scientific article; zbMATH DE number 7119971
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
