Continuous relaxations for Constrained Maximum-Entropy Sampling
From MaRDI portal
Publication:4645926
DOI10.1007/3-540-61310-2_18zbMATH Open1415.90057OpenAlexW1539649017MaRDI QIDQ4645926FDOQ4645926
Kurt M. Anstreicher, Marcia Fampa, Joy Williams, Jon Lee
Publication date: 11 January 2019
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-61310-2_18
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Integer programming (90C10)
Cites Work
- Title not available (Why is that?)
- Matrix Analysis
- A Mathematical Theory of Communication
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimal monitoring network designs
- On the classical logarithmic barrier function method for a class of smooth convex programming problems
- Title not available (Why is that?)
- An Exact Algorithm for Maximum Entropy Sampling
- Comparison of two approaches in the optimal design of an observation network
Cited In (8)
- Efficient Solution of Maximum-Entropy Sampling Problems
- Approximately optimal subset selection for statistical design and modelling
- Generalized maximum-entropy sampling
- Tridiagonal maximum-entropy sampling and tridiagonal masks
- Maximum-entropy sampling and the Boolean quadric polytope
- Mixing convex-optimization bounds for maximum-entropy sampling
- An outer-approximation algorithm for maximum-entropy sampling
- Maximum-entropy remote sampling
Uses Software
Recommendations
- Using continuous nonlinear relaxations to solve constrained maximum-entropy sampling problems π π
- Mixing convex-optimization bounds for maximum-entropy sampling π π
- Generalized maximum-entropy sampling π π
- Efficient Solution of Maximum-Entropy Sampling Problems π π
- An outer-approximation algorithm for maximum-entropy sampling π π
- A linear integer programming bound for maximum-entropy sampling π π
- An Exact Algorithm for Maximum Entropy Sampling π π
- Continuity of the maximum-entropy inference: convex geometry and numerical ranges approach π π
- Intrinsic convergence properties of entropic sampling algorithms π π
- Title not available (Why is that?) π π
This page was built for publication: Continuous relaxations for Constrained Maximum-Entropy Sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645926)