On a class of algorithms from experimental design theory
From MaRDI portal
Recommendations
Cites work
- A remark on the numerical estimation of probabilities
- A vertex-exchange-method in D-optimal design theory
- An algorithm for optimal designs on a design space
- Approximate minimax estimation in linear regression: theoretical results
- Bayes, Admissible, and Minimax Linear Estimators in Linear Models with Restricted Parameter Space
- Convergent design sequences, for sufficiently regular optimality criteria
- Convergent design sequences, for sufficiently regular optimality criteria, II: Singular case
- Convex Analysis
- Directional derivatives of optimality criteria at singular matrices in convex design theory
- scientific article; zbMATH DE number 4133347 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- Minimax linear regression estimation with symmetric parameter restrictions
- Minimizing pseudoconvex functions on convex compact sets
- Numerical estimation of a probability measure
- Numerical techniques for estimating probabilities
- On linear regression designs which maximize information
- Optimal and Efficient Designs of Experiments
- Sequences converging to D-optimal designs of experiments
- Some algorithmic aspects of the theory of optimal designs
- Some iterative procedures for generating nonsingular optimal designs
- The covergence of general step-length algorithms for regular optimum design criteria
- The Sequential Generation of D-Optimum Experimental Designs
Cited in
(27)- D-optimal design methods for robust estimation of multivariate location and scatter
- Designing algorithms by expectations
- Algorithms for approximate linear regression design with application to a first order model with heteroscedasticity
- Quasi-Newton algorithm for optimal approximate linear regression design: optimization in matrix space
- An algorithmic framework for generating optimal two-stratum experimental designs
- Optimal and robust invariant designs for cubic multiple regression
- Computing \(E\)-optimal polynomial regression designs.
- Component-wise dimension reduction
- Algorithms for optimal design with application to multiple polynomial regression
- Computing optimal approximate invariant designs for cubic regression on multidimensional balls and cubes
- An overview of design of experiments
- Polars and subgradients of mixtures of information functions
- Construction of optimal designs using a clustering approach
- Limits to measurement in experiments governed by algorithms
- Tuning an Algorithm Using Design of Experiments
- A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments
- Optimal experimental design and quadratic optimization
- scientific article; zbMATH DE number 3907608 (Why is no real title available?)
- scientific article; zbMATH DE number 3963019 (Why is no real title available?)
- scientific article; zbMATH DE number 3970557 (Why is no real title available?)
- Optimal design of multi-response experiments using semi-definite programming
- scientific article; zbMATH DE number 1052818 (Why is no real title available?)
- Optimisation in space of measures and optimal design
- scientific article; zbMATH DE number 1747140 (Why is no real title available?)
- Second order methods for solving extremum problems form optimal linar regression design
- scientific article; zbMATH DE number 4187461 (Why is no real title available?)
- How experimental algorithmics can benefit from Mayo's extensions to Neyman-Pearson theory of testing
This page was built for publication: On a class of algorithms from experimental design theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4327907)
