A branch-and-bound algorithm for the exact optimal experimental design problem
From MaRDI portal
Recommendations
- A first-order algorithm for the A-optimal experimental design problem: a mathematical programming approach
- Exact optimal experimental designs with constraints
- A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments
- Constructing Exact D-Optimal Experimental Designs by Simulated Annealing
- Approximation algorithms for \(D\)-optimal design
Cites work
- A Comparison of Algorithms for Constructing Exact D-Optimal Designs
- A comparison of general-purpose optimization algorithms for finding optimal approximate experimental designs
- A first-order algorithm for the A-optimal experimental design problem: a mathematical programming approach
- A geometric approach to optimal design theory
- A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments
- A vertex-exchange-method in D-optimal design theory
- Algorithmic complexity: threeNP- hard problems in computational statistics
- An algorithm for construction of constrained D-optimum designs
- An Algorithm for the Construction of "D-Optimal" Experimental Designs
- Approximate positive correlated distributions and approximation algorithms for D-optimal design
- Ascent with quadratic assistance for the construction of exact experimental designs
- Branch-and-Bound Search for Experimental Designs Based on D Optimality and Other Criteria
- Computation of Minimum-Volume Covering Ellipsoids
- Computing D-optimal experimental designs for estimating treatment contrasts under the presence of a nuisance time trend
- Computing efficient exact designs of experiments using integer quadratic programming
- Computing exact \(D\)-optimal designs by mixed integer second-order cone programming
- D-optimal design of a monitoring network for parameter estimation of distributed systems
- D-optimal designs via a cocktail algorithm
- Faster subset selection for matrices and applications
- General equivalence theory for optimum designs (approximate theory)
- scientific article; zbMATH DE number 800961 (Why is no real title available?)
- scientific article; zbMATH DE number 3393615 (Why is no real title available?)
- Invited Discussion Paper Constrained Optimization of Experimental Design
- Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids
- Marginally Restricted D-Optimal Designs
- Minimum-volume enclosing ellipsoids and core sets
- Multiplicative algorithms for computing optimum designs
- On computationally tractable selection of experiments in measurement-constrained regression models
- On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
- Optimal design for nonlinear response models
- Optimum experimental designs, with SAS
- Proportional volume sampling and approximation algorithms for \(A\)-optimal design
- Sensor network scheduling for identification of spatially distributed processes
- Sequences converging to D-optimal designs of experiments
- Submodularity and randomized rounding techniques for optimal experimental design
- The Coordinate-Exchange Algorithm for Constructing Exact Optimal Experimental Designs
Cited in
(10)- Near-optimal discrete optimization for experimental design: a regret minimization approach
- Optimal exact designs of experiments via mixed integer nonlinear programming
- A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments
- A first-order algorithm for the A-optimal experimental design problem: a mathematical programming approach
- 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
- Removal of redundant candidate points for the exact D-optimal design problem
- Global optimality conditions for sensor placement, with extensions to binary low-rank A-optimal designs
- Branch-and-bound for integer D-optimality with fast local search and variable-bound tightening
This page was built for publication: A branch-and-bound algorithm for the exact optimal experimental design problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2058883)
