Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming (Q4697091)

From MaRDI portal
Revision as of 15:06, 30 December 2024 by Import241228121245 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 221612
Language Label Description Also known as
English
Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
scientific article; zbMATH DE number 221612

    Statements

    Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming (English)
    0 references
    0 references
    29 June 1993
    0 references
    nonlinear version of the proximal point algorithm
    0 references
    Bregman function
    0 references
    strictly convex differentiable function
    0 references
    distance measure
    0 references
    \(D\)-function proximal minimization algorithm
    0 references
    multiplier methods
    0 references
    nonquadratic variations on the proximal method of multipliers
    0 references

    Identifiers

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