Maximum-entropy sampling and the Boolean quadric polytope
From MaRDI portal
Publication:1756791
DOI10.1007/s10898-018-0662-xzbMath1404.90097OpenAlexW2803769118MaRDI QIDQ1756791
Publication date: 27 December 2018
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-018-0662-x
Optimal statistical designs (62K05) Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26)
Related Items (6)
Tridiagonal maximum-entropy sampling and tridiagonal masks ⋮ An outer-approximation algorithm for maximum-entropy sampling ⋮ An outer-approximation algorithm for maximum-entropy sampling ⋮ An R package for generating covariance matrices for maximum-entropy sampling from precipitation chemistry data ⋮ Efficient Solution of Maximum-Entropy Sampling Problems ⋮ Mixing convex-optimization bounds for maximum-entropy sampling
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Solving maximum-entropy sampling problems using factored masks
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Using continuous nonlinear relaxations to solve constrained maximum-entropy sampling problems
- A linear integer programming bound for maximum-entropy sampling
- Constrained Maximum-Entropy Sampling
- On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0
- Determinant Maximization with Linear Matrix Inequality Constraints
- Continuous relaxations for Constrained Maximum-Entropy Sampling
- An Exact Algorithm for Maximum Entropy Sampling
- Fixing Variables in Semidefinite Relaxations
This page was built for publication: Maximum-entropy sampling and the Boolean quadric polytope
