On a class of algorithms from experimental design theory
From MaRDI portal
Publication:4327907
DOI10.1080/02331939208843782zbMath0817.90075OpenAlexW2082108339MaRDI QIDQ4327907
Publication date: 4 August 1996
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331939208843782
Related Items (14)
Component-wise dimension reduction ⋮ Algorithms for approximate linear regression design with application to a first order model with heteroscedasticity ⋮ Polars and subgradients of mixtures of information functions ⋮ Quasi-Newton algorithm for optimal approximate linear regression design: optimization in matrix space ⋮ 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 ⋮ Optimal design of multi-response experiments using semi-definite programming ⋮ Second order methods for solving extremum problems form optimal linar regression design ⋮ Optimal and robust invariant designs for cubic multiple regression ⋮ Optimisation in space of measures and optimal design ⋮ Computing \(E\)-optimal polynomial regression designs. ⋮ D-optimal design methods for robust estimation of multivariate location and scatter ⋮ Construction of optimal designs using a clustering approach
Cites Work
- Unnamed Item
- Unnamed Item
- Numerical estimation of a probability measure
- A vertex-exchange-method in D-optimal design theory
- Minimax linear regression estimation with symmetric parameter restrictions
- Minimizing pseudoconvex functions on convex compact sets
- Convergent design sequences, for sufficiently regular optimality criteria, II: Singular case
- On linear regression designs which maximize information
- Convergent design sequences, for sufficiently regular optimality criteria
- Some algorithmic aspects of the theory of optimal designs
- The covergence of general step-length algorithms for regular optimum design criteria
- Sequences converging to D-optimal designs of experiments
- Directional derivatives of optimality criteria at singular matrices in convex design theory
- A remark on the numerical estimation of probabilities
- Approximate minimax estimation in linear regression: theoretical results
- Numerical techniques for estimating probabilities
- An algorithm for optimal designs on a design space
- Some iterative procedures for generating nonsingular optimal designs
- Bayes, Admissible, and Minimax Linear Estimators in Linear Models with Restricted Parameter Space
- Optimal and Efficient Designs of Experiments
- Convex Analysis
- The Sequential Generation of $D$-Optimum Experimental Designs
This page was built for publication: On a class of algorithms from experimental design theory
