Computing \(c\)-optimal experimental designs using the simplex method of linear programming
From MaRDI portal
Publication:961110
DOI10.1016/j.csda.2008.06.023zbMath1231.62142MaRDI QIDQ961110
Publication date: 30 March 2010
Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.csda.2008.06.023
Related Items
Two complexity results on \(c\)-optimality in experimental design, A semidefinite programming study of the Elfving theorem, Optimal prediction designs in finite discrete spectrum linear regression models, Computing optimal designs of multiresponse experiments reduces to second-order cone program\-ming, On computational complexity of construction of c -optimal linear regression models over finite experimental domains
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal weights for experimental designs on linearly independent support points
- Elfving's method for \(m\)-dimensional models.
- Remez's procedure for finding optimal designs
- Optimal designs for estimating individual coefficients in Fourier regression models
- A geometric method for singular c-optimal designs
- \(D\)-optimal designs for trigonometric regression models on a partial circle
- Optimal designs for estimating the coefficients of the lower frequencies in trigonometric regression models
- An Optimal Design Problem in Rhythmometry
- The Average number of pivot steps required by the Simplex-Method is polynomial
- Linear Programming
- Determinant Maximization with Linear Matrix Inequality Constraints
- Optimum Allocation in Linear Regression Theory
- Combinatorial optimization. Theory and algorithms.
- Linear programming. Foundations and extensions
