On Computing with Some Convex Relaxations for the Maximum-Entropy Sampling Problem

References

• Anstreicher KM (2018) Maximum-entropy sampling and the Boolean quadric polytope. J. Global Optim. 72(4):603–618.Crossref, Google Scholar
• Anstreicher KM (2020) Efficient solution of maximum-entropy sampling problems. Oper. Res. 68(6):1826–1835.Link, Google Scholar
• Anstreicher KM, Lee J (2004) A masked spectral bound for maximum-entropy sampling. mODa 7—Advances in Model-Oriented Design and Analysis (Physica, Heidelberg, Germany), 1–12.Crossref, Google Scholar
• Anstreicher KM, Fampa M, Lee J, Williams J (1996) Continuous relaxations for constrained maximum-entropy sampling. Integer Programming and Combinatorial Optimization, vol. 1084 of Lecture Notes in Computer Science (Springer, Berlin), 234–248.Crossref, Google Scholar
• Anstreicher KM, Fampa M, Lee J, Williams J (1999) Using continuous nonlinear relaxations to solve constrained maximum-entropy sampling problems. Math. Programming Ser. A 85(2):221–240.Crossref, Google Scholar
• Anstreicher KM, Fampa M, Lee J, Williams J (2001) Maximum-entropy remote sampling. Discrete Appl. Math. 108(3):211–226.Crossref, Google Scholar
• Bagroy S, Kumaraguru P, De Choudhury M (2017) A social media based index of mental well-being in college campuses. Lampe C, Schraefel MC, Hourcade JP, Appert C, Wigdor D, eds. Proc. CHI Conf. on Human Factors in Comput. Systems (ACM, New York), 1634–1646.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
• Caselton WF, Zidek JV (1984) Optimal monitoring network design. Statist. Probability Lett. 2:223–227.Crossref, Google Scholar
• Caselton WF, Kan L, Zidek JV (1992) Quality data network designs based on entropy. Walden A, Guttorp P, eds. Statistics in the Environmental and Earth Sciences (Elsevier Science, London), 10–38.Google Scholar
• Chen Z, Fampa M, Lambert A, Lee J (2021) Mixing convex-optimization bounds for maximum-entropy sampling. Math. Programming Ser. B 188:539–568.Crossref, Google Scholar
• Cook D, Fedorov V (1995) Invited discussion paper constrained optimization of experimental design. Statistics 26(2):129–148.Crossref, Google Scholar
• Dey SS, Mazumder R, Wang G (2021) Using ℓ1-relaxation and integer programming to obtain dual bounds for sparse PCA. Oper. Res. 70(3):1914–1932.Google Scholar
• Fampa M, Lee J (2021) Maximum-Entropy Sampling: Algorithms and Application (Springer, Berlin).Google Scholar
• Frank M, Wolfe P (1956) An algorithm for quadratic programming. Naval Res. Logist. Quart. 3(1–2):95–110.Crossref, Google Scholar
• Guttorp P, Le ND, Sampson PD, Zidek JV (1993) Using entropy in the redesign of an environmental monitoring network. Patil G, Rao C, Ross N, eds. Multivariate Environmental Statistics, vol. 6 (North-Holland), 175–202.Google Scholar
• Hoffman A, Lee J, Williams J (2001) New upper bounds for maximum-entropy sampling. mODa 6—Advances in Model-Oriented Design and Analysis (Physica, Heidelberg, Germany), 143–153.Crossref, Google Scholar
• Horn RA, Johnson CR (1985) Matrix Analysis, 1st ed. (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
• Lee J (1998) Constrained maximum-entropy sampling. Oper. Res. 46(5):655–664.Link, Google Scholar
• Lee J (2012) Maximum entropy sampling. El-Shaarawi A, Piegorsch W, eds. Encyclopedia of Environmetrics, 2nd ed. (Wiley, Boston), 1570–1574.Crossref, Google Scholar
• Lee J, Williams J (2003) A linear integer programming bound for maximum-entropy sampling. Math. Programming Ser. B 94(2–3):247–256.Crossref, Google Scholar
• Li Y, Xie W (2020) Best principal submatrix selection for the maximum entropy sampling problem: scalable algorithms and performance guarantees. Preprint, submitted January 23, 2020; revised October 1, 2021, https://arxiv.org/abs/2001.08537.Google Scholar
• Löfberg J (2004) YALMIP: A toolbox for modeling and optimization in MATLAB. Proc. CACSD Conf.Google Scholar
• Nikolov A (2015) Randomized rounding for the largest simplex problem. Proc. 47th Annual ACM Sympos. on Theory of Comput. (ACM, New York), 861–870.Google Scholar
• Sebastiani P, Wynn HP (2000) Maximum entropy sampling and optimal Bayesian experimental design. J. Royal Statist. Soc. Ser. B Statist. Methodology 62(1):145–157.Crossref, Google Scholar
• Shewry MC, Wynn HP (1987) Maximum entropy sampling. J. Appl. Statist. 46:165–170.Crossref, Google Scholar
• Toh KC, Todd MJ, Tütüncü RH (1999) SDPT3: A Matlab software package for semidefinite programming, version 1.3. Optim. Methods Software 11(1–4):545–581.Crossref, Google Scholar
• Tsing NK, Fan MK, Verriest EI (1994) On analyticity of functions involving eigenvalues. Linear Algebra Appl. 207:159–180.Crossref, Google Scholar
• Wu S, Zidek JV (1992) An entropy-based analysis of data from selected NADP/NTN network sites for 1983–1986. Atmospheric Environment A General Topics 26(11):2089–2103.Crossref, Google Scholar
• Zidek JV, Sun W, Le ND (2000) Designing and integrating composite networks for monitoring multivariate Gaussian pollution fields. J. Royal Statist. Soc. Ser. C Appl. Statist. 49(1):63–79.Crossref, Google Scholar