Dual Ascent Methods for Problems with Strictly Convex Costs and Linear Constraints: A Unified Approach (Q3034446)

From MaRDI portal
Revision as of 18:06, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Dual Ascent Methods for Problems with Strictly Convex Costs and Linear Constraints: A Unified Approach
scientific article

    Statements

    Dual Ascent Methods for Problems with Strictly Convex Costs and Linear Constraints: A Unified Approach (English)
    0 references
    1990
    0 references
    strictly convex
    0 references
    network flow
    0 references
    entropy maximization
    0 references
    quadratic program
    0 references
    parallel computation
    0 references
    block coordinate ascent method
    0 references
    dual coordinate ascent methods
    0 references
    dual gradient methods
    0 references
    0 references

    Identifiers

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