D-optimal designs via a cocktail algorithm
From MaRDI portal
Publication:88784
DOI10.1007/s11222-010-9183-2zbMath1270.62107arXiv0911.0108OpenAlexW3105687256MaRDI QIDQ88784
Publication date: 9 June 2010
Published in: Statistics and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0911.0108
Related Items
Optimal Design of Experiments for Implicit Models ⋮ The mixture design threshold accepting algorithm for generating \(D\)-optimal designs of the mixture models ⋮ Exact optimal experimental designs with constraints ⋮ Computing efficient exact designs of experiments using integer quadratic programming ⋮ Computing minimum-volume enclosing ellipsoids for large datasets ⋮ Multi-stage differential evolution algorithm for constrained D-optimal design ⋮ Quasi-Newton algorithm for optimal approximate linear regression design: optimization in matrix space ⋮ Multi-objective cellular particle swarm optimization and RBF for drilling parameters optimization ⋮ R-optimal designs for multi-response regression models with multi-factors ⋮ Multiplicative methods for computing \(D\)-optimal stratified designs of experiments ⋮ Computing exact \(D\)-optimal designs by mixed integer second-order cone programming ⋮ An unexpected connection between Bayes \(A\)-optimal designs and the group Lasso ⋮ Adaptive grid semidefinite programming for finding optimal designs ⋮ A delimitation of the support of optimal designs for Kiefer's \(\phi _p\)-class of criteria ⋮ Efficient computational algorithm for optimal continuous experimental designs ⋮ Algorithmic construction of optimal designs on compact sets for concave and differentiable criteria ⋮ Combined algorithm to compute D-optimal designs ⋮ Some refinements on Fedorov's algorithms for constructing D-optimal designs ⋮ A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments ⋮ On greedy heuristics for computing D-efficient saturated subsets ⋮ A new monotonic algorithm for the \(E\)-optimal experiment design problem ⋮ D-optimal designs based on the second-order least squares estimator ⋮ Barycentric algorithm for computing D-optimal size- and cost-constrained designs of experiments ⋮ Evaluation of Combinatorial Optimisation Algorithms for c-Optimal Experimental Designs with Correlated Observations ⋮ optedr ⋮ Construction of constrained experimental designs on finite spaces for a modified \(\mathrm{E}_k\)-optimality criterion ⋮ On optimal designs for nonregular models ⋮ A first-order algorithm for the A-optimal experimental design problem: a mathematical programming approach ⋮ A comparison of general-purpose optimization algorithms for finding optimal approximate experimental designs ⋮ Bayesian \(A\)-optimal design of experiment with quantitative and qualitative responses ⋮ Efficient computational algorithms for approximate optimal designs ⋮ A branch-and-bound algorithm for the exact optimal experimental design problem ⋮ Optimal design of multifactor experiments via grid exploration ⋮ On multiple-objective optimal designs ⋮ Efficiency of the coordinate-exchange algorithm in constructing exact optimal discrete choice experiments ⋮ Linear convergence of accelerated conditional gradient algorithms in spaces of measures ⋮ On Optimal Designs for Nonlinear Models: A General and Efficient Algorithm ⋮ A sparse control approach to optimal sensor placement in PDE-constrained parameter estimation problems ⋮ Fast algorithms for the minimum volume estimator
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dimension-reduced nonparametric maximum likelihood computation for interval-censored data
- Improvements on removing nonoptimal support points in \(D\)-optimum design algorithms
- Improving updating rules in multiplicative algorithms for computing \(D\)-optimal designs
- Monotonic convergence of a general algorithm for computing optimal designs
- The geometry of mixture likelihoods: A general theory
- A vertex-exchange-method in D-optimal design theory
- General equivalence theory for optimum designs (approximate theory)
- Convergent design sequences, for sufficiently regular optimality criteria
- Some algorithmic aspects of the theory of optimal designs
- Strict monotonicity and convergence rate of Titterington's algorithm for computing D-optimal designs
- Construction of optimal designs using a clustering approach
- The Equivalence of Two Extremum Problems
- Estimation of Correlation Coefficients by Ellipsoidal Trimming
- An algorithm for optimal designs on a design space
- Optimum Experimental Designs for Properties of a Compartmental Model
- A Hybrid Algorithm for Computation of the Nonparametric Maximum Likelihood Estimator From Censored Data
- Übersichtsarbeiten
