Sequences converging to D-optimal designs of experiments

From MaRDI portal
Revision as of 06:38, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2561455

DOI10.1214/AOS/1176342371zbMath0263.62047OpenAlexW2019120702MaRDI QIDQ2561455

Corwin L. Atwood

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 DesignRemarks on Communications in Statistics—Theory and Methods, Vol. 39, No. 15 (2010), pp. 2818–2828Exact optimal experimental designs with constraintsMinimum-volume ellipsoids containing compact sets: Application to parameter boundingOn Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoidsOptimal design for population pk/pd modelsA review of reliable maximum likelihood algorithms for semiparametric mixture modelsEfficient computational algorithm for optimal allocation in regression modelsComputing minimum-volume enclosing ellipsoidsSequential generation of D-optimal input designs for linear dynamic systemsOn a class of algorithms from experimental design theoryOn linear regression designs which maximize informationQualitative and quantitative experiment design for phenomenological models - a surveyAlgorithmic construction of optimal designs on compact sets for concave and differentiable criteriaOn the elimination of inessential points in the smallest enclosing ball problemCombined algorithm to compute D-optimal designsSome refinements on Fedorov's algorithms for constructing D-optimal designsA Randomized Exchange Algorithm for Computing Optimal Approximate Designs of ExperimentsA comparison of design alternatives for generalized linear modelsMonotonic convergence of a general algorithm for computing optimal designsA first-order algorithm for the A-optimal experimental design problem: a mathematical programming approachAn introduction to designh optimality with an overview of the literatureLinear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoidsSome extremal problems in designing discriminating experimentsDeep spatial Q-learning for infectious disease controlSome iterative procedures for generating nonsingular optimal designsOptimisation in space of measures and optimal designA branch-and-bound algorithm for the exact optimal experimental design problemOptimal design of multifactor experiments via grid explorationOptimal design with bounded density: Optimization algorithms of the exchange typeVariational Calculus in the Space of Measures and Optimal DesignUnnamed ItemA sparse control approach to optimal sensor placement in PDE-constrained parameter estimation problemsPerformance analysis of greedy algorithms for minimising a maximum mean discrepancyNumerical estimation of a probability measureInvited Discussion Paper Constrained Optimization of Experimental DesignFast algorithms for the minimum volume estimator







This page was built for publication: Sequences converging to D-optimal designs of experiments