Some algorithmic aspects of the theory of optimal designs
From MaRDI portal
Publication:1251879
DOI10.1214/aos/1176344374zbMath0392.62058OpenAlexW2087026810MaRDI QIDQ1251879
Publication date: 1978
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aos/1176344374
Algorithmic AspectsApproximate Optimal Design ProblemAsymptotic ConvergenceConstrained Convex Programming ProblemImplementability ProblemInfinite Support Case
Related Items
A three-parameter logistic regression model, Optimal Design of Experiments for Implicit Models, A vertex-exchange-method in D-optimal design theory, Minimax linear regression estimation with symmetric parameter restrictions, Nonparametric estimation of the mixing distribution in logistic regression mixed models with random intercepts and slopes, Algorithms for approximate linear regression design with application to a first order model with heteroscedasticity, Semiparametric maximum likelihood estimation of stochastic frontier model with errors-in-variables, Minimum-volume ellipsoids containing compact sets: Application to parameter bounding, Quasi-Newton algorithm for optimal approximate linear regression design: optimization in matrix space, A review of reliable maximum likelihood algorithms for semiparametric mixture models, Semiparametric mixture: continuous scale mixture approach, Multiplicative methods for computing \(D\)-optimal stratified designs of experiments, Risk-Adapted Optimal Experimental Design, Fisher-Pitman Permutation Tests Based on Nonparametric Poisson Mixtures with Application to Single Cell Genomics, On a class of algorithms from experimental design theory, The constrained Fisher scoring method for maximum likelihood computation of a nonparametric mixing distribution, Adaptive grid semidefinite programming for finding optimal designs, A delimitation of the support of optimal designs for Kiefer's \(\phi _p\)-class of criteria, 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, Partially projected gradient algorithms for computing nonparametric maximum likelihood estimates of mixing distributions, A gradient-based algorithm for semiparametric models with missing covariates, Constrained estimation and likelihood intervals for censored data, D-optimal designs via a cocktail algorithm, Efficient Greedy Learning of Gaussian Mixture Models, 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, Tutorial on methods for interval-censored data and their implementation in R, Optimisation in space of measures and optimal design, Construction of marginally and conditionally restricted designs using multiplicative algorithms, Optimal design of multifactor experiments via grid exploration, Variational Calculus in the Space of Measures and Optimal Design, Linear convergence of accelerated conditional gradient algorithms in spaces of measures, Numerical techniques for estimating probabilities, Constrained nonparametric maximum-likelihood estimation for mixture models
