{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:04:30Z","timestamp":1750309470042,"version":"3.41.0"},"reference-count":8,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T00:00:00Z","timestamp":1725148800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Commun. Comput. Algebra"],"published-print":{"date-parts":[[2024,9]]},"abstract":"<jats:p>We consider the concept of so-called central path in nonlinear optimization that lies at the heart of interior point methods. Using singularity theory and real algebraic geometry, we provide conditions for the existence, convergence, and analyticity of central paths of nonlinear optimization problems. We also prove quantitative bounds on the convergence rate and analyticity of the central path for the special case of semi-definite optimization.<\/jats:p>","DOI":"10.1145\/3717582.3717593","type":"journal-article","created":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T20:41:51Z","timestamp":1739306511000},"page":"97-100","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Semi-Algebraic Structure and Central Paths in Nonlinear Optimization"],"prefix":"10.1145","volume":"58","author":[{"given":"Saugata","family":"Basu","sequence":"first","affiliation":[{"name":"Department of Mathematics, Purdue University, West Lafayette, IN"}]},{"given":"Ali","family":"Mohammad-Nezhad","sequence":"additional","affiliation":[{"name":"Department of Statistics and Operations Research, University of North Carolina at Chapel Hill, Chapel Hill, NC"}]}],"member":"320","published-online":{"date-parts":[[2025,2,11]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/21M1419933"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.aam.2024.102670"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-33099-2"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971316"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/S105262349630009X"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00276-X"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623496299187"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970791"}],"container-title":["ACM Communications in Computer Algebra"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3717582.3717593","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3717582.3717593","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:17:15Z","timestamp":1750295835000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3717582.3717593"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["10.1145\/3717582.3717593"],"URL":"https:\/\/doi.org\/10.1145\/3717582.3717593","relation":{},"ISSN":["1932-2232","1932-2240"],"issn-type":[{"type":"print","value":"1932-2232"},{"type":"electronic","value":"1932-2240"}],"subject":[],"published":{"date-parts":[[2024,9]]},"assertion":[{"value":"2025-02-11","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}