Mixing convex-optimization bounds for maximum-entropy sampling
From MaRDI portal
Publication:2044968
Abstract: The maximum-entropy sampling problem is a fundamental and challenging combinatorial-optimization problem, with application in spatial statistics. It asks to find a maximum-determinant order- principal submatrix of an order- covariance matrix. Exact solution methods for this NP-hard problem are based on a branch-and-bound framework. Many of the known upper bounds for the optimal value are based on convex optimization. We present a methodology for "mixing" these bounds to achieve better bounds.
Recommendations
Cites work
- A linear integer programming bound for maximum-entropy sampling
- An Exact Algorithm for Maximum Entropy Sampling
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition
- Constrained maximum-entropy sampling
- Continuous relaxations for Constrained Maximum-Entropy Sampling
- Efficient solution of maximum-entropy sampling problems
- Generalized maximum-entropy sampling
- scientific article; zbMATH DE number 3529352 (Why is no real title available?)
- scientific article; zbMATH DE number 1534303 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- Introduction to sensitivity and stability analysis in nonlinear programming
- Matrix Analysis
- Matrix completions, moments, and sums of Hermitian squares
- Maximum-entropy remote sampling
- Maximum-entropy sampling and the Boolean quadric polytope
- Nonsmooth optimization via quasi-Newton methods
- On the implementation and usage of SDPT3 -- a Matlab software package for semidefinite-quadratic-linear programming, version 4.0
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Sensitivity and stability analysis for nonlinear programming
- Solving maximum-entropy sampling problems using factored masks
- The Schur complement and its applications
- Using a conic bundle method to accelerate both phases of a quadratic convex reformulation
- Using continuous nonlinear relaxations to solve constrained maximum-entropy sampling problems
Cited in
(15)- Using continuous nonlinear relaxations to solve constrained maximum-entropy sampling problems
- A linear integer programming bound for maximum-entropy sampling
- Unifying presampling via concentration bounds
- Continuous relaxations for Constrained Maximum-Entropy Sampling
- An Exact Algorithm for Maximum Entropy Sampling
- Efficient solution of maximum-entropy sampling problems
- Tridiagonal maximum-entropy sampling and tridiagonal masks
- An outer-approximation algorithm for maximum-entropy sampling
- An outer-approximation algorithm for maximum-entropy sampling
- On Computing with Some Convex Relaxations for the Maximum-Entropy Sampling Problem
- Best principal submatrix selection for the maximum entropy sampling problem: scalable algorithms and performance guarantees
- Technical note -- Masking Anstreicher's Linx bound for improved entropy bounds
- Convex relaxation for the generalized maximum-entropy sampling problem
- The augmented factorization bound for maximum-entropy sampling
- Generalized scaling for the constrained maximum-entropy sampling problem
This page was built for publication: Mixing convex-optimization bounds for maximum-entropy sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2044968)
