A variable-penalty alternating directions method for convex optimization (Q1290650)

From MaRDI portal
Revision as of 11:37, 20 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q703093)
scientific article
Language Label Description Also known as
English
A variable-penalty alternating directions method for convex optimization
scientific article

    Statements

    A variable-penalty alternating directions method for convex optimization (English)
    0 references
    0 references
    3 June 1999
    0 references
    0 references
    decomposition
    0 references
    parallel computing
    0 references
    alternating directions
    0 references
    sum of two convex functions
    0 references
    convergence
    0 references
    block angular optimization
    0 references