A class of convergent primal-dual subgradient algorithms for decomposable convex programs (Q3725884)

From MaRDI portal
Revision as of 13:38, 18 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A class of convergent primal-dual subgradient algorithms for decomposable convex programs
scientific article

    Statements

    A class of convergent primal-dual subgradient algorithms for decomposable convex programs (English)
    0 references
    0 references
    0 references
    0 references
    1986
    0 references
    0 references
    primal-dual subgradient algorithm
    0 references
    nondifferentiable
    0 references
    convex programming
    0 references
    Lagrangian dual function
    0 references
    penalty function
    0 references
    stopping criterion
    0 references