Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming (Q4622887)

From MaRDI portal
Revision as of 14:32, 7 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article; zbMATH DE number 7024421
Language Label Description Also known as
English
Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming
scientific article; zbMATH DE number 7024421

    Statements

    Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming (English)
    0 references
    0 references
    0 references
    0 references
    18 February 2019
    0 references
    conic convex problems
    0 references
    smooth (augmented) dual functions
    0 references
    penalty functions
    0 references
    (augmented) dual first-order methods
    0 references
    penalty fast gradient methods
    0 references
    approximate primal solution
    0 references
    overall computational complexity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references