Solving maximum-entropy sampling problems using factored masks (Q868455): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10107-006-0024-1 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: CirCut / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SDPLR / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GradSamp / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10107-006-0024-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2150615968 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using continuous nonlinear relaxations to solve constrained maximum-entropy sampling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A projected gradient algorithm for solving the maxcut SDP relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal monitoring network designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850604 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for Maximum Entropy Sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained Maximum-Entropy Sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear integer programming bound for maximum-entropy sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum Entropy Sampling and Optimal Bayesian Experimental Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: On analyticity of functions involving eigenvalues / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10107-006-0024-1 / rank
 
Normal rank

Latest revision as of 06:11, 10 December 2024

scientific article
Language Label Description Also known as
English
Solving maximum-entropy sampling problems using factored masks
scientific article

    Statements

    Solving maximum-entropy sampling problems using factored masks (English)
    0 references
    0 references
    0 references
    5 March 2007
    0 references
    entropy
    0 references
    branch and bound
    0 references
    nonlinear programming
    0 references
    eigenvalue
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references