Continuous relaxations for Constrained Maximum-Entropy Sampling
DOI10.1007/3-540-61310-2_18zbMATH Open1415.90057OpenAlexW1539649017MaRDI QIDQ4645926FDOQ4645926
Authors: Kurt M. Anstreicher, Jon Lee, Joy Williams, Marcia Fampa 
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
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
- Publication:5750347
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 (9)
- 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
- Solving maximum-entropy sampling problems using factored masks
- Efficient solution of maximum-entropy sampling problems
- Mixing convex-optimization bounds for maximum-entropy sampling
- An outer-approximation algorithm for maximum-entropy sampling
- Maximum-entropy remote sampling
Uses Software
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)
