Sequences converging to D-optimal designs of experiments
From MaRDI portal
Publication:2561455
DOI10.1214/AOS/1176342371zbMath0263.62047OpenAlexW2019120702MaRDI QIDQ2561455
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
Related Items (37)
Submodularity and Randomized rounding techniques for Optimal Experimental Design ⋮ Remarks on Communications in Statistics—Theory and Methods, Vol. 39, No. 15 (2010), pp. 2818–2828 ⋮ Exact optimal experimental designs with constraints ⋮ Minimum-volume ellipsoids containing compact sets: Application to parameter bounding ⋮ On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids ⋮ Optimal design for population pk/pd models ⋮ A review of reliable maximum likelihood algorithms for semiparametric mixture models ⋮ Efficient computational algorithm for optimal allocation in regression models ⋮ Computing minimum-volume enclosing ellipsoids ⋮ Sequential generation of D-optimal input designs for linear dynamic systems ⋮ On a class of algorithms from experimental design theory ⋮ On linear regression designs which maximize information ⋮ Qualitative and quantitative experiment design for phenomenological models - a survey ⋮ Algorithmic construction of optimal designs on compact sets for concave and differentiable criteria ⋮ On the elimination of inessential points in the smallest enclosing ball problem ⋮ 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 ⋮ A comparison of design alternatives for generalized linear models ⋮ Monotonic convergence of a general algorithm for computing optimal designs ⋮ A first-order algorithm for the A-optimal experimental design problem: a mathematical programming approach ⋮ An introduction to designh optimality with an overview of the literature ⋮ Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids ⋮ Some extremal problems in designing discriminating experiments ⋮ Deep spatial Q-learning for infectious disease control ⋮ Some iterative procedures for generating nonsingular optimal designs ⋮ Optimisation in space of measures and optimal design ⋮ A branch-and-bound algorithm for the exact optimal experimental design problem ⋮ Optimal design of multifactor experiments via grid exploration ⋮ Optimal design with bounded density: Optimization algorithms of the exchange type ⋮ Variational Calculus in the Space of Measures and Optimal Design ⋮ Unnamed Item ⋮ A sparse control approach to optimal sensor placement in PDE-constrained parameter estimation problems ⋮ Performance analysis of greedy algorithms for minimising a maximum mean discrepancy ⋮ Numerical estimation of a probability measure ⋮ Invited Discussion Paper Constrained Optimization of Experimental Design ⋮ Fast algorithms for the minimum volume estimator
This page was built for publication: Sequences converging to D-optimal designs of experiments