An asymmetric proximal decomposition method for convex programming with linearly coupling constraints (Q447556)

From MaRDI portal
Revision as of 17:49, 21 June 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
An asymmetric proximal decomposition method for convex programming with linearly coupling constraints
scientific article

    Statements

    An asymmetric proximal decomposition method for convex programming with linearly coupling constraints (English)
    0 references
    0 references
    0 references
    4 September 2012
    0 references