Computing \(c\)-optimal experimental designs using the simplex method of linear programming

DOI10.1016/J.CSDA.2008.06.023zbMath1231.62142OpenAlexW1996550144MaRDI QIDQ961110

Radoslav Harman, Tomáš Jurík

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

Mathematics Subject Classification ID

Optimal statistical designs (62K05) Linear programming (90C05)

Related Items (17)

Optimal Design of Experiments for Implicit Models ⋮ Removing inessential points in \(c\)-and \(A\)-optimal design ⋮ Optimal design of experiments via linear programming ⋮ On computational complexity of construction of c -optimal linear regression models over finite experimental domains ⋮ Computation of \(c\)-optimal designs for models with correlated observations ⋮ An algorithm based on semidefinite programming for finding minimax optimal designs ⋮ Optimal prediction designs in finite discrete spectrum linear regression models ⋮ Computing exact \(D\)-optimal designs by mixed integer second-order cone programming ⋮ Computing optimal designs of multiresponse experiments reduces to second-order cone program\-ming ⋮ Two complexity results on \(c\)-optimality in experimental design ⋮ Adaptive grid semidefinite programming for finding optimal designs ⋮ Evaluation of Combinatorial Optimisation Algorithms for c-Optimal Experimental Designs with Correlated Observations ⋮ A semidefinite programming study of the Elfving theorem ⋮ Optimal exact designs of experiments via mixed integer nonlinear programming ⋮ Optimal experimental design for linear time invariant state-space models ⋮ Optimal design of multifactor experiments via grid exploration ⋮ Design of c-optimal experiments for high-dimensional linear models

Uses Software

• LPbook

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

This page was built for publication: Computing \(c\)-optimal experimental designs using the simplex method of linear programming