An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming (Q1653277)

From MaRDI portal
Revision as of 05:44, 16 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
An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming
scientific article

    Statements

    title
    An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming (English)
    0 references
    author
    Makoto Yamashita
    0 references
    Ya-Guang Yang
    0 references
    publication date
    3 August 2018
    0 references
    zbMATH Keywords
    polynomial algorithm
    0 references
    infeasible-interior-point method
    0 references
    linear programming
    0 references
    describes a project that uses
    Netlib
    0 references
    CurveLP
    0 references
    cites work
    Q4091004
    0 references
    Q4051879
    0 references
    Q2879562
    0 references
    Q5691079
    0 references

    Identifiers

    zbMATH DE Number
    6912894
    0 references
    OpenAlex ID
    W3100349759
    0 references
    arXiv ID
    1506.06365
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1653277&oldid=36412889"
    Powered by MediaWiki