Algorithms for optimal design with application to multiple polynomial regression
Publication:1902155
DOI10.1007/BF01894298zbMath0833.62071MaRDI QIDQ1902155
Norbert Gaffke, Berthold Heiligers
Publication date: 24 March 1996
Published in: Metrika (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/176574
algorithminvariance structuressecond order methodsoptimal approximate designsconvex extremum problemsefficient exact designsimproved gradient methodsmultifactor cubic modeloptimal linear regression designsteepest descent type algorithmssymmetric multiple polynomial models
Linear regression; mixed models (62J05) Optimal statistical designs (62K05) Numerical mathematical programming methods (65K05) Probabilistic methods, stochastic differential equations (65C99)
Related Items (6)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimizing pseudoconvex functions on convex compact sets
- Invariant admissible and optimal designs in cubic regression on the \(\nu\)-ball
- A new approach to the construction of optimal designs
- Optimal and robust invariant designs for cubic multiple regression
- Computing optimal approximate invariant designs for cubic regression on multidimensional balls and cubes
- Optimal design: Variation in structure and performance under change of criterion
- On a class of algorithms from experimental design theory
- Second order methods for solving extremum problems form optimal linar regression design
- Minimax Designs in Two Dimensional Regression
- Convex Analysis
- The Sequential Generation of $D$-Optimum Experimental Designs
This page was built for publication: Algorithms for optimal design with application to multiple polynomial regression