{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:38:56Z","timestamp":1740145136494,"version":"3.37.3"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,9,17]],"date-time":"2022-09-17T00:00:00Z","timestamp":1663372800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,9,17]],"date-time":"2022-09-17T00:00:00Z","timestamp":1663372800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DGE-1656518"],"award-info":[{"award-number":["DGE-1656518"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"AI Chip Center for Emerging Studies"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1007\/s11590-022-01933-2","type":"journal-article","created":{"date-parts":[[2022,9,17]],"date-time":"2022-09-17T12:04:21Z","timestamp":1663416261000},"page":"1229-1240","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Computing tighter bounds on the n-queens constant via Newton\u2019s method"],"prefix":"10.1007","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8228-7441","authenticated-orcid":false,"given":"Parth","family":"Nobel","sequence":"first","affiliation":[]},{"given":"Akshay","family":"Agrawal","sequence":"additional","affiliation":[]},{"given":"Stephen","family":"Boyd","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,17]]},"reference":[{"key":"1933_CR1","unstructured":"Simkin, M.: The number of $$n$$-queens configurations (2021). arXiv:2107.13460 [math.CO]"},{"issue":"1","key":"1933_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.disc.2007.12.043","volume":"309","author":"J Bell","year":"2009","unstructured":"Bell, J., Stevens, B.: A survey of known results and research areas for $$n$$-queens. Discret. Math. 309(1), 1\u201331 (2009)","journal-title":"Discret. Math."},{"key":"1933_CR3","unstructured":"Luria, Z.: New bounds on the number of $$n$$-queens configurations (2017). arXiv:1705.05225 [math.CO]"},{"key":"1933_CR4","doi-asserted-by":"crossref","unstructured":"Luria, Z., Simkin, M.: A lower bound for the $$n$$-queens problem (2021). arXiv:2105.11431 [math.CO]","DOI":"10.1137\/1.9781611977073.86"},{"key":"1933_CR5","unstructured":"Knuth, D.: Xqueens and Xqueenons (2021). https:\/\/cs.stanford.edu\/~knuth\/papers\/Xqueens-and-Xqueenons.pdf"},{"key":"1933_CR6","doi-asserted-by":"publisher","first-page":"016703","DOI":"10.1103\/PhysRevE.79.016703","volume":"79","author":"C Zhang","year":"2009","unstructured":"Zhang, C., Ma, J.: Counting solutions for the $$n$$ -queens and Latin-square problems by Monte Carlo simulations. Phys. Rev. E. Stat. Nonlinear Soft Matter. Phys. 79, 016703 (2009)","journal-title":"Phys. Rev. E. Stat. Nonlinear Soft Matter. Phys."},{"key":"1933_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"key":"1933_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/9781108583664","volume-title":"Introduction to Applied Linear Algebra: Vectors, Matrices, and Least Squares","author":"S Boyd","year":"2018","unstructured":"Boyd, S., Vandenberghe, L.: Introduction to Applied Linear Algebra: Vectors, Matrices, and Least Squares. Cambridge University Press, Cambridge (2018)"},{"key":"1933_CR9","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.: Numerical Optimization. Springer, Berlin (2006)"},{"key":"1933_CR10","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718003","volume-title":"Iterative Methods for Sparse Linear Systems","author":"Y Saad","year":"2003","unstructured":"Saad, Y.: Iterative Methods for Sparse Linear Systems. SIAM, Philadelphia (2003)"},{"issue":"6","key":"1933_CR11","doi-asserted-by":"publisher","first-page":"409","DOI":"10.6028\/jres.049.044","volume":"49","author":"M Hestenes","year":"1952","unstructured":"Hestenes, M., Stiefel, E.: Methods of conjugate gradients for solving linear systems. J. Natl. Bureau Stand. 49(6), 409\u20134361 (1952)","journal-title":"J. Natl. Bureau Stand."},{"issue":"4","key":"1933_CR12","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1137\/0712047","volume":"12","author":"C Paige","year":"1975","unstructured":"Paige, C., Saunders, M.: Solution of sparse indefinite systems of linear equations. SIAM J. Numer. Anal. 12(4), 617\u2013629 (1975)","journal-title":"SIAM J. Numer. Anal."},{"key":"1933_CR13","unstructured":"The Sage Developers. SageMath, the Sage Mathematics Software System (Version 9.4), 2021. https:\/\/www.sagemath.org"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01933-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-022-01933-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01933-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,8]],"date-time":"2023-05-08T10:33:50Z","timestamp":1683542030000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-022-01933-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,17]]},"references-count":13,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["1933"],"URL":"https:\/\/doi.org\/10.1007\/s11590-022-01933-2","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2022,9,17]]},"assertion":[{"value":"17 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 September 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 September 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}