The proximal alternating minimization algorithm for two-block separable convex optimization problems with linear constraints (Q2315259)

From MaRDI portal
Revision as of 05:24, 5 April 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q93144945, #quickstatements; #temporary_batch_1712286835472)





scientific article
Language Label Description Also known as
English
The proximal alternating minimization algorithm for two-block separable convex optimization problems with linear constraints
scientific article

    Statements

    The proximal alternating minimization algorithm for two-block separable convex optimization problems with linear constraints (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2 August 2019
    0 references
    proximal AMA
    0 references
    Lagrangian
    0 references
    saddle points
    0 references
    subdifferential
    0 references
    convex optimization
    0 references
    Fenchel duality
    0 references

    Identifiers

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