Abstract: A fast new algorithm is proposed for numerical computation of (approximate) D-optimal designs. This "cocktail algorithm" extends the well-known vertex direction method (VDM; Fedorov 1972) and the multiplicative algorithm (Silvey, Titterington and Torsney, 1978), and shares their simplicity and monotonic convergence properties. Numerical examples show that the cocktail algorithm can lead to dramatically improved speed, sometimes by orders of magnitude, relative to either the multiplicative algorithm or the vertex exchange method (a variant of VDM). Key to the improved speed is a new nearest neighbor exchange strategy, which acts locally and complements the global effect of the multiplicative algorithm. Possible extensions to related problems such as nonparametric maximum likelihood estimation are mentioned.
Recommendations
Cites work
- scientific article; zbMATH DE number 1240939 (Why is no real title available?)
- scientific article; zbMATH DE number 800961 (Why is no real title available?)
- scientific article; zbMATH DE number 3393615 (Why is no real title available?)
- A Hybrid Algorithm for Computation of the Nonparametric Maximum Likelihood Estimator From Censored Data
- A vertex-exchange-method in D-optimal design theory
- An algorithm for optimal designs on a design space
- Construction of optimal designs using a clustering approach
- Convergent design sequences, for sufficiently regular optimality criteria
- Dimension-reduced nonparametric maximum likelihood computation for interval-censored data
- Estimation of Correlation Coefficients by Ellipsoidal Trimming
- General equivalence theory for optimum designs (approximate theory)
- Improvements on removing nonoptimal support points in \(D\)-optimum design algorithms
- Improving updating rules in multiplicative algorithms for computing \(D\)-optimal designs
- Locally D-optimal designs for exponential regression models
- Monotonic convergence of a general algorithm for computing optimal designs
- Optimum Experimental Designs for Properties of a Compartmental Model
- Optimum experimental designs, with SAS
- Some algorithmic aspects of the theory of optimal designs
- Strict monotonicity and convergence rate of Titterington's algorithm for computing D-optimal designs
- The Equivalence of Two Extremum Problems
- The geometry of mixture likelihoods: A general theory
- Übersichtsarbeiten
Cited in
(56)- Multiplicative methods for computing \(D\)-optimal stratified designs of experiments
- Optimal Design of Experiments for Implicit Models
- Optimal experimental design: from design point to design region
- Efficiency of the coordinate-exchange algorithm in constructing exact optimal discrete choice experiments
- On optimal designs for nonlinear models: a general and efficient algorithm
- A comparison of general-purpose optimization algorithms for finding optimal approximate experimental designs
- An algorithm for computing generalized D -optimal allocation with cost consideration in regression models
- A sparse control approach to optimal sensor placement in PDE-constrained parameter estimation problems
- Toward more numerically stable computations of optimal experimental designs
- Computing efficient exact designs of experiments using integer quadratic programming
- Linear convergence of accelerated conditional gradient algorithms in spaces of measures
- Computing exact \(D\)-optimal designs by mixed integer second-order cone programming
- The exchange threshold accepting algorithm for generating D-optimal designs of some special mixture models
- The mixture design threshold accepting algorithm for generating D-optimal designs of the mixture models
- Strict monotonicity and convergence rate of Titterington's algorithm for computing D-optimal designs
- Adaptive grid semidefinite programming for finding optimal designs
- Computing minimum-volume enclosing ellipsoids for large datasets
- A new monotonic algorithm for the \(E\)-optimal experiment design problem
- Construction of constrained experimental designs on finite spaces for a modified \(\mathrm{E}_k\)-optimality criterion
- Multi-stage differential evolution algorithm for constrained D-optimal design
- Quasi-Newton algorithm for optimal approximate linear regression design: optimization in matrix space
- R-optimal designs for multi-response regression models with multi-factors
- ForLion: a new algorithm for D-optimal designs under general parametric statistical models with mixed factors
- d-QPSO: A Quantum-Behaved Particle Swarm Technique for FindingD-Optimal Designs With Discrete and Continuous Factors and a Binary Response
- Robust and efficient factorial designs under baseline parametrization
- An unexpected connection between Bayes \(A\)-optimal designs and the group Lasso
- An Accelerated Sequential Algorithm for ProducingD-Optimal Designs
- Algorithmic construction of optimal designs on compact sets for concave and differentiable criteria
- A delimitation of the support of optimal designs for Kiefer's \(\phi _p\)-class of criteria
- optedr
- Efficient computational algorithms for approximate optimal designs
- On optimal designs for nonregular models
- A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments
- On multiple-objective optimal designs
- Multi-objective cellular particle swarm optimization and RBF for drilling parameters optimization
- Bayesian \(A\)-optimal design of experiment with quantitative and qualitative responses
- Finding D-optimal designs by randomised decomposition and switching
- Combined algorithm to compute D-optimal designs
- Fast algorithms for the minimum volume estimator
- Removal of redundant candidate points for the exact D-optimal design problem
- Some refinements on Fedorov's algorithms for constructing D-optimal designs
- Evaluation of Combinatorial Optimisation Algorithms for c-Optimal Experimental Designs with Correlated Observations
- A branch-and-bound algorithm for the exact optimal experimental design problem
- Optimal design of multifactor experiments via grid exploration
- A first-order algorithm for the A-optimal experimental design problem: a mathematical programming approach
- Graphical methods for order-of-addition experiments
- Compound optimal design of experiments - semidefinite programming formulations
- scientific article; zbMATH DE number 6159476 (Why is no real title available?)
- Order-of-addition experiments: a review and some recommendations
- Exact optimal experimental designs with constraints
- scientific article; zbMATH DE number 2059717 (Why is no real title available?)
- A vertex-exchange-method in D-optimal design theory
- D-optimal designs based on the second-order least squares estimator
- Barycentric algorithm for computing D-optimal size- and cost-constrained designs of experiments
- Efficient computational algorithm for optimal continuous experimental designs
- On greedy heuristics for computing D-efficient saturated subsets
This page was built for publication: D-optimal designs via a cocktail algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q88784)
