On computational complexity of construction of c -optimal linear regression models over finite experimental domains

DOI10.2478/v10127-012-0002-3zbMath1313.62109OpenAlexW2003793012MaRDI QIDQ2913226

Michal Černý, Jaromír Antoch, Milan Hladík

Publication date: 26 September 2012

Published in: Tatra Mountains Mathematical Publications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/v10127-012-0002-3

zbMATH Keywords

linear programmingparallel computationoptimal designP-completeness\(c\)-optimalitySAC algorithm

Mathematics Subject Classification ID

Linear regression; mixed models (62J05) Optimal statistical designs (62K05) Analysis of algorithms and problem complexity (68Q25) Applications of mathematical programming (90C90)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing \(c\)-optimal experimental designs using the simplex method of linear programming
• Computational Complexity
• Systems of distinct representatives and linear algebra
• Linear Statistical Inference and its Applications
• Interior Point Methods for Linear Optimization

This page was built for publication: On computational complexity of construction of c -optimal linear regression models over finite experimental domains