Multidimensional sum-up rounding for integer programming in optimal experimental design
From MaRDI portal
Recommendations
- Submodularity and randomized rounding techniques for optimal experimental design
- Construction of constrained experimental designs on finite spaces for a modified \(\mathrm{E}_k\)-optimality criterion
- Approximation algorithms for \(D\)-optimal design
- Publication:3485761
- Computing exact \(D\)-optimal designs by mixed integer second-order cone programming
Cites work
- A Fast and Scalable Method for A-Optimal Design of Experiments for Infinite-dimensional Bayesian Nonlinear Inverse Problems
- A feasibility pump for mixed integer nonlinear programs
- A spectral element method for fluid dynamics: Laminar flow in a channel expansion
- A-optimal design of experiments for infinite-dimensional Bayesian linear inverse problems with regularized _0-sparsification
- Adaptive and quality quadrilateral/hexahedral meshing from volumetric data
- Algorithmic complexity: threeNP- hard problems in computational statistics
- An introduction to the mathematical theory of inverse problems
- Computational methods for applied inverse problems. Selected papers based on the presentations at the international workshop, Beijing, China, July 12--16, 2010.
- Distributed sensor networks. Volume 1: Image and sensor signal processing. Volume 2: Sensor networking and applications.
- Faces for a linear inequality in 0–1 variables
- Facet of regular 0–1 polytopes
- scientific article; zbMATH DE number 3119545 (Why is no real title available?)
- scientific article; zbMATH DE number 47926 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 936298 (Why is no real title available?)
- Multigrid preconditioning of linear systems for semi-smooth Newton methods applied to optimization problems constrained by smoothing operators
- Octane: A New Heuristic for Pure 0–1 Programs
- Optimal Design of Experiments
- RENS. The optimal rounding
- Rounding-based heuristics for nonconvex MINLPS
- Sampling decisions in optimum experimental design in the light of Pontryagin's maximum principle
- Statistical and computational inverse problems.
- Statistics for spatio-temporal data
- The elements of statistical learning. Data mining, inference, and prediction
- The integer approximation error in mixed-integer optimal control
- The Numerical Solution of Integral Equations of the Second Kind
- The theory of the design of experiments
- Theoretical Numerical Analysis
Cited in
(9)- Compactness and convergence rates in the combinatorial integral approximation decomposition
- Inversion of convection-diffusion equation with discrete sources
- Multidimensional sum-up rounding for elliptic control systems
- Relaxed multibang regularization for the combinatorial integral approximation
- Bounds and convex heuristics for bi-objective optimal experiment design in water networks
- On convergence of binary trust-region steepest descent
- Exploring the impact of post-training rounding in regression models.
- Domain decomposition for integer optimal control with total variation regularization
- Global optimality conditions for sensor placement, with extensions to binary low-rank A-optimal designs
This page was built for publication: Multidimensional sum-up rounding for integer programming in optimal experimental design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2220654)
