Computing maximin efficient experimental designs using the methods of semidefinite programming
From MaRDI portal
Publication:1936672
DOI10.1007/s00184-011-0348-6zbMath1362.62151MaRDI QIDQ1936672
Lenka Filová, Mária Trnovská, Radoslav Harman
Publication date: 6 February 2013
Published in: Metrika (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00184-011-0348-6
semidefinite programming; polynomial regression; optimal design; quadratic regression; \(E_k \)-optimality; maximin efficiency
Related Items
Computing exact \(D\)-optimal designs by mixed integer second-order cone programming, Adaptive grid semidefinite programming for finding optimal designs, Optimal design of experiments via linear programming, Criterion-Robust Experimental Designs for the Quadratic Regression on a Square and a Cube
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimal efficiency of designs under the class of orthogonally invariant information criteria
- Monotonic convergence of a general algorithm for computing optimal designs
- Admissible experimental designs in multiple polynomial regression
- Comparison of design for quadratic regression of cubes
- Applications of semidefinite programming
- Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices
- Maximin designs for exponential growth models and heteroscedastic polynomial models
- \(E\)-optimal designs for polynomial regression
- Approximate D-optimal designs of experiments on the convex hull of a finite set of information matrices
- On the Sum of the Largest Eigenvalues of a Symmetric Matrix
- Robust and Efficient Designs for the Michaelis–Menten Model
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Semidefinite Programming
- Applications of necessary and sufficient conditions for maximin efficient designs
