Mixing convex-optimization bounds for maximum-entropy sampling

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- s principal submatrix of an order- n 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.

[1]  Jon Lee.  Constrained Maximum-Entropy Sampling , 1998, Oper. Res..

[2]  Anthony V. Fiacco,et al.  Nonlinear programming;: Sequential unconstrained minimization techniques , 1968 .

[3]  Franz Rendl,et al.  Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and Equipartition , 2006, Math. Program..

[4]  Johan Löfberg,et al.  YALMIP : a toolbox for modeling and optimization in MATLAB , 2004 .

[5]  Jon Lee,et al.  New upper bounds for maximum-entropy sampling , 2000 .

[6]  A. Fiacco,et al.  Sensitivity and stability analysis for nonlinear programming , 1991 .

[7]  Jon Lee,et al.  Maximum-entropy remote sampling , 2001, Discret. Appl. Math..

[8]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[9]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[10]  Kim-Chuan Toh,et al.  SDPT3 -- A Matlab Software Package for Semidefinite Programming , 1996 .

[11]  Alain Billionnet,et al.  Using a Conic Bundle Method to Accelerate Both Phases of a Quadratic Convex Reformulation , 2017, INFORMS J. Comput..

[12]  Fuzhen Zhang.  The Schur complement and its applications , 2005 .

[13]  Maurice Queyranne,et al.  An Exact Algorithm for Maximum Entropy Sampling , 1995, Oper. Res..

[14]  Hugo J. Woerdeman,et al.  Matrix Completions, Moments, and Sums of Hermitian Squares , 2011 .

[15]  Jon Lee,et al.  Maximum-Entropy Sampling , 2006, Springer Series in Operations Research and Financial Engineering.

[16]  Jon Lee,et al.  A linear integer programming bound for maximum-entropy sampling , 2003, Math. Program..

[17]  Jon Lee,et al.  Generalized maximum-entropy sampling , 2020, INFOR Inf. Syst. Oper. Res..

[18]  K. Anstreicher,et al.  A Masked Spectral Bound for Maximum-Entropy Sampling , 2004 .

[19]  Valerii Fedorov,et al.  Design of Experiments in Statistics , 2000 .

[20]  Anthony V. Fiacco,et al.  Introduction to Sensitivity and Stability Analysis in Nonlinear Programming , 2012 .

[21]  Henry P. Wynn,et al.  Maximum entropy sampling , 1987 .

[22]  Jon Lee,et al.  Continuous Relaxations for Constrained Maximum-Entropy Sampling , 1996, IPCO.

[23]  Jon Lee,et al.  Solving maximum-entropy sampling problems using factored masks , 2007, Math. Program..

[24]  Kim-Chuan Toh,et al.  On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0 , 2012 .

[25]  Kurt M. Anstreicher,et al.  Maximum-entropy sampling and the Boolean quadric polytope , 2018, J. Glob. Optim..

[26]  Weijun Xie,et al.  Best Principal Submatrix Selection for the Maximum Entropy Sampling Problem: Scalable Algorithms and Performance Guarantees , 2020, ArXiv.

[27]  Jon Lee,et al.  Using continuous nonlinear relaxations to solve. constrained maximum-entropy sampling problems , 1999, Math. Program..

[28]  Johan Efberg,et al.  YALMIP : A toolbox for modeling and optimization in MATLAB , 2004 .

[29]  Kurt M. Anstreicher,et al.  Efficient Solution of Maximum-Entropy Sampling Problems , 2020, Oper. Res..