A branch-and-bound algorithm for the exact optimal experimental design problem (Q2058883): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11222-021-10043-5 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11222-021-10043-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3197226137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: A first-order algorithm for the A-optimal experimental design problem: a mathematical programming approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3445852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequences converging to D-optimal designs of experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Subset Selection for Matrices and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A vertex-exchange-method in D-optimal design theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodularity and Randomized rounding techniques for Optimal Experimental Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Marginally Restricted D-Optimal Designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Invited Discussion Paper Constrained Optimization of Experimental Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparison of Algorithms for Constructing Exact D-Optimal Designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Design for Nonlinear Response Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ascent with quadratic assistance for the construction of exact experimental designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of general-purpose optimization algorithms for finding optimal approximate experimental designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing efficient exact designs of experiments using integer quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing D-Optimal Experimental Designs for Estimating Treatment Contrasts Under the Presence of a Nuisance Time Trend / rank
 
Normal rank
Property / cites work
 
Property / cites work: General equivalence theory for optimum designs (approximate theory) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-volume enclosing ellipsoids and core sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Coordinate-Exchange Algorithm for Constructing Exact Optimal Experimental Designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Construction of "D-Optimal" Experimental Designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proportional Volume Sampling and Approximation Algorithms for <i>A</i>-Optimal Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4849481 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing exact \(D\)-optimal designs by mixed integer second-order cone programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A geometric approach to optimal design theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4608039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of Minimum-Volume Covering Ellipsoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplicative algorithms for computing optimum designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensor network scheduling for identification of spatially distributed processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Construction of Constrained D-Optimum Designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: D-optimal design of a monitoring network for parameter estimation of distributed systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Computationally Tractable Selection of Experiments in Measurement-Constrained Regression Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic complexity: three<i>NP</i>- hard problems in computational statistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-Bound Search for Experimental Designs Based on D Optimality and Other Criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5661044 / rank
 
Normal rank
Property / cites work
 
Property / cites work: D-optimal designs via a cocktail algorithm / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11222-021-10043-5 / rank
 
Normal rank

Latest revision as of 22:16, 16 December 2024

scientific article
Language Label Description Also known as
English
A branch-and-bound algorithm for the exact optimal experimental design problem
scientific article

    Statements

    A branch-and-bound algorithm for the exact optimal experimental design problem (English)
    0 references
    10 December 2021
    0 references
    exact optimal experimental design
    0 references
    Kiefer's optimality criteria
    0 references
    D-optimality
    0 references
    A-optimality
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers