Maximum-entropy sampling and the Boolean quadric polytope
From MaRDI portal
Publication:1756791
DOI10.1007/S10898-018-0662-XzbMATH Open1404.90097OpenAlexW2803769118WikidataQ129784093 ScholiaQ129784093MaRDI QIDQ1756791FDOQ1756791
Authors: Kurt M. Anstreicher 
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
Recommendations
- Efficient solution of maximum-entropy sampling problems
- A linear integer programming bound for maximum-entropy sampling
- Continuous relaxations for Constrained Maximum-Entropy Sampling
- An Exact Algorithm for Maximum Entropy Sampling
- Using continuous nonlinear relaxations to solve constrained maximum-entropy sampling problems
Optimal statistical designs (62K05) Nonconvex programming, global optimization (90C26) Semidefinite programming (90C22)
Cites Work
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- On the implementation and usage of SDPT3 -- a Matlab software package for semidefinite-quadratic-linear programming, version 4.0
- Title not available (Why is that?)
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- Constrained maximum-entropy sampling
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Fixing Variables in Semidefinite Relaxations
- Determinant Maximization with Linear Matrix Inequality Constraints
- Title not available (Why is that?)
- Using continuous nonlinear relaxations to solve constrained maximum-entropy sampling problems
- A linear integer programming bound for maximum-entropy sampling
- An Exact Algorithm for Maximum Entropy Sampling
- Solving maximum-entropy sampling problems using factored masks
- Continuous relaxations for Constrained Maximum-Entropy Sampling
Cited In (12)
- An R package for generating covariance matrices for maximum-entropy sampling from precipitation chemistry data
- Generalized maximum-entropy sampling
- Quad folding: a simple idea for the subjective property characterization of large sample sets
- Tridiagonal maximum-entropy sampling and tridiagonal masks
- Solving maximum-entropy sampling problems using factored masks
- A linear integer programming bound for maximum-entropy sampling
- Efficient solution of maximum-entropy sampling problems
- Mixing convex-optimization bounds for maximum-entropy sampling
- An outer-approximation algorithm for maximum-entropy sampling
- An outer-approximation algorithm for maximum-entropy sampling
- Maximum-entropy remote sampling
- Mixed-integer nonlinear optimization: a hatchery for modern mathematics. Abstracts from the workshop held August 13--18, 2023
Uses Software
This page was built for publication: Maximum-entropy sampling and the Boolean quadric polytope
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1756791)
