Minimizing Condition Number via Convex Programming (Q3225534)

From MaRDI portal
Revision as of 20:34, 4 April 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q57511257, #quickstatements; #temporary_batch_1712201099914)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Minimizing Condition Number via Convex Programming
scientific article

    Statements

    title
    Minimizing Condition Number via Convex Programming (English)
    0 references
    author
    Zhaosong Lu
    0 references
    Ting Kei Pong
    0 references
    publication date
    21 March 2012
    0 references
    zbMATH Keywords
    condition number
    0 references
    diagonal preconditioner
    0 references
    convex programming
    0 references
    semidefinite programming
    0 references
    describes a project that uses
    SDPLR
    0 references
    SeDuMi
    0 references
    SDPT3
    0 references

    Identifiers

    DOI
    10.1137/100795097
    0 references
    Mathematics Subject Classification ID
    90C22
    0 references
    90C25
    0 references
    15A12
    0 references
    65F35
    0 references
    zbMATH DE Number
    6016684
    0 references
    OpenAlex ID
    W2051289974
    0 references
    Wikidata QID
    Q57511257
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3225534&oldid=33238272"
    Powered by MediaWiki