Implicit optimality criterion for convex SIP problem with box constrained index set (Q1939083)

From MaRDI portal
Revision as of 05:07, 6 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
Implicit optimality criterion for convex SIP problem with box constrained index set
scientific article

    Statements

    title
    Implicit optimality criterion for convex SIP problem with box constrained index set (English)
    0 references
    author
    O. I. Kostyukova
    0 references
    Tatiana V. Tchemisova
    0 references
    published in
    Top
    0 references
    publication date
    26 February 2013
    0 references
    zbMATH Keywords
    semi-infinite programming (SIP)
    0 references
    semidefinite programming (SDP)
    0 references
    constraint qualifications (CQ)
    0 references
    immobile index
    0 references
    optimality conditions
    0 references
    cites work
    Q4503250
    0 references
    Q4161092
    0 references
    Q3542466
    0 references
    Q4184619
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90C25
    0 references
    90C30
    0 references
    90C34
    0 references
    zbMATH DE Number
    6139266
    0 references
    Wikidata QID
    Q57677637
    0 references
    OpenAlex ID
    W2036865528
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1939083&oldid=35323022"
    Powered by MediaWiki