Computing efficient exact designs of experiments using integer quadratic programming
From MaRDI portal
Publication:1621402
DOI10.1016/j.csda.2013.02.021zbMath1471.62087OpenAlexW2095580175MaRDI QIDQ1621402
Publication date: 8 November 2018
Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.csda.2013.02.021
integer quadratic programmingmarginal constraints\(D\)-optimal designcost constraintsexact design\(DQ\)-optimal design
Computational methods for problems pertaining to statistics (62-08) Linear regression; mixed models (62J05) Optimal statistical designs (62K05) Applications of mathematical programming (90C90)
Related Items (11)
Exact optimal experimental designs with constraints ⋮ Special issue on algorithms for design of experiments ⋮ Computing optimal experimental designs with respect to a compound Bayes risk criterion ⋮ Computing exact \(D\)-optimal designs by mixed integer second-order cone programming ⋮ Efficient computational algorithm for optimal continuous experimental designs ⋮ Construction of efficient experimental designs under multiple resource constraints ⋮ Barycentric algorithm for computing D-optimal size- and cost-constrained designs of experiments ⋮ Optimal exact designs of experiments via mixed integer nonlinear programming ⋮ A branch-and-bound algorithm for the exact optimal experimental design problem ⋮ Ascent with quadratic assistance for the construction of exact experimental designs ⋮ Constructing two-level \(Q_B\)-optimal screening designs using mixed-integer programming and heuristic algorithms
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- D-optimal designs via a cocktail algorithm
- Computing optimal designs of multiresponse experiments reduces to second-order cone program\-ming
- Construction of cyclic designs using integer programming
- On the optimality of spring balance weighing designs
- Functional approach to optimal experimental design.
- Chebyshev approximation of log-determinants of spatial weight matrices
- Construction of marginally and conditionally restricted designs using multiplicative algorithms
- An application of the Kiefer-Wolfowitz equivalence theorem to a problem in Hadamard transform optics
- Admissible experimental designs in multiple polynomial regression
- On the theory of connected designs: Characterization and optimality
- On the properties of proper (M,S) optimal block designs
- \(D\)-optimal weighing designs for \(n\equiv -1\pmod 4\) objects and a large number of weighings
- Approximation of a maximum-submodular-coverage problem involving spectral functions, with application to experimental designs
- Budget constrained run orders in optimum design
- Largest \(j\)-simplices in \(d\)-cubes: Some relatives of the Hadamard maximum determinant problem
- Workweek optimization of experimental designs: exact designs for variable sampling costs
- D-optimal design of a monitoring network for parameter estimation of distributed systems
- Equivalence theorem for Schur optimality of experimental designs
- Approximations to the determinant term in gaussian maximum likelihood estimation of some spatial models
- Optimality Criteria for Incomplete Block Designs
- Matrix Analysis
- The Application of the Annealing Algorithm to the Construction of Exact Optimal Designs for Linear-Regression Models
- Constructing Exact D-Optimal Experimental Designs by Simulated Annealing
- A Comparison of Algorithms for Constructing Exact D-Optimal Designs
- Branch-and-Bound Search for Experimental Designs Based on D Optimality and Other Criteria
- An Algorithm for the Construction of "D-Optimal" Experimental Designs
- D-optimal weighing designs for four and five objects
- Application of genetic algorithms to the construction of exact D-optimal designs
- Determinant Maximization with Linear Matrix Inequality Constraints
- Efficiencies of Rounded Optimal Approximate Designs for Small Samples
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Invited Discussion Paper Constrained Optimization of Experimental Design
- Matrix Calculus and Zero-One Matrices
- The Coordinate-Exchange Algorithm for Constructing Exact Optimal Experimental Designs
- Optimal Design of Experiments
- \(D\)-optimal weighing designs for six objects.
This page was built for publication: Computing efficient exact designs of experiments using integer quadratic programming
