Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints (Q3986751)

From MaRDI portal
Revision as of 20:45, 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
Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints
scientific article

    Statements

    Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints (English)
    0 references
    0 references
    0 references
    27 June 1992
    0 references
    relaxation methods
    0 references
    strict convexity
    0 references
    nondifferentiable nonseparable objective
    0 references
    dual coordinate ascent method
    0 references
    linear constraints
    0 references

    Identifiers