{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T18:57:36Z","timestamp":1757617056198,"version":"3.44.0"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T00:00:00Z","timestamp":1725667200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T00:00:00Z","timestamp":1725667200000},"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":["J Syst Sci Complex"],"published-print":{"date-parts":[[2025,10]]},"DOI":"10.1007\/s11424-024-3366-y","type":"journal-article","created":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T03:02:03Z","timestamp":1725678123000},"page":"2252-2271","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Global Optimization for Heilbronn Problem of Convex Polygons Based on Bilinear Matrix Inequalities Solving"],"prefix":"10.1007","volume":"38","author":[{"given":"Niuniu","family":"Qi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lydia","family":"Dehbi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Banglong","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhengfeng","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenbing","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,9,7]]},"reference":[{"key":"3366_CR1","volume-title":"Unsolved Problems in Geometry: Unsolved Problems in Intuitive Mathematics","author":"H T Croft","year":"2012","unstructured":"Croft H T, Falconer K, and Guy R K, Unsolved Problems in Geometry: Unsolved Problems in Intuitive Mathematics, Springer Science and Business Media, Berlin, 2012."},{"issue":"1","key":"3366_CR2","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1137\/0214011","volume":"14","author":"J E Boyce","year":"1985","unstructured":"Boyce J E, Dobkin D P, Drysdale R L, et al., Finding extremal polygons, SIAM J. Comput., 1985, 14(1): 134\u2013147.","journal-title":"SIAM J. Comput."},{"key":"3366_CR3","first-page":"83","volume-title":"Proceedings of the Third Annual ACM-SIAM Symposium on Discrete Algorithms","author":"D Eppstein","year":"1992","unstructured":"Eppstein D, New algorithms for minimum area k-gons, Proceedings of the Third Annual ACM-SIAM Symposium on Discrete Algorithms, Ed. by Prederickson G N, Florida, 1992, 83\u201388."},{"issue":"1","key":"3366_CR4","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BF02187823","volume":"7","author":"D Eppstein","year":"1992","unstructured":"Eppstein D, Overmars M H, Rote G, et al., Finding minimum area k-gons, Discret. Comput. Geom., 1992, 7(1): 45\u201358.","journal-title":"Discret. Comput. Geom."},{"key":"3366_CR5","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-030-63920-4_9","volume-title":"Dynamic Programming Multi-Objective Combinatorial Optimization","author":"M Mankowski","year":"2021","unstructured":"Mankowski M and Moshkov M, Convex polygon triangulation, Dynamic Programming Multi-Objective Combinatorial Optimization, Eds. by Mankowski M and Moshkov M, Springer, Berlin, 2021, 99\u2013109."},{"issue":"2","key":"3366_CR6","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s10898-006-9065-5","volume":"38","author":"C Audet","year":"2007","unstructured":"Audet C, Hansen P, and Messine F, Extremal problems for convex polygons, J. Glob. Optim., 2007, 38(2): 163\u2013179.","journal-title":"J. Glob. Optim."},{"key":"3366_CR7","doi-asserted-by":"publisher","unstructured":"Nikonorov Y G and Nikonorova O Y, Some extremal problems for polygons in the euclidean plane, 2022, DOI: https:\/\/doi.org\/10.1007\/s00010-023-00991-w, arXiv: 2209.05940.","DOI":"10.1007\/s00010-023-00991-w"},{"key":"3366_CR8","volume-title":"Research Problems in Discrete Geometry","author":"P Brass","year":"2005","unstructured":"Brass P, Moser W O J, and Pach J, Research Problems in Discrete Geometry, Springer, Berlin, 2005."},{"issue":"6","key":"3366_CR9","doi-asserted-by":"publisher","first-page":"2452","DOI":"10.1007\/s11424-022-1220-7","volume":"35","author":"L Dehbi","year":"2022","unstructured":"Dehbi L and Zeng Z B, Heilbronn\u2019s problem of eight points in the square, Journal of Systems Science & Complexity, 2022, 35(6): 2452\u20132480.","journal-title":"Journal of Systems Science & Complexity"},{"key":"3366_CR10","unstructured":"Cohen A, Pohoata C, and Zakharov D, A new upper bound for the Heilbronn triangle problem, 2023, DOI: 10.48550, arXiv: 2305.18253."},{"key":"3366_CR11","first-page":"196","volume-title":"Automated Deduction in Geometry \u2014 7th International Workshop","author":"Z B Zeng","year":"2008","unstructured":"Zeng Z B and Chen L, On the Heilbronn optimal configuration of seven points in the square, Automated Deduction in Geometry \u2014 7th International Workshop, Eds. by Sturm T and Zengler C, Shanghai, 2008, 196\u2013224."},{"issue":"4","key":"3366_CR12","first-page":"503","volume":"13","author":"L Yang","year":"1992","unstructured":"Yang L, Zhang J Z, and Zeng Z B, On the conjecture and computing for exact values of the first several Heilbronn numbers, Chin. Ann. Math. (A), 1992, 13(4): 503\u2013515.","journal-title":"Chin. Ann. Math. (A)"},{"key":"3366_CR13","volume-title":"International Symposium on Computational Geometry","author":"A Hubard","year":"2023","unstructured":"Hubard A and Suk A, Disjoint faces in drawings of the complete graph and topological heilbronn problems, International Symposium on Computational Geometry, Eds. by Chambers E W and Gudmundsson J, Texas, 2023."},{"issue":"1\u20133","key":"3366_CR14","first-page":"7","volume":"283","author":"G Barequet","year":"2004","unstructured":"Barequet G, The on-line Heilbronn\u2019s triangle problem, Discret. Comput. Geom., 2004, 283(1\u20133): 7\u201314.","journal-title":"Discret. Comput. Geom."},{"issue":"3","key":"3366_CR15","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1002\/rsa.21109","volume":"62","author":"F S Benevides","year":"2023","unstructured":"Benevides F S, Hoppen C, Lefmann H, et al., Heilbronn triangle-type problems in the unit square [0, 1]2, Random Struct. Algorithms, 2023, 62(3): 585\u2013599.","journal-title":"Random Struct. Algorithms"},{"key":"3366_CR16","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-1-4613-3557-3_13","volume-title":"Minimax and Applications","author":"A W M Dress","year":"1995","unstructured":"Dress A W M, Yang L, and Zeng Z B, Heilbronn problem for six points in a planar convex body, Minimax and Applications, Eds. by Du D Z and Pardalos P M, Springer, Berlin, 1995, 173\u2013190."},{"key":"3366_CR17","volume-title":"Maple in Mathematics Education and Research \u2014 Third Maple Conference","author":"Z B Zeng","year":"2019","unstructured":"Zeng Z B, Lu J, Dehbi L, et al., A heilbronn type inequality for plane nonagons, Maple in Mathematics Education and Research \u2014 Third Maple Conference, Eds. by Gerhard J and Kotsireas I S, Ontario, 2019."},{"key":"3366_CR18","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1145\/1244002.1244172","volume-title":"Proceedings of the 2007 ACM Symposium on Applied Computing","author":"Z B Zeng","year":"2007","unstructured":"Zeng Z B and Shan M J, Semi-mechanization method for a unsolved optimization problem in combinatorial geometry, Proceedings of the 2007 ACM Symposium on Applied Computing, Eds. by Cho Y, Wainwright R L, Haddad H, et al., Seoul, 2007, 762\u2013766."},{"key":"3366_CR19","first-page":"3252","volume-title":"Conference on Decision and Control","author":"Y Wang","year":"2016","unstructured":"Wang Y and Rajamani R, Feasibility analysis of the bilinear matrix inequalities with an application to multi-objective nonlinear observer design, Conference on Decision and Control, Las Vegas, 2016, 3252\u20133257."},{"key":"3366_CR20","first-page":"281","volume":"13","author":"J Bergstra","year":"2012","unstructured":"Bergstra J and Bengio Y, Random search for hyper-parameter optimization, J. Mach. Learn. Res., 2012, 13: 281\u2013305.","journal-title":"J. Mach. Learn. Res."},{"key":"3366_CR21","doi-asserted-by":"publisher","first-page":"78320","DOI":"10.1109\/ACCESS.2022.3193396","volume":"10","author":"K Kassoul","year":"2022","unstructured":"Kassoul K, Zufferey N, Cheikhrouhou N, et al., Exponential particle swarm optimization for global optimization, IEEE Access, 2022, 10: 78320\u201378344.","journal-title":"IEEE Access"},{"issue":"1","key":"3366_CR22","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s10107-021-01680-9","volume":"196","author":"C J Nohra","year":"2022","unstructured":"Nohra C J, Raghunathan A U, and Sahinidis N V, SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs, Math. Program., 2022, 196(1): 203\u2013233.","journal-title":"Math. Program."},{"issue":"2","key":"3366_CR23","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10898-021-00999-z","volume":"81","author":"C Lu","year":"2021","unstructured":"Lu C and Deng Z B, A branch-and-bound algorithm for solving max-k-cut problem, J. Glob. Optim., 2021, 81(2): 367\u2013389.","journal-title":"J. Glob. Optim."},{"issue":"1","key":"3366_CR24","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1023\/A:1011224403708","volume":"19","author":"M Fukuda","year":"2001","unstructured":"Fukuda M and Kojima M, Branch-and-cut algorithms for the bilinear matrix inequality eigenvalue problem, Comput. Optim. Appl., 2001, 19(1): 79\u2013105.","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"3366_CR25","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF01099648","volume":"7","author":"K C Goh","year":"1995","unstructured":"Goh K C, Safonov M G, and Papavassilopoulos G P, Global optimization for the biaffine matrix inequality problem, J. Glob. Optim., 1995, 7(4): 365\u2013380.","journal-title":"J. Glob. Optim."},{"issue":"7","key":"3366_CR26","first-page":"701","volume":"33","author":"S Takano","year":"1997","unstructured":"Takano S, Watanabe T, and Yasuda K, Branch and bound technique for global solution of BMI, J-STAGE., 1997, 33(7): 701\u2013708.","journal-title":"J-STAGE."}],"container-title":["Journal of Systems Science and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-024-3366-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11424-024-3366-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-024-3366-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T22:10:46Z","timestamp":1757110246000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11424-024-3366-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,7]]},"references-count":26,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,10]]}},"alternative-id":["3366"],"URL":"https:\/\/doi.org\/10.1007\/s11424-024-3366-y","relation":{},"ISSN":["1009-6124","1559-7067"],"issn-type":[{"type":"print","value":"1009-6124"},{"type":"electronic","value":"1559-7067"}],"subject":[],"published":{"date-parts":[[2024,9,7]]},"assertion":[{"value":"10 September 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 November 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 September 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare no conflict of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}]}}