{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:38:54Z","timestamp":1740145134010,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,5,31]],"date-time":"2022-05-31T00:00:00Z","timestamp":1653955200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,5,31]],"date-time":"2022-05-31T00:00:00Z","timestamp":1653955200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1007\/s11590-022-01887-5","type":"journal-article","created":{"date-parts":[[2022,5,31]],"date-time":"2022-05-31T13:06:18Z","timestamp":1654002378000},"page":"385-397","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Largest small polygons: a sequential convex optimization approach"],"prefix":"10.1007","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1980-5146","authenticated-orcid":false,"given":"Christian","family":"Bingane","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,31]]},"reference":[{"issue":"2","key":"1887_CR1","doi-asserted-by":"publisher","first-page":"175","DOI":"10.4169\/amer.math.monthly.124.2.175","volume":"124","author":"C Audet","year":"2017","unstructured":"Audet, C.: Maximal area of equilateral small polygons. Am. Math. Mon. 124(2), 175\u2013178 (2017). https:\/\/doi.org\/10.4169\/amer.math.monthly.124.2.175","journal-title":"Am. Math. Mon."},{"issue":"1","key":"1887_CR2","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1134\/S1990478909010037","volume":"3","author":"C Audet","year":"2009","unstructured":"Audet, C., Hansen, P., Messine, F.: Ranking small regular polygons by area and by perimeter. J. Appl. Ind. Math. 3(1), 21\u201327 (2009). https:\/\/doi.org\/10.1134\/S1990478909010037","journal-title":"J. Appl. Ind. Math."},{"issue":"1","key":"1887_CR3","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1006\/jcta.2001.3225","volume":"98","author":"C Audet","year":"2002","unstructured":"Audet, C., Hansen, P., Messine, F., Xiong, J.: The largest small octagon. J. Comb. Theory Ser. A 98(1), 46\u201359 (2002). https:\/\/doi.org\/10.1006\/jcta.2001.3225","journal-title":"J. Comb. Theory Ser. A"},{"issue":"1","key":"1887_CR4","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s10898-020-00908-w","volume":"81","author":"C Audet","year":"2021","unstructured":"Audet, C., Hansen, P., Svrtan, D.: Using symbolic calculations to determine largest small polygons. J. Global Optim. 81(1), 261\u2013268 (2021). https:\/\/doi.org\/10.1007\/s10898-020-00908-w","journal-title":"J. Global Optim."},{"unstructured":"Bieri, H.: Ungel\u00f6ste probleme: Zweiter nachtrag zu nr. 12. Elem. Math 16, 105\u2013106 (1961)","key":"1887_CR5"},{"unstructured":"Bingane, C.: OPTIGON: Extremal small polygons. https:\/\/github.com\/cbingane\/optigon (2020)","key":"1887_CR6"},{"unstructured":"CVX Research, Inc.: CVX: MATLAB software for disciplined convex programming, version 2.2. http:\/\/cvxr.com\/cvx (2012)","key":"1887_CR7"},{"issue":"8","key":"1887_CR8","doi-asserted-by":"publisher","first-page":"1515","DOI":"10.1016\/j.jcta.2007.02.006","volume":"114","author":"J Foster","year":"2007","unstructured":"Foster, J., Szabo, T.: Diameter graphs of polygons and the proof of a conjecture of Graham. J. Combin. Theory Ser. A 114(8), 1515\u20131525 (2007). https:\/\/doi.org\/10.1016\/j.jcta.2007.02.006","journal-title":"J. Combin. Theory Ser. A"},{"issue":"2","key":"1887_CR9","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0097-3165(75)90004-7","volume":"18","author":"RL Graham","year":"1975","unstructured":"Graham, R.L.: The largest small hexagon. J. Comb. Theory Ser. A 18(2), 165\u2013170 (1975). https:\/\/doi.org\/10.1016\/0097-3165(75)90004-7","journal-title":"J. Comb. Theory Ser. A"},{"issue":"3","key":"1887_CR10","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1007\/s10898-011-9818-7","volume":"56","author":"D Henrion","year":"2013","unstructured":"Henrion, D., Messine, F.: Finding largest small polygons with GloptiPoly. J. Global Optim. 56(3), 1017\u20131028 (2013). https:\/\/doi.org\/10.1007\/s10898-011-9818-7","journal-title":"J. Global Optim."},{"unstructured":"Sriperumbudur, B.K., Lanckriet, G.R.G.: On the convergence of the concave-convex procedure. In: Bengio, Y., Schuurmans, D., Lafferty, J.D.,\nWilliams, C.K.I., Culotta, A. (eds.) Advances in Neural Information Processing Systems, vol. 22, pp. 1759\u20131767. Curran Associates, Inc. (2009)","key":"1887_CR11"},{"issue":"4","key":"1887_CR12","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1287\/opre.26.4.681","volume":"26","author":"BR Marks","year":"1978","unstructured":"Marks, B.R., Wright, G.P.: A general inner approximation algorithm for nonconvex mathematical programs. Oper. Res. 26(4), 681\u2013683 (1978). https:\/\/doi.org\/10.1287\/opre.26.4.681","journal-title":"Oper. Res."},{"issue":"2","key":"1887_CR13","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s00454-006-1238-y","volume":"36","author":"MJ Mossinghoff","year":"2006","unstructured":"Mossinghoff, M.J.: Isodiametric problems for polygons. Discrete Comput. Geom. 36(2), 363\u2013379 (2006). https:\/\/doi.org\/10.1007\/s00454-006-1238-y","journal-title":"Discrete Comput. Geom."},{"key":"1887_CR14","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-3-030-72040-7_11","volume-title":"Numerical Analysis and Optimization, Springer Proceedings in Mathematics & Statistics","author":"JD Pint\u00e9r","year":"2020","unstructured":"Pint\u00e9r, J.D.: Largest small $$n$$-polygons: numerical optimum estimates for $$n\\ge 6$$. In: Al-Baali, M., Purnama, A., Grandinetti, L. (eds.) Numerical Analysis and Optimization, Springer Proceedings in Mathematics & Statistics. vol. 354, pp. 231\u2013247. Springer International Publishing (2020). https:\/\/doi.org\/10.1007\/978-3-030-72040-7_11"},{"issue":"3","key":"1887_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3390\/mca27030042","volume":"27","author":"JD Pint\u00e9r","year":"2022","unstructured":"Pint\u00e9r, J.D., Kampas, F.J., Castillo, I.: Finding the conjectured sequence of largest small $$n$$-polygons by numerical optimization. Math. Comput. Appl. 27(3), 1\u201310 (2022). https:\/\/doi.org\/10.3390\/mca27030042","journal-title":"Math. Comput. Appl."},{"key":"1887_CR16","first-page":"251","volume":"31","author":"K Reinhardt","year":"1922","unstructured":"Reinhardt, K.: Extremale polygone gegebenen durchmessers. Jahresber. Deutsch. Math.-Verein. 31, 251\u2013270 (1922)","journal-title":"Jahresber. Deutsch. Math.-Verein."},{"unstructured":"Yuan, B.: The Largest Small Hexagon. Master\u2019s thesis, National University of Singapore (2004)","key":"1887_CR17"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01887-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-022-01887-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01887-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,9]],"date-time":"2023-02-09T23:06:11Z","timestamp":1675983971000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-022-01887-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,31]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["1887"],"URL":"https:\/\/doi.org\/10.1007\/s11590-022-01887-5","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2022,5,31]]},"assertion":[{"value":"25 September 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 April 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 May 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}