Continuous relaxations for Constrained Maximum-Entropy Sampling

DOI10.1007/3-540-61310-2_18MaRDI QIDQ4645926zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

principal submatrixcontinuous relaxationrelative interiordual solutionunconstrained case

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Integer programming (90C10)

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

Cites work

• scientific article; zbMATH DE number 781814 (Why is no real title available?)
• scientific article; zbMATH DE number 806801 (Why is no real title available?)
• scientific article; zbMATH DE number 3307153 (Why is no real title available?)
• scientific article; zbMATH DE number 3068103 (Why is no real title available?)
• A Mathematical Theory of Communication
• An Exact Algorithm for Maximum Entropy Sampling
• Comparison of two approaches in the optimal design of an observation network
• Matrix Analysis
• On the classical logarithmic barrier function method for a class of smooth convex programming problems
• Optimal monitoring network designs

Cited in

(11)

• 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
• On Computing with Some Convex Relaxations for the Maximum-Entropy Sampling Problem
• Maximum-entropy remote sampling
• Best principal submatrix selection for the maximum entropy sampling problem: scalable algorithms and performance guarantees

Describes a project that uses

Uses Software

• CPLEX
• LAPACK

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)