{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T14:07:45Z","timestamp":1771337265940,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2024,6,20]],"date-time":"2024-06-20T00:00:00Z","timestamp":1718841600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,6,20]],"date-time":"2024-06-20T00:00:00Z","timestamp":1718841600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-22-1-0172"],"award-info":[{"award-number":["FA9550-22-1-0172"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["305444\/2019-0"],"award-info":[{"award-number":["305444\/2019-0"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["434683\/2018-3"],"award-info":[{"award-number":["434683\/2018-3"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS- 1929284"],"award-info":[{"award-number":["DMS- 1929284"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2025,7]]},"DOI":"10.1007\/s10107-024-02101-3","type":"journal-article","created":{"date-parts":[[2024,6,20]],"date-time":"2024-06-20T06:01:31Z","timestamp":1718863291000},"page":"177-216","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Generalized scaling for the constrained maximum-entropy sampling problem"],"prefix":"10.1007","volume":"212","author":[{"given":"Zhongzhu","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcia","family":"Fampa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8190-1091","authenticated-orcid":false,"given":"Jon","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,6,20]]},"reference":[{"key":"2101_CR1","doi-asserted-by":"crossref","unstructured":"Anstreicher, K.M., Fampa, M., Lee, J., Williams, J.: Continuous relaxations for constrained maximum-entropy sampling. In: Integer Programming and Combinatorial Optimization (Vancouver. BC, 1996), volume 1084 of Lecture Notes in Computer Science, pp. 234\u2013248. Springer, Berlin (1996)","DOI":"10.1007\/3-540-61310-2_18"},{"issue":"2","key":"2101_CR2","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s101070050055","volume":"85","author":"KM Anstreicher","year":"1999","unstructured":"Anstreicher, K.M., Fampa, M., Lee, J., Williams, J.: Using continuous nonlinear relaxations to solve constrained maximum-entropy sampling problems. Math. Program. Ser. A 85(2), 221\u2013240 (1999)","journal-title":"Math. Program. Ser. A"},{"key":"2101_CR3","doi-asserted-by":"crossref","unstructured":"Anstreicher, K.M., Lee, J.: A masked spectral bound for maximum-entropy sampling. In: mODa 7\u2014Advances in Model-Oriented Design and Analysis, Contributions Statistics, pp. 1\u201312. Physica, Heidelberg (2004)","DOI":"10.1007\/978-3-7908-2693-7_1"},{"issue":"4","key":"2101_CR4","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1007\/s10898-018-0662-x","volume":"72","author":"KM Anstreicher","year":"2018","unstructured":"Anstreicher, K.M.: Maximum-entropy sampling and the Boolean quadric polytope. J. Global Optim. 72(4), 603\u2013618 (2018)","journal-title":"J. Global Optim."},{"issue":"6","key":"2101_CR5","doi-asserted-by":"publisher","first-page":"1826","DOI":"10.1287\/opre.2019.1962","volume":"68","author":"KM Anstreicher","year":"2020","unstructured":"Anstreicher, K.M.: Efficient solution of maximum-entropy sampling problems. Oper. Res. 68(6), 1826\u20131835 (2020)","journal-title":"Oper. Res."},{"key":"2101_CR6","doi-asserted-by":"publisher","unstructured":"Al-Thani, H., Lee, J.: An R package for generating covariance matrices for maximum-entropy sampling from precipitation chemistry data. SN Operations Research Forum, Volume 1:Article 17 (21 pages), (2020). https:\/\/doi.org\/10.1007\/s43069-020-0011-z","DOI":"10.1007\/s43069-020-0011-z"},{"key":"2101_CR7","doi-asserted-by":"crossref","unstructured":"Al-Thani, H., Lee, J.: Tridiagonal maximum-entropy sampling and tridiagonal masks. In: LAGOS: Proceedings. Procedia Computer Science 195(127\u2013134), 2021 (2021)","DOI":"10.1016\/j.procs.2021.11.018"},{"key":"2101_CR8","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.dam.2023.04.020","volume":"337","author":"H Al-Thani","year":"2023","unstructured":"Al-Thani, H., Lee, J.: Tridiagonal maximum-entropy sampling and tridiagonal masks. Discrete Appl. Math. 337, 120\u2013138 (2023)","journal-title":"Discrete Appl. Math."},{"key":"2101_CR9","unstructured":"Box, G., Hau, I.: Constrained Experimental Designs Part I: Construction of Projection Designs (1990). Technical report, http:\/\/digital.library.wisc.edu\/1793\/69117"},{"issue":"2\u20133","key":"2101_CR10","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s10107-006-0024-1","volume":"109","author":"S Burer","year":"2007","unstructured":"Burer, S., Lee, J.: Solving maximum-entropy sampling problems using factored masks. Math. Program. Ser. B 109(2\u20133), 263\u2013281 (2007)","journal-title":"Math. Program. Ser. B"},{"key":"2101_CR11","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1080\/02331889508802474","volume":"26","author":"RD Cook","year":"1995","unstructured":"Cook, R.D., Fedorov, V.: Constrained optimization of experimental design (invited with discussion). Statistics 26, 129\u2013178 (1995)","journal-title":"Statistics"},{"key":"2101_CR12","doi-asserted-by":"crossref","unstructured":"Chen, Z., Fampa, M., Lee, J.: Masking Anstreicher\u2019s linx bound for improved entropy bounds. Oper. Res. 72(2), 591\u2013603 (2022)","DOI":"10.1287\/opre.2022.2324"},{"key":"2101_CR13","doi-asserted-by":"publisher","unstructured":"Chen, Z., Fampa, M., Lee, J.: Generalized scaling for the constrained maximum-entropy sampling problem. In: SIAM Conference on Applied and Computational Discrete Algorithms (ACDA23), pp. 110\u2013118. SIAM (2023). https:\/\/doi.org\/10.1137\/1.9781611977714.10","DOI":"10.1137\/1.9781611977714.10"},{"issue":"2","key":"2101_CR14","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1287\/ijoc.2022.1264","volume":"35","author":"Z Chen","year":"2023","unstructured":"Chen, Z., Fampa, M., Lee, J.: On computing with some convex relaxations for the maximum-entropy sampling problem. INFORMS J. Comput. 35(2), 368\u2013385 (2023)","journal-title":"INFORMS J. Comput."},{"key":"2101_CR15","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/s10107-020-01588-w","volume":"188","author":"Z Chen","year":"2021","unstructured":"Chen, Z., Fampa, M., Lambert, A., Lee, J.: Mixing convex-optimization bounds for maximum-entropy sampling. Math. Program. Ser. B 188, 539\u2013568 (2021)","journal-title":"Math. Program. Ser. B"},{"issue":"4","key":"2101_CR16","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1081\/QEN-120003561","volume":"14","author":"DJ Douglas","year":"2002","unstructured":"Douglas, D.J., Montgomery, C., Loredo, E.N., Testik, M.C.: Experimental designs for constrained regions. Qual. Eng. 14(4), 587\u2013601 (2002)","journal-title":"Qual. Eng."},{"key":"2101_CR17","unstructured":"Fampa, M.H.C.: Relaxa\u00e7\u00f5es Cont\u00ednuas para o Problema da Amostra de M\u00e1xima Entropia Restrito e um Algoritmo de Trajet\u00f3ria Central de Passos Longos para Problemas de Programa\u00e7\u00e3o Semidefinida. D.Sc., Universidade Federal do Rio de Janeiro, November (1996). https:\/\/www.cos.ufrj.br\/uploadfile\/1339609553.pdf"},{"issue":"1","key":"2101_CR18","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF02055196","volume":"27","author":"AV Fiacco","year":"1990","unstructured":"Fiacco, A.V., Ishizuka, Y.: Sensitivity and stability analysis for nonlinear programming. Ann. Oper. Res. 27(1), 215\u2013235 (1990)","journal-title":"Ann. Oper. Res."},{"key":"2101_CR19","doi-asserted-by":"crossref","unstructured":"Fampa, M., Lee, J.: Maximum-Entropy Sampling: Algorithms and Application. Springer (2022)","DOI":"10.1007\/978-3-031-13078-6"},{"issue":"4","key":"2101_CR20","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1287\/opre.43.4.684","volume":"43","author":"C-W Ko","year":"1995","unstructured":"Ko, C.-W., Lee, J., Queyranne, M.: An exact algorithm for maximum-entropy sampling. Oper. Res. 43(4), 684\u2013691 (1995)","journal-title":"Oper. Res."},{"issue":"5","key":"2101_CR21","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1287\/opre.46.5.655","volume":"46","author":"J Lee","year":"1998","unstructured":"Lee, J.: Constrained maximum-entropy sampling. Oper. Res. 46(5), 655\u2013664 (1998)","journal-title":"Oper. Res."},{"key":"2101_CR22","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s10107-012-0514-2","volume":"141","author":"AS Lewis","year":"2013","unstructured":"Lewis, A.S., Overton, M.L.: Nonsmooth optimization via quasi-Newton methods. Math. Program. 141, 135\u2013163 (2013)","journal-title":"Math. Program."},{"key":"2101_CR23","doi-asserted-by":"publisher","unstructured":"Li, Y., Xie, W.: Best principal submatrix selection for the maximum entropy sampling problem: scalable algorithms and performance guarantees. Oper. Res. (2023). https:\/\/doi.org\/10.1287\/opre.2023.2488","DOI":"10.1287\/opre.2023.2488"},{"key":"2101_CR24","unstructured":"Moreau, J.-J.: Fonctionnelles convexes. S\u00e9minaire Jean Leray 2, 1\u2013108 (1966)"},{"key":"2101_CR25","doi-asserted-by":"crossref","unstructured":"Nikolov, A.: Randomized rounding for the largest simplex problem. In: Proceedings of the 47th Annual ACM Symposium on Theory of Computing, pp. 861\u2013870 (2015)","DOI":"10.1145\/2746539.2746628"},{"key":"2101_CR26","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.jmateco.2018.02.004","volume":"76","author":"D Oyama","year":"2018","unstructured":"Oyama, D., Takenawa, T.: On the (non-)differentiability of the optimal value function when the optimal solution is unique. J. Math. Econ. 76, 21\u201332 (2018)","journal-title":"J. Math. Econ."},{"key":"2101_CR27","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton Mathematical Series. Princeton University Press (1997)"},{"issue":"140","key":"2101_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1515\/crll.1911.140.1","volume":"1911","author":"J Schur","year":"1911","unstructured":"Schur, J.: Bemerkungen zur theorie der beschr\u00e4nkten bilinearformen mit unendlich vielen ver\u00e4nderlichen. J. f\u00fcr die reine und Angew. Math. 1911(140), 1\u201328 (1911)","journal-title":"J. f\u00fcr die reine und Angew. Math."},{"issue":"3","key":"2101_CR29","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"CE Shannon","year":"1948","unstructured":"Shannon, C.E.: A mathematical theory of communication. Bell Syst. Tech. J. 27(3), 379\u2013423 (1948)","journal-title":"Bell Syst. Tech. J."},{"key":"2101_CR30","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1080\/02664768700000020","volume":"46","author":"MC Shewry","year":"1987","unstructured":"Shewry, M.C., Wynn, H.P.: Maximum entropy sampling. J. Appl. Stat. 46, 165\u2013170 (1987)","journal-title":"J. Appl. Stat."},{"issue":"1","key":"2101_CR31","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1090\/S0002-9947-1934-1501735-3","volume":"36","author":"H Whitney","year":"1934","unstructured":"Whitney, H.: Analytic extensions of differentiable functions defined in closed sets. Trans. Am. Math. Soc. 36(1), 63\u201389 (1934)","journal-title":"Trans. Am. Math. Soc."},{"key":"2101_CR32","unstructured":"Williams, J.D.: Spectral Bounds for Entropy Models. University of Kentucky, Ph.D. (1998)"},{"key":"2101_CR33","doi-asserted-by":"crossref","unstructured":"Zalinescu, C.: Convex Analysis in General Vector Spaces. World Scientific (2002)","DOI":"10.1142\/9789812777096"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-024-02101-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-024-02101-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-024-02101-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:02:50Z","timestamp":1750176170000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-024-02101-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,20]]},"references-count":33,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["2101"],"URL":"https:\/\/doi.org\/10.1007\/s10107-024-02101-3","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,6,20]]},"assertion":[{"value":"26 June 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 May 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 June 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}