On the Turing Model Complexity of Interior Point Methods for Semidefinite Programming (Q2821802): Difference between revisions

From MaRDI portal
← Older edit
ReferenceBot (talk | contribs)
Bots
1,895,659 edits
‎Changed an Item
Set OpenAlex properties.
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W1639981145 / rank
 
Normal rank

Latest revision as of 08:38, 30 July 2024

scientific article
Language Label Description Also known as
English
On the Turing Model Complexity of Interior Point Methods for Semidefinite Programming
scientific article

    Statements

    title
    On the Turing Model Complexity of Interior Point Methods for Semidefinite Programming (English)
    0 references
    author
    Etienne de Klerk
    0 references
    Frank Vallentin
    0 references
    publication date
    23 September 2016
    0 references
    zbMATH Keywords
    semidefinite programming
    0 references
    interior point method
    0 references
    Turing model complexity
    0 references
    ellipsoid method
    0 references
    cites work
    Q4197641
    0 references
    Q4517105
    0 references
    Q4324980
    0 references
    Q3818127
    0 references
    Q5691079
    0 references
    Q4097094
    0 references

    Identifiers

    DOI
    10.1137/15M103114X
    0 references
    Mathematics Subject Classification ID
    90C22
    0 references
    90C51
    0 references
    68Q25
    0 references
    zbMATH DE Number
    6629377
    0 references
    arXiv ID
    1507.03549
    0 references
    OpenAlex ID
    W1639981145
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2821802&oldid=36918754"
    Powered by MediaWiki