The covergence of general step-length algorithms for regular optimum design criteria

From MaRDI portal
Publication:1253515

DOI10.1214/aos/1176344373zbMath0396.62059OpenAlexW2005210444WikidataQ61856032 ScholiaQ61856032MaRDI QIDQ1253515

Henry P. Wynn, C. F. Jeff Wu

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/1176344373




Related Items

Optimal Design of Experiments for Implicit ModelsMinimax linear regression estimation with symmetric parameter restrictionsAn overview of design of experimentsRisk-Adapted Optimal Experimental DesignOn a class of algorithms from experimental design theoryInequalities in Statistics and Information MeasuresAdaptive grid semidefinite programming for finding optimal designsOptimum experimental design for a regression on a hypercube- generalization of Hoel's resultFully-sequential procedures in nonlinear design problemsQualitative and quantitative experiment design for phenomenological models - a surveyUnnamed ItemAsymptotic Statistical Results: Theory and PracticeOn the Computational Methods in Non-linear Design of ExperimentsOptimal experimental designs when an independent variable is potentially censoredA new monotonic algorithm for the \(E\)-optimal experiment design problemSequential experimental design and response optimisationMonotonic convergence of a general algorithm for computing optimal designsOn the sequential construction of optimum bounded designsMultiplicative algorithms for computing optimum designsThe adaptive Wynn algorithm in generalized linear models with univariate responseOptimisation in space of measures and optimal designOptimal design with bounded density: Optimization algorithms of the exchange typeVariational Calculus in the Space of Measures and Optimal DesignAdaptive optimization and \(D\)-optimum experimental design.Invited Discussion Paper Constrained Optimization of Experimental Design




This page was built for publication: The covergence of general step-length algorithms for regular optimum design criteria