An outer-approximation algorithm for maximum-entropy sampling
From MaRDI portal
Publication:6202951
DOI10.1016/j.dam.2024.01.002MaRDI QIDQ6202951
Publication date: 27 February 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
regularizationlocal searchouter approximationsecond-order approximationmixed-integer nonlinear optimizationdisjunctive cutsmaximum-entropy samplingno-good
Mathematical programming (90Cxx) Design of statistical experiments (62Kxx) Communication, information (94Axx)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Mathematical Theory of Communication
- Solving maximum-entropy sampling problems using factored masks
- Using continuous nonlinear relaxations to solve constrained maximum-entropy sampling problems
- Solving mixed integer nonlinear programs by outer approximation
- A linear integer programming bound for maximum-entropy sampling
- Maximum-entropy sampling and the Boolean quadric polytope
- An outer-approximation approach for information-maximizing sensor selection
- Mixing convex-optimization bounds for maximum-entropy sampling
- An R package for generating covariance matrices for maximum-entropy sampling from precipitation chemistry data
- Using regularization and second order information in outer approximation for convex MINLP
- Constrained Maximum-Entropy Sampling
- Randomized Rounding for the Largest Simplex Problem
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Continuous relaxations for Constrained Maximum-Entropy Sampling
- Disjunctive Programming
- An Exact Algorithm for Maximum Entropy Sampling
- Efficient Solution of Maximum-Entropy Sampling Problems
- Forbidden Vertices
- An outer-approximation algorithm for maximum-entropy sampling