A vertex-exchange-method in D-optimal design theory
From MaRDI portal
Publication:1081255
DOI10.1007/BF01894766zbMath0601.62091OpenAlexW2092143380MaRDI QIDQ1081255
Publication date: 1986
Published in: Metrika (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/176077
Related Items (28)
The mixture design threshold accepting algorithm for generating \(D\)-optimal designs of the mixture models ⋮ A new semi-parametric mixture model for interval censored data, with applications in the field of antimicrobial resistance ⋮ A Bayesian approach to the semiparametric estimation of a minimum inhibitory concentration distribution ⋮ A review of reliable maximum likelihood algorithms for semiparametric mixture models ⋮ Convex relaxation for IMSE optimal design in random-field models ⋮ Semiparametric mixture: continuous scale mixture approach ⋮ Accelerated failure time modeling via nonparametric mixtures ⋮ An unexpected connection between Bayes \(A\)-optimal designs and the group Lasso ⋮ Fisher-Pitman Permutation Tests Based on Nonparametric Poisson Mixtures with Application to Single Cell Genomics ⋮ On a class of algorithms from experimental design theory ⋮ Bayesian Quadrature, Energy Minimization, and Space-Filling Design ⋮ A delimitation of the support of optimal designs for Kiefer's \(\phi _p\)-class of criteria ⋮ A computational strategy for doubly smoothed MLE exemplified in the normal mixture model ⋮ Algorithmic construction of optimal designs on compact sets for concave and differentiable criteria ⋮ Some developments in the theory of shape constrained inference ⋮ Partially projected gradient algorithms for computing nonparametric maximum likelihood estimates of mixing distributions ⋮ A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments ⋮ Barycentric algorithm for computing D-optimal size- and cost-constrained designs of experiments ⋮ A gradient-based algorithm for semiparametric models with missing covariates ⋮ Measures minimizing regularized dispersion ⋮ D-optimal designs via a cocktail algorithm ⋮ Construction of constrained experimental designs on finite spaces for a modified \(\mathrm{E}_k\)-optimality criterion ⋮ Efficient computation of nonparametric survival functions via a hierarchical mixture formulation ⋮ Optimisation in space of measures and optimal design ⋮ A new algorithm for maximum likelihood estimation in normal scale-mixture generalized autoregressive conditional heteroskedastic models ⋮ A branch-and-bound algorithm for the exact optimal experimental design problem ⋮ Optimal design of multifactor experiments via grid exploration ⋮ On Optimal Designs for Nonlinear Models: A General and Efficient Algorithm
Cites Work
- The geometry of mixture likelihoods: A general theory
- Convergence of Simar's algorithm for finding the maximum likelihood estimate of a compound Poisson process
- Convergent design sequences, for sufficiently regular optimality criteria, II: Singular case
- Convergent design sequences, for sufficiently regular optimality criteria
- Some algorithmic aspects of the theory of optimal designs
- On the Sequential Construction of D-Optimal Designs
- The Sequential Generation of $D$-Optimum Experimental Designs
- Unnamed Item
This page was built for publication: A vertex-exchange-method in D-optimal design theory
