Some iterative procedures for generating nonsingular optimal designs

DOI10.1080/03610927808827721zbMath0399.62076OpenAlexW2063086118MaRDI QIDQ4184123

C. F. Jeff Wu

Publication date: 1978

Published in: Communications in Statistics - Theory and Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03610927808827721

zbMATH Keywords

Optimal Design AlgorithmsGradient Projection MethodIterative ProceduresGeneral Equivalence TheoremNonsingular Optimal DesignsVertex Direction Method

Mathematics Subject Classification ID

Optimal statistical designs (62K05) Probabilistic methods, stochastic differential equations (65C99)

Related Items (21)

Moment inequalities via optimal design theory ⋮ Nonparametric estimation of the mixing distribution in logistic regression mixed models with random intercepts and slopes ⋮ A review of reliable maximum likelihood algorithms for semiparametric mixture models ⋮ A class of optimization problems on minimizing variance based criteria in respect of parameter estimators of a linear model ⋮ Efficient computational algorithm for optimal allocation in regression models ⋮ Nonparametric estimation of convex models via mixtures ⋮ 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 ⋮ Optimum experimental design for a regression on a hypercube- generalization of Hoel's result ⋮ Algorithmic construction of optimal designs on compact sets for concave and differentiable criteria ⋮ Partially projected gradient algorithms for computing nonparametric maximum likelihood estimates of mixing distributions ⋮ Multiplicative algorithms for computing optimum designs ⋮ Two classes of multiplicative algorithms for constructing optimizing distributions ⋮ Optimisation in space of measures and optimal design ⋮ Optimal design of multifactor experiments via grid exploration ⋮ Variational Calculus in the Space of Measures and Optimal Design ⋮ Construction of Constrained Optimal Designs ⋮ Linear convergence of accelerated conditional gradient algorithms in spaces of measures ⋮ Numerical estimation of a probability measure ⋮ Improving Convergence Rates of a Class of Algorithms

Cites Work

• General equivalence theory for optimum designs (approximate theory)
• Convergent design sequences, for sufficiently regular optimality criteria
• Sequences converging to D-optimal designs of experiments
• Optimal input signals for parameter estimation in dynamic systems--Survey and new results
• D-Optimality for Regression Designs: A Review
• Optimal design: Variation in structure and performance under change of criterion
• The Sequential Generation of $D$-Optimum Experimental Designs

This page was built for publication: Some iterative procedures for generating nonsingular optimal designs