An algorithm for optimal designs on a design space

DOI10.1080/03610927808827719zbMATH Open0389.62061OpenAlexW1997859086MaRDI QIDQ4171464FDOQ4171464

Authors:

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

Mathematics Subject Classification ID

Optimal statistical designs (62K05)

Cites Work

• Convergent design sequences, for sufficiently regular optimality criteria
• The Sequential Generation of $D$-Optimum Experimental Designs
• An inequality with applications to statistical estimation for probabilistic functions of Markov processes and to a model for ecology
• The Analysis of Contingency Tables with Incompletely Classified Data

Cited In (56)

• ForLion: a new algorithm for D-optimal designs under general parametric statistical models with mixed factors
• A Maximin Φp-Efficient Design for Multivariate Generalized Linear Models
• Optimal design of stress levels in accelerated degradation testing for multivariate linear degradation models
• A class of optimization problems on minimizing variance based criteria in respect of parameter estimators of a linear model
• Optimal experimental design and some related control problems
• Multiplicative methods for computing \(D\)-optimal stratified designs of experiments
• Efficiency of the coordinate-exchange algorithm in constructing exact optimal discrete choice experiments
• On optimal designs for nonlinear models: a general and efficient algorithm
• Numerical estimation of a probability measure
• Optimal sensor placement for joint parameter and state estimation problems in large-scale dynamical systems with applications to thermo-mechanics
• Multiplicative algorithms for computing optimum designs
• Constructing optimal designs with constraints
• Two classes of multiplicative algorithms for constructing optimizing distributions
• Algorithms for the construction of optimizing distributions
• Computing exact \(D\)-optimal designs by mixed integer second-order cone programming
• Using SeDuMi to find various optimal designs for regression models
• Strict monotonicity and convergence rate of Titterington's algorithm for computing D-optimal designs
• I-robust and D-robust designs on a finite design space
• Construction of optimal designs using a clustering approach
• Computing minimum-volume enclosing ellipsoids for large datasets
• Most likely maximum entropy for population analysis with region-censored data
• Optimal designs for semi-parametric dose-response models under random contamination
• Construction of constrained experimental designs on finite spaces for a modified \(\mathrm{E}_k\)-optimality criterion
• An introduction to designh optimality with an overview of the literature
• 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 Optimal Scanning Sensor Activation Policy for Parameter Estimation of Distributed Systems
• An unexpected connection between Bayes \(A\)-optimal designs and the group Lasso
• A delimitation of the support of optimal designs for Kiefer's \(\phi _p\)-class of criteria
• An efficient algorithm for Elastic I‐optimal design of generalized linear models
• D-optimal design of a monitoring network for parameter estimation of distributed systems
• Algorithmic construction of optimal designs on compact sets for concave and differentiable criteria
• An overview of design of experiments
• Nonparametric EM algorithms for estimating prior distributions
• Efficient computational algorithms for approximate optimal designs
• A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments
• Minimum-volume ellipsoids containing compact sets: Application to parameter bounding
• Distributed scheduling of measurements in a sensor network for parameter estimation of spatio-temporal systems
• Fast algorithms for the minimum volume estimator
• Combined algorithm to compute D-optimal designs
• Improving Convergence Rates of a Class of Algorithms
• Some refinements on Fedorov's algorithms for constructing D-optimal designs
• Optimal design of multifactor experiments via grid exploration
• D-optimal designs via a cocktail algorithm
• On a class of algorithms from experimental design theory
• Removing non-optimal support points in \(D\)-optimum design algorithms.
• Improving updating rules in multiplicative algorithms for computing \(D\)-optimal designs
• Monotonic convergence of a general algorithm for computing optimal designs
• Optimal time plan in accelerated degradation testing
• Construction of constrained optimal designs
• Efficient computational algorithm for optimal continuous experimental designs
• D-optimal designs based on the second-order least squares estimator
• Barycentric algorithm for computing D-optimal size- and cost-constrained designs of experiments
• Moment inequalities via optimal design theory
• Convergence of a fixed point algorithm
• Efficient computational algorithm for optimal allocation in regression models

This page was built for publication: An algorithm for optimal designs on a design space

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4171464)