Sequences converging to D-optimal designs of experiments
From MaRDI portal
Publication:2561455
DOI10.1214/AOS/1176342371zbMATH Open0263.62047OpenAlexW2019120702MaRDI QIDQ2561455FDOQ2561455
Publication date: 1973
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aos/1176342371
Cited In (37)
- Remarks on Communications in Statistics—Theory and Methods, Vol. 39, No. 15 (2010), pp. 2818–2828
- Numerical estimation of a probability measure
- Performance analysis of greedy algorithms for minimising a maximum mean discrepancy
- A comparison of design alternatives for generalized linear models
- A sparse control approach to optimal sensor placement in PDE-constrained parameter estimation problems
- Submodularity and randomized rounding techniques for optimal experimental design
- Optimal design with bounded density: Optimization algorithms of the exchange type
- Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids
- An introduction to designh optimality with an overview of the literature
- Title not available (Why is that?)
- Sequential generation of D-optimal input designs for linear dynamic systems
- A review of reliable maximum likelihood algorithms for semiparametric mixture models
- Variational Calculus in the Space of Measures and Optimal Design
- Computing minimum-volume enclosing ellipsoids
- On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
- Optimisation in space of measures and optimal design
- Algorithmic construction of optimal designs on compact sets for concave and differentiable criteria
- Optimal design for population PK/PD models
- A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments
- Minimum-volume ellipsoids containing compact sets: Application to parameter bounding
- Fast algorithms for the minimum volume estimator
- Combined algorithm to compute D-optimal designs
- Qualitative and quantitative experiment design for phenomenological models - a survey
- Some refinements on Fedorov's algorithms for constructing D-optimal designs
- 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
- On a class of algorithms from experimental design theory
- Deep spatial Q-learning for infectious disease control
- Some iterative procedures for generating nonsingular optimal designs
- On the elimination of inessential points in the smallest enclosing ball problem
- Exact optimal experimental designs with constraints
- Invited Discussion Paper Constrained Optimization of Experimental Design
- On linear regression designs which maximize information
- Some extremal problems in designing discriminating experiments
- Monotonic convergence of a general algorithm for computing optimal designs
- Efficient computational algorithm for optimal allocation in regression models
This page was built for publication: Sequences converging to D-optimal designs of experiments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2561455)