Automatic repair of convex optimization problems (Q2245690)

From MaRDI portal
Revision as of 04:07, 27 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
Automatic repair of convex optimization problems
scientific article

    Statements

    title
    Automatic repair of convex optimization problems (English)
    0 references
    author
    Yanyan Li
    0 references
    publication date
    15 November 2021
    0 references
    zbMATH Keywords
    convex programming
    0 references
    infeasibility
    0 references
    unboundedness
    0 references
    parametric optimization
    0 references
    describes a project that uses
    SCS
    0 references
    Gurobi
    0 references
    PERUSE
    0 references
    CPLEX
    0 references
    MProbe
    0 references
    CVXPY
    0 references
    cites work
    Q4263701
    0 references
    Q4821526
    0 references
    Q5618030
    0 references
    Q3023951
    0 references

    Identifiers

    zbMATH DE Number
    7426540
    0 references
    OpenAlex ID
    W3027962898
    0 references
    arXiv ID
    2001.11010
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2245690&oldid=36737473"
    Powered by MediaWiki