Geometry of E-optimality
In the linear model \(y= a^ T f(x)\) the problem of calculating approximate \(E\)-optimal designs is investigated. It is well-known that in dealing with this problem the multiplicity of the minimum eigenvalue of the information matrix plays a crucial role. By introducing the concept of a sequence of generalized Elfving sets, the authors try to overcome the difficulty of the occurrence of a multiple minimum eigenvalue with, in the opinion of the reviewer, partial success. The usefulness of the method is demontrated by providing a new proof for the case of weighing designs.
- A new interpretation of optimality for \(E\)-optimal designs in linear regression models
- Geometry of optimal value functions with applications to redundancy in linear programming
- Gustav Elfving's contribution to the emergence of the optimal experimental design theory.
- Adaptive grid semidefinite programming for finding optimal designs
- Optimal designs for regression with spherical data
- Removal of the points that do not support an E-optimal experimental design
- Elfving's theorem revisited
- Optimal designs for a class of nonlinear regression models
- The geometry of linear infeasibility
- Geometric minimization under external equivalence for implicit descriptions
- An alternative criterion useful for finding exact \(E\)-optimal designs
- Some explicit solutions of \(c\)-optimal design problems for polynomial regression with no intercept
- Constructing \(c\)-optimal designs for polynomial regression without an intercept
- Approximate \(E\)-optimal designs for the model of spring balance weighing with a constant bias
- Equivalence theorem for Schur optimality of experimental designs
- Local \(c\)- and \(E\)-optimal designs for exponential regression models
- OPTIMAL GEOMETRY IN EQUILIBRIUM AND GROWTH
- scientific article; zbMATH DE number 1296842 (Why is no real title available?)
- E-optimal designs for linear and nonlinear models with two parameters
- scientific article; zbMATH DE number 2019830 (Why is no real title available?)
- Algorithmic construction of optimal designs on compact sets for concave and differentiable criteria
- \(E\)-optimal designs for second-order response surface models
- scientific article; zbMATH DE number 7300558 (Why is no real title available?)
- DE- and EDP\(_M\)-compound optimality for the information and probability-based criteria
- Concentration sets, elfving sets and norms in optimum design
- Finding Bayesian Optimal Designs for Nonlinear Models: A Semidefinite Programming‐Based Approach
- Optimal dose‐finding for efficacy–safety models
- Computing optimal designs of multiresponse experiments reduces to second-order cone program\-ming
- Recent advances in scaling-down sampling methods in machine learning
- A new characterization of Elfving's method for high dimensional computation
- Elfving's theorem for D-optimality
- Weighted trigonometric regression for suboptimal designs in circadian transcriptome studies
- Elfving's method for \(m\)-dimensional models.
This page was built for publication: Geometry of \(E\)-optimality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2366748)
