Facebook Instagram Twitter RSS Feed PodBean Back to top on side

Network-related problems in optimal experimental design and second order cone programming

In: Tatra Mountains Mathematical Publications, vol. 51, no. 1
Guillaume Sagnol
Detaily:
Rok, strany: 2012, 161 - 171
Kľúčové slová:
optimal design, network monitoring, AR1 process, Second Order Cone Programming
O článku:
In the past few years several applications of optimal experimental designs have emerged to optimize the measurements in communication networks. The optimal design problems arising from this kind of applications share three interesting properties: (i) measurements are only available at a small number of locations of the network; (ii) each monitor can simultaneously measure several quantities, which can be modeled by ``multiresponse experiments"; (iii) the observation matrices depend on the topology of the network. We give an overview of these experimental design problems and recall recent results for the computation of optimal designs by Second Order Cone Programming (SOCP). New results for the network-monitoring of a discrete time process are presented. In particular, we show that the optimal design problem for the monitoring of an AR1 process can be reduced to the standard form and we give experimental results.
Ako citovať:
ISO 690:
Sagnol, G. 2012. Network-related problems in optimal experimental design and second order cone programming. In Tatra Mountains Mathematical Publications, vol. 51, no.1, pp. 161-171. 1210-3195.

APA:
Sagnol, G. (2012). Network-related problems in optimal experimental design and second order cone programming. Tatra Mountains Mathematical Publications, 51(1), 161-171. 1210-3195.