Sublinear time algorithms for approximate semidefinite programming (Q304246)

From MaRDI portal
Revision as of 10:58, 12 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
Sublinear time algorithms for approximate semidefinite programming
scientific article

    Statements

    title
    Sublinear time algorithms for approximate semidefinite programming (English)
    0 references
    author
    Dan Garber
    0 references
    Elad Hazan
    0 references
    publication date
    25 August 2016
    0 references
    zbMATH Keywords
    semidefinite programming
    0 references
    sublinear algorithms
    0 references
    online algorithms
    0 references
    large scale optimization
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90C22
    0 references
    90C06
    0 references
    68W27
    0 references
    68W20
    0 references
    zbMATH DE Number
    6619167
    0 references
    OpenAlex ID
    W806902362
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q304246&oldid=36268721"
    Powered by MediaWiki