Inexact coordinate descent: complexity and preconditioning (Q306308)
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: Inexact coordinate descent: complexity and preconditioning |
scientific article; zbMATH DE number 6620961
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Inexact coordinate descent: complexity and preconditioning |
scientific article; zbMATH DE number 6620961 |
Statements
Inexact coordinate descent: complexity and preconditioning (English)
0 references
31 August 2016
0 references
The paper is concerned with coordinate descent methods in which a randomized choice of the descent index is combined with an inexact construction of the updates. Numerical experiments are also provided.
0 references
inexact methods
0 references
block coordinate descent
0 references
convex optimization
0 references
iteration complexity
0 references
preconditioning
0 references
conjugate gradients
0 references
numerical experiments
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8166465759277344
0 references
0.8084621429443359
0 references
0.8038535118103027
0 references
0.8002637028694153
0 references
0.7999419569969177
0 references
