Efficient Solution of Maximum-Entropy Sampling Problems

References

• Anstreicher K, Lee J (2004) A masked spectral bound for maximum-entropy sampling. Di Bucchianico A, Läuter H, Wynn HP, eds. mODa 7—Advances in Model-Oriented Design and Analysis, Contributions to Statistics (Physica, Heidelberg, Germany), 1–10.Google Scholar
• Anstreicher KM (2018) Maximum-entropy sampling and the Boolean quadric polytope. J. Global Optim. 72:603–618.Crossref, Google Scholar
• Anstreicher KM, Fampa M, Lee J, Williams J (1996) Continuous relaxations for constrained maximum-entropy sampling. Cunningham WH, McCormick ST, Queyranne M, eds. IPCO 1996 Integer Programming Combinatorial Optim., Lecture Notes in Computer Science, vol. 1084 (Springer, Berlin), 234–248.Google Scholar
• Anstreicher KM, Fampa M, Lee J, Williams J (1999) Using continuous nonlinear relaxations to solve constrained maximum-entropy sampling problems. Math. Programming 85(2):221–240.Google Scholar
• Burer S, Lee J (2007) Solving maximum-entropy sampling problems using factored masks. Math. Programming 109(2–3):263–281.Crossref, Google Scholar
• Graham A (1981) Kronecker Products and Matrix Calculus: With Applications (Ellis Horwood, Chichester, UK).Google Scholar
• Grant M, Boyd S (2017) CVX: Matlab software for disciplined convex programming, version 2.1. Accessed November 15, 2017, http://cvxr.com/cvx.Google Scholar
• Guttorp P, Le N, Sampson P, Zidek J (1992) Using entropy in the redesign of an environmental monitoring network. Technical Report 116, Department of Statistics, University of British Columbia, Vancouver.Google Scholar
• Hoffman A, Lee J, Williams J (2001) New upper bounds for maximum-entropy sampling. Atkinson AC, Hackl P, Müller WG, eds. mODa 6—Advances in Model-Oriented Design and Analysis, Contributions to Statistics (Physica, Heidelberg, Germany), 143–153.Google Scholar
• Horn RA, Johnson CR (1985) Matrix Analysis (Cambridge University Press, Cambridge, UK).Crossref, Google Scholar
• Ko CW, Lee J, Queyranne M (1995) An exact algorithm for maximum entropy sampling. Oper. Res. 43(4):684–691.Link, Google Scholar
• Le N, Wang W, Zidek J (2017) Covariance matrix and monitoring location data, obtained December 18, 2017.Google Scholar
• Lee J (1998) Constrained maximum-entropy sampling. Oper. Res. 46(5):655–664.Link, Google Scholar
• Lee J (2000) Semidefinite programming in experimental design. Saigal R, Wolkowicz H, Vandenberghe L, eds., Handbook of Semidefinite Programming, International Series in Operations Research and Management Science, vol. 27 (Kluwer Academic Publishers, Boston), 528–532.Google Scholar
• Lee J (2012) Maximum-entropy sampling. El-Shaarawi AH, Piegorsch WW, eds. Encyclopedia of Environmetrics, 2nd ed. (John Wiley & Sons Inc., New York), 1570–1574.Google Scholar
• Lee J, Williams J (2003) A linear integer programming bound for maximum-entropy sampling. Math. Programming 94(2–3):247–256.Google Scholar
• Shewry M, Wynn HP (1987) Maximum entropy sampling. J. Appl. Statist. 46(2):165–170.Crossref, Google Scholar
• Toh KC, Todd MJ, Tutuncu RH (2012) On the implementation and usage of SDPT3—A MATLAB software package for semidefinite-quadratic-linear programming, version 4.0. Anjos M, Lasserre J, eds. Handbook on Semidefinite, Conic and Polynomial Optimization, International Series in Operations Research and Management Science, vol. 166 (Springer, Berlin), 715–754.Google Scholar
• Vandenberghe L, Boyd S, Wu SP (1998) Determinant maximization with linear matrix inequality constraints. SIAM J. Matrix Anal. Appl. 19(2):499–533.Crossref, Google Scholar
• Wu S, Zidek JV (1992) An entropy based review of selected NADP/NTN network sites for 1983-86. Atmos. Environ. 26(11):2089–2103.Crossref, Google Scholar