Worst-case complexity of cyclic coordinate descent: \(O(n^2)\) gap with randomized version (Q2220668)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7300747
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Worst-case complexity of cyclic coordinate descent: \(O(n^2)\) gap with randomized version |
scientific article; zbMATH DE number 7300747 |
Statements
Worst-case complexity of cyclic coordinate descent: \(O(n^2)\) gap with randomized version (English)
0 references
25 January 2021
0 references
complexity analysis
0 references
cyclic coordinate descent method
0 references
convex quadratic minimization
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8238946795463562
0 references
0.8164637684822083
0 references
0.7898867130279541
0 references
0.7736458778381348
0 references
