Network-related problems in optimal experimental design and second order cone programming (Q2913230)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Network-related problems in optimal experimental design and second order cone programming |
scientific article; zbMATH DE number 6086805
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Network-related problems in optimal experimental design and second order cone programming |
scientific article; zbMATH DE number 6086805 |
Statements
Network-related problems in optimal experimental design and second order cone programming (English)
0 references
26 September 2012
0 references
optimal design
0 references
network monitoring
0 references
AR(1) process
0 references
second-order cone programming
0 references
0 references
0 references
0.89020836
0 references
0.88797927
0 references
0.8780292
0 references
0.8730806
0 references
0.8696129
0 references
The paper presents the application of a cone programming approach to the generation of optimal designs in the context of network measuring. An optimal design in this setting consists of the best allocation of experimental effort over of edges in a network. The approach to optimality is solved through second-order cone programming and shown to work in two examples, one with networks taken from topology-zoo.org and another of an observation model of motorways in Germany where an autoregressive process was added to describe the behaviour of observations in discrete time.
0 references
