Inexact coordinate descent: complexity and preconditioning (Q306308)

From MaRDI portal
Revision as of 16:38, 30 December 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/jota/TappendenRG16, #quickstatements; #temporary_batch_1735573089131)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
Inexact coordinate descent: complexity and preconditioning
scientific article

    Statements

    Inexact coordinate descent: complexity and preconditioning (English)
    0 references
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references