A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima (Q5853567)

From MaRDI portal
Revision as of 10:26, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7319278
Language Label Description Also known as
English
A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima
scientific article; zbMATH DE number 7319278

    Statements

    A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 March 2021
    0 references
    0 references
    0 references
    0 references
    0 references
    nonsmooth nonconvex optimization
    0 references
    Bregman-Moreau and Bregman forward-backward envelopes
    0 references
    relative smoothness
    0 references
    KL inequality
    0 references
    nonlinear error bound
    0 references
    nonisolated local minima
    0 references
    superlinear convergence
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references