A Polynomial-Time Descent Method for Separable Convex Optimization Problems with Linear Constraints (Q2802141)

From MaRDI portal
Revision as of 20:17, 11 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A Polynomial-Time Descent Method for Separable Convex Optimization Problems with Linear Constraints
scientific article

    Statements

    A Polynomial-Time Descent Method for Separable Convex Optimization Problems with Linear Constraints (English)
    0 references
    0 references
    25 April 2016
    0 references
    convex optimization
    0 references
    separable convex function
    0 references
    polynomial algorithm
    0 references

    Identifiers