Computing optimal designs of multiresponse experiments reduces to second-order cone programming

When the goal is to identify a small number of linear functions of the unknown parameter (typically for c-optimality), we show by numerical examples that the present approach can be between 10 and 1000 times faster than the classic, state-of-the-art algorithms.