Submodularity and Randomized rounding techniques for Optimal Experimental Design

DOI10.1016/j.endm.2010.05.086zbMath1237.93057MaRDI QIDQ2883636

Stéphane Gaubert, Guillaume Sagnol, Mustapha Bouhtou

Publication date: 13 May 2012

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2010.05.086

zbMATH Keywords

discrete optimization; \(D\)-optimality; optimal design of experiments; Kiefer's \(p\)-criterion; polynomial-time approximability

Mathematics Subject Classification ID

93B51: Design techniques (robust design, computer-aided design, etc.)

65Y99: Computer aspects of numerical algorithms

Related Items

Computing optimal designs of multiresponse experiments reduces to second-order cone program\-ming

Uses Software

• NetQuest

Cites Work

• Unnamed Item
• Unnamed Item
• Improving updating rules in multiplicative algorithms for computing \(D\)-optimal designs
• On linear regression designs which maximize information
• Pipage rounding: a new method of constructing algorithms with proven performance guarantee
• D-optimal design of a monitoring network for parameter estimation of distributed systems
• Sequences converging to D-optimal designs of experiments
• Optimal design: Variation in structure and performance under change of criterion
• An analysis of approximations for maximizing submodular set functions—I
• Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)