A branch-and-bound algorithm for the exact optimal experimental design problem
From MaRDI portal
Publication:2058883
DOI10.1007/S11222-021-10043-5zbMath1475.62015OpenAlexW3197226137MaRDI QIDQ2058883
Publication date: 10 December 2021
Published in: Statistics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11222-021-10043-5
Computational methods for problems pertaining to statistics (62-08) Optimal statistical designs (62K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items (3)
Mixed-integer linear programming for computing optimal experimental designs ⋮ D- andA-Optimal Screening Designs ⋮ The polytope of optimal approximate designs: extending the selection of informative experiments
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- D-optimal designs via a cocktail algorithm
- Multiplicative algorithms for computing optimum designs
- Ascent with quadratic assistance for the construction of exact experimental designs
- Minimum-volume enclosing ellipsoids and core sets
- Computing exact \(D\)-optimal designs by mixed integer second-order cone programming
- A vertex-exchange-method in D-optimal design theory
- General equivalence theory for optimum designs (approximate theory)
- Computing efficient exact designs of experiments using integer quadratic programming
- A comparison of general-purpose optimization algorithms for finding optimal approximate experimental designs
- On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
- D-optimal design of a monitoring network for parameter estimation of distributed systems
- Sequences converging to D-optimal designs of experiments
- Computing D-Optimal Experimental Designs for Estimating Treatment Contrasts Under the Presence of a Nuisance Time Trend
- An Algorithm for Construction of Constrained D-Optimum Designs
- Optimal Design for Nonlinear Response Models
- Sensor network scheduling for identification of spatially distributed processes
- Submodularity and Randomized rounding techniques for Optimal Experimental Design
- A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments
- Marginally Restricted D-Optimal Designs
- A Comparison of Algorithms for Constructing Exact D-Optimal Designs
- Algorithmic complexity: threeNP- hard problems in computational statistics
- Branch-and-Bound Search for Experimental Designs Based on D Optimality and Other Criteria
- An Algorithm for the Construction of "D-Optimal" Experimental Designs
- On Computationally Tractable Selection of Experiments in Measurement-Constrained Regression Models
- Invited Discussion Paper Constrained Optimization of Experimental Design
- The Coordinate-Exchange Algorithm for Constructing Exact Optimal Experimental Designs
- Proportional Volume Sampling and Approximation Algorithms for A-Optimal Design
- Computation of Minimum-Volume Covering Ellipsoids
- Faster Subset Selection for Matrices and Applications
- Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids
- A geometric approach to optimal design theory
- A first-order algorithm for the A-optimal experimental design problem: a mathematical programming approach
This page was built for publication: A branch-and-bound algorithm for the exact optimal experimental design problem
