An algorithm for optimal designs on a design space
From MaRDI portal
Publication:4171464
DOI10.1080/03610927808827719zbMath0389.62061OpenAlexW1997859086MaRDI QIDQ4171464
No author found.
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/03610927808827719
Related Items
Moment inequalities via optimal design theory, A Maximin Φp-Efficient Design for Multivariate Generalized Linear Models, Computing minimum-volume enclosing ellipsoids for large datasets, Most likely maximum entropy for population analysis with region-censored data, Minimum-volume ellipsoids containing compact sets: Application to parameter bounding, Algorithms for the construction of optimizing distributions, Quasi-Newton algorithm for optimal approximate linear regression design: optimization in matrix space, A review of reliable maximum likelihood algorithms for semiparametric mixture models, An overview of design of experiments, 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, Multiplicative methods for computing \(D\)-optimal stratified designs of experiments, Computing exact \(D\)-optimal designs by mixed integer second-order cone programming, An efficient algorithm for Elastic I‐optimal design of generalized linear models, Optimal time plan in accelerated degradation testing, An unexpected connection between Bayes \(A\)-optimal designs and the group Lasso, On a class of algorithms from experimental design theory, I-robust and D-robust designs on a finite design space, A delimitation of the support of optimal designs for Kiefer's \(\phi _p\)-class of criteria, Optimal experimental design and some related control problems, Efficient computational algorithm for optimal continuous experimental designs, Removing non-optimal support points in \(D\)-optimum design algorithms., Strict monotonicity and convergence rate of Titterington's algorithm for computing D-optimal designs, Algorithmic construction of optimal designs on compact sets for concave and differentiable criteria, Combined algorithm to compute D-optimal designs, D-optimal design of a monitoring network for parameter estimation of distributed systems, Some refinements on Fedorov's algorithms for constructing D-optimal designs, Nonparametric EM algorithms for estimating prior distributions, A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments, D-optimal designs based on the second-order least squares estimator, Barycentric algorithm for computing D-optimal size- and cost-constrained designs of experiments, Improving updating rules in multiplicative algorithms for computing \(D\)-optimal designs, Using SeDuMi to find various optimal designs for regression models, An Optimal Scanning Sensor Activation Policy for Parameter Estimation of Distributed Systems, Monotonic convergence of a general algorithm for computing optimal designs, Convergence of a fixed point algorithm, Constructing optimal designs with constraints, D-optimal designs via a cocktail algorithm, Construction of constrained experimental designs on finite spaces for a modified \(\mathrm{E}_k\)-optimality criterion, Distributed scheduling of measurements in a sensor network for parameter estimation of spatio-temporal systems, Multiplicative algorithms for computing optimum designs, An introduction to designh optimality with an overview of the literature, Two classes of multiplicative algorithms for constructing optimizing distributions, Efficient computational algorithms for approximate optimal designs, Optimal design of multifactor experiments via grid exploration, Construction of Constrained Optimal Designs, Optimal sensor placement for joint parameter and state estimation problems in large-scale dynamical systems with applications to thermo-mechanics, Efficiency of the coordinate-exchange algorithm in constructing exact optimal discrete choice experiments, On Optimal Designs for Nonlinear Models: A General and Efficient Algorithm, Construction of optimal designs using a clustering approach, Optimal designs for semi-parametric dose-response models under random contamination, Numerical estimation of a probability measure, Improving Convergence Rates of a Class of Algorithms, Fast algorithms for the minimum volume estimator
Cites Work
- Convergent design sequences, for sufficiently regular optimality criteria
- The Analysis of Contingency Tables with Incompletely Classified Data
- An inequality with applications to statistical estimation for probabilistic functions of Markov processes and to a model for ecology
- The Sequential Generation of $D$-Optimum Experimental Designs
