Submodularity and randomized rounding techniques for optimal experimental design

DOI10.1016/J.ENDM.2010.05.086MaRDI QIDQ2883636zbMATH OpenOpenAlexFDO

Authors Mustapha Bouhtou, Stéphane Gaubert, Guillaume Sagnol

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

\(D\)-optimalitydiscrete optimizationKiefer's \(p\)-criterionoptimal design of experimentspolynomial-time approximability

Mathematics Subject Classification ID

Computer aspects of numerical algorithms (65Y99) Design techniques (robust design, computer-aided design, etc.) (93B51)

Recommendations

• Approximation of a maximum-submodular-coverage problem involving spectral functions, with application to experimental designs
• Approximation algorithms for \(D\)-optimal design
• Approximate positive correlated distributions and approximation algorithms for D-optimal design
• Near-optimal discrete optimization for experimental design: a regret minimization approach
• A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments

Cites work

• An analysis of approximations for maximizing submodular set functions—I
• D-optimal design of a monitoring network for parameter estimation of distributed systems
• scientific article; zbMATH DE number 800961 (Why is no real title available?)
• Improving updating rules in multiplicative algorithms for computing \(D\)-optimal designs
• Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
• Maximizing submodular set functions subject to multiple linear constraints
• On linear regression designs which maximize information
• Optimal design: Variation in structure and performance under change of criterion
• Pipage rounding: a new method of constructing algorithms with proven performance guarantee
• Sequences converging to D-optimal designs of experiments

Cited in

(15)

• Competitive online algorithms for resource allocation over the positive semidefinite cone
• Approximation of a maximum-submodular-coverage problem involving spectral functions, with application to experimental designs
• A branch-and-bound algorithm for the exact optimal experimental design problem
• Multidimensional sum-up rounding for integer programming in optimal experimental design
• Near-optimal discrete optimization for experimental design: a regret minimization approach
• Una caracterizacion de diseños de experimentos optimos por subgradientes
• Polynomial-Time Algorithms for Multiple-Arm Identification with Full-Bandit Feedback
• Approximation algorithms for \(D\)-optimal design
• Randomized Parallel Algorithm for Maximizing Nonsubmodular Function Subject to Cardinality Constraint
• Gaussian process landmarking on manifolds
• Parallelized maximization of nonsubmodular function subject to a cardinality constraint
• Parallelized maximization of nonsubmodular function subject to a cardinality constraint
• Computing optimal designs of multiresponse experiments reduces to second-order cone program\-ming
• Submodular maximization and its generalization through an intersection cut lens
• Ascent with quadratic assistance for the construction of exact experimental designs

Describes a project that uses

Uses Software

• NetQuest

This page was built for publication: Submodularity and randomized rounding techniques for optimal experimental design

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2883636)