A new primal-dual path-following interior-point algorithm for linearly constrained convex optimization (Q3640925)

From MaRDI portal
Revision as of 04:29, 2 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 new primal-dual path-following interior-point algorithm for linearly constrained convex optimization
scientific article

    Statements

    A new primal-dual path-following interior-point algorithm for linearly constrained convex optimization (English)
    0 references
    0 references
    0 references
    0 references
    11 November 2009
    0 references
    0 references
    linearly constrained convex optimization
    0 references
    interior-point algorithm
    0 references
    small-update method
    0 references
    polynomial complexity
    0 references
    0 references