A projected gradient algorithm for solving the maxcut SDP relaxation (Q2770188)

From MaRDI portal
Revision as of 22:41, 3 June 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
A projected gradient algorithm for solving the maxcut SDP relaxation
scientific article

    Statements

    title
    A projected gradient algorithm for solving the maxcut SDP relaxation (English)
    0 references
    author
    Samuel Burer
    0 references
    Renato D. C. Monteiro
    0 references
    publication date
    2001
    0 references
    Mathematics Subject Classification ID
    90C52
    0 references
    90C22
    0 references
    90C35
    0 references
    zbMATH DE Number
    1702922
    0 references
    zbMATH Keywords
    Semidefinite programming
    0 references
    Maxcut
    0 references
    Approximation algorithm
    0 references
    Semidefinite relaxation
    0 references
    Projected gradient method
    0 references
    describes a project that uses
    SDPA
    0 references
    COL
    0 references
    OpenAlex ID
    W2000602248
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2770188&oldid=34292176"
    Powered by MediaWiki