Solving maximum-entropy sampling problems using factored masks (Q868455)

From MaRDI portal
Revision as of 15:27, 25 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
Solving maximum-entropy sampling problems using factored masks
scientific article

    Statements

    title
    Solving maximum-entropy sampling problems using factored masks (English)
    0 references
    author
    Samuel Burer
    0 references
    Jon Lee
    0 references
    publication date
    5 March 2007
    0 references
    Mathematics Subject Classification ID
    90C26
    0 references
    90C57
    0 references
    90C22
    0 references
    90C27
    0 references
    zbMATH DE Number
    5131066
    0 references
    zbMATH Keywords
    entropy
    0 references
    branch and bound
    0 references
    nonlinear programming
    0 references
    eigenvalue
    0 references
    describes a project that uses
    CirCut
    0 references
    SDPLR
    0 references
    GradSamp
    0 references
    OpenAlex ID
    W2150615968
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q868455&oldid=34924826"
    Powered by MediaWiki