Generalized maximum-entropy sampling
From MaRDI portal
Recommendations
- Efficient solution of maximum-entropy sampling problems
- On Computing with Some Convex Relaxations for the Maximum-Entropy Sampling Problem
- Continuous relaxations for Constrained Maximum-Entropy Sampling
- An Exact Algorithm for Maximum Entropy Sampling
- Maximum-entropy sampling and the Boolean quadric polytope
Cites work
- A linear integer programming bound for maximum-entropy sampling
- Algorithmic complexity: threeNP- hard problems in computational statistics
- An Exact Algorithm for Maximum Entropy Sampling
- Branch-and-Bound Search for Experimental Designs Based on D Optimality and Other Criteria
- Comparison of two approaches in the optimal design of an observation network
- Constrained maximum-entropy sampling
- Continuous relaxations for Constrained Maximum-Entropy Sampling
- Derivatives and Perturbations of Eigenvectors
- scientific article; zbMATH DE number 194139 (Why is no real title available?)
- scientific article; zbMATH DE number 1301934 (Why is no real title available?)
- Matrix Analysis
- Maximum-entropy remote sampling
- On analyticity of functions involving eigenvalues
- Solving maximum-entropy sampling problems using factored masks
- Techniques for submodular maximization
- Using continuous nonlinear relaxations to solve constrained maximum-entropy sampling problems
Cited in
(12)- Mixing convex-optimization bounds for maximum-entropy sampling
- scientific article; zbMATH DE number 5967671 (Why is no real title available?)
- Large sample properties of maximum entropy histograms
- Continuous relaxations for Constrained Maximum-Entropy Sampling
- Optimal Sampling for Generalized Linear Models Under Measurement Constraints
- Maximum Conditional Entropy Hamiltonian Monte Carlo Sampler
- An outer-approximation algorithm for maximum-entropy sampling
- An outer-approximation algorithm for maximum-entropy sampling
- On Computing with Some Convex Relaxations for the Maximum-Entropy Sampling Problem
- Mixed-integer nonlinear optimization: a hatchery for modern mathematics. Abstracts from the workshop held August 13--18, 2023
- Convex relaxation for the generalized maximum-entropy sampling problem
- Branch-and-bound for integer D-optimality with fast local search and variable-bound tightening
This page was built for publication: Generalized maximum-entropy sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5882388)