Solving maximum-entropy sampling problems using factored masks

We present a practical approach to Anstreicher and Lee’s masked spectral bound for maximum-entropy sampling, and we describe favorable results that we have obtained with a Branch-and-Bound algorithm based on our approach. By representing masks in factored form, we are able to easily satisfy a semidefiniteness constraint. Moreover, this representation allows us to restrict the rank of the mask as a means for attempting to practically incorporate second-order information.

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

[2]  W. F. Caselton,et al.  Optimal monitoring network designs , 1984 .

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

[4]  R. Monteiro,et al.  A projected gradient algorithm for solving the maxcut SDP relaxation , 2001 .

[5]  J. Zidek,et al.  An entropy-based analysis of data from selected NADP/NTN network sites for 1983–1986 , 1992 .

[6]  Renato D. C. Monteiro,et al.  A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization , 2003, Math. Program..

[7]  L. Chambers.  Practical methods of optimization (2nd edn) , by R. Fletcher. Pp. 436. £34.95. 2000. ISBN 0 471 49463 1 (Wiley). , 2001, The Mathematical Gazette.

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

[9]  Adrian S. Lewis,et al.  A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization , 2005, SIAM J. Optim..

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

[11]  Yin Zhang,et al.  Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs , 2002, SIAM J. Optim..

[12]  Jon Lee.  Maximum entropy sampling , 2001 .

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

[14]  Jesús López Fidalgo,et al.  Moda 8 - Advances in Model-Oriented Design and Analysis , 2007 .

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

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

[17]  E. Verriest,et al.  On analyticity of functions involving eigenvalues , 1994 .

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

[19]  H. Wynn,et al.  Maximum entropy sampling and optimal Bayesian experimental design , 2000 .

[20]  Werner G. Müller,et al.  Collecting Spatial Data: Optimum Design of Experiments for Random Fields , 1998 .

[21]  R. Fletcher.  Practical Methods of Optimization , 1988 .