On computational complexity of construction of c -optimal linear regression models over finite experimental domains
2012 ◽
Vol 51
(1)
◽
pp. 11-21
Keyword(s):
ABSTRACT Recent complexity-theoretic results on finding c-optimal designs over finite experimental domain X are discussed and their implications for the analysis of existing algorithms and for the construction of new algorithms are shown. Assuming some complexity-theoretic conjectures, we show that the approximate version of c-optimality does not have an efficient parallel implementation. Further, we study the question whether for finding the c-optimal designs over finite experimental domain X there exist a strongly polynomial algorithms and show relations between considered design problem and linear programming. Finally, we point out some complexity-theoretic properties of the SAC algorithm for c-optimality.
1991 ◽
Vol 19
(4)
◽
pp. 2183-2208
◽
Keyword(s):
Keyword(s):
2015 ◽
Vol 167
◽
pp. 135-143
◽
2016 ◽
Vol 31
(3)
◽
pp. 360-378
◽
1996 ◽
Vol 46
(3-4)
◽
pp. 211-230
◽
Keyword(s):