Two Symmetrized Coordinate Descent Methods Can Be $O(n^2)$ Times Slower Than the Randomized Version (Q5162659)
From MaRDI portal
scientific article; zbMATH DE number 7421062
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two Symmetrized Coordinate Descent Methods Can Be $O(n^2)$ Times Slower Than the Randomized Version |
scientific article; zbMATH DE number 7421062 |
Statements
Two Symmetrized Coordinate Descent Methods Can Be $O(n^2)$ Times Slower Than the Randomized Version (English)
0 references
5 November 2021
0 references
convex optimization
0 references
coordinate descent
0 references
alternating direction method of multipliers
0 references
worst-case efficiency estimates
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
