{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T11:44:34Z","timestamp":1762775074281,"version":"build-2065373602"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-21-CE48-0006-01 HYPERSPACE, ANR-23-IACL-0008 PR[AI]RIE-PSAI, ANR-22-CE91-0007 EAGLES"],"award-info":[{"award-number":["ANR-21-CE48-0006-01 HYPERSPACE, ANR-23-IACL-0008 PR[AI]RIE-PSAI, ANR-22-CE91-0007 EAGLES"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["ERC grant CASPER 101162889"],"award-info":[{"award-number":["ERC grant CASPER 101162889"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,28]]},"DOI":"10.1145\/3747199.3747570","type":"proceedings-article","created":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T10:51:17Z","timestamp":1762771877000},"page":"267-276","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Solving generic parametric linear matrix inequalities"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4556-6935","authenticated-orcid":false,"given":"Simone","family":"Naldi","sequence":"first","affiliation":[{"name":"Universit\u00e9 de Limoges, CNRS, XLIM, Limoges, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9463-1257","authenticated-orcid":false,"given":"Mohab","family":"Safey El Din","sequence":"additional","affiliation":[{"name":"Sorbonne Universit\u00e9, CNRS, LIP6, Paris, France"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-7305-6474","authenticated-orcid":false,"given":"Adrien","family":"Taylor","sequence":"additional","affiliation":[{"name":"Inria, \u00c9cole normale sup\u00e9rieure, PSL Research University, Paris, France"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-4299-2837","authenticated-orcid":false,"given":"Weijia","family":"Wang","sequence":"additional","affiliation":[{"name":"Sorbonne Universit\u00e9, CNRS, LIP6, Paris, France"}]}],"member":"320","published-online":{"date-parts":[[2025,11,10]]},"reference":[{"key":"e_1_3_3_1_2_2","volume-title":"Handbook on semidefinite, conic and polynomial optimization","author":"Anjos M.\u00a0F.","year":"2011","unstructured":"M.\u00a0F. Anjos and J.\u00a0B. Lasserre. 2011. Handbook on semidefinite, conic and polynomial optimization. Springer Science & Business Media."},{"key":"e_1_3_3_1_3_2","doi-asserted-by":"crossref","unstructured":"B. Bank M. Giusti J. Heintz M. Safey El\u00a0Din and \u00c9. Schost. 2010. On the geometry of polar varieties. Applicable Algebra in Engineering Communication and Computing 21 1 (2010) 33\u201383.","DOI":"10.1007\/s00200-009-0117-1"},{"key":"e_1_3_3_1_4_2","doi-asserted-by":"crossref","unstructured":"S. Basu R. Pollack and M.-F. Roy. 1996. On the combinatorial and algebraic complexity of quantifier elimination. J. ACM 43 6 (Nov. 1996) 1002\u20131045. doi:https:\/\/doi.org\/10.1145\/235809.235813","DOI":"10.1145\/235809.235813"},{"key":"e_1_3_3_1_5_2","volume-title":"Algorithms in Real Algebraic Geometry","author":"Basu S.","year":"2007","unstructured":"S. Basu, R. Pollack, and M.-F. Roy. 2007. Algorithms in Real Algebraic Geometry. Springer Berlin Heidelberg."},{"key":"e_1_3_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/3452143.3465545"},{"key":"e_1_3_3_1_7_2","volume-title":"Determinantal rings","author":"Bruns W.","year":"2006","unstructured":"W. Bruns and U. Vetter. 2006. Determinantal rings. Vol.\u00a01327. Springer."},{"key":"e_1_3_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/74540.74556"},{"key":"e_1_3_3_1_9_2","doi-asserted-by":"crossref","unstructured":"C. Chen and M. Moreno Maza. 2016. Quantifier elimination by cylindrical algebraic decomposition based on regular chains. Journal of Symbolic Computation 75 (2016) 74\u201393. doi:https:\/\/doi.org\/10.1016\/j.jsc.2015.11.008 Special issue on the conference ISSAC 2014: Symbolic computation and computer algebra.","DOI":"10.1016\/j.jsc.2015.11.008"},{"key":"e_1_3_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.5555\/646589.697342"},{"key":"e_1_3_3_1_11_2","doi-asserted-by":"crossref","unstructured":"Y. Drori and M. Teboulle. 2014. Performance of first-order methods for smooth convex minimization: a novel approach. Mathematical Programming 145 1 (2014) 451\u2013482.","DOI":"10.1007\/s10107-013-0653-0"},{"key":"e_1_3_3_1_12_2","volume-title":"Commutative algebra: with a view toward algebraic geometry","author":"Eisenbud D.","year":"2013","unstructured":"D. Eisenbud. 2013. Commutative algebra: with a view toward algebraic geometry. Springer Science & Business Media."},{"key":"e_1_3_3_1_13_2","doi-asserted-by":"crossref","unstructured":"J. Elliott M. Giesbrecht and \u00c9. Schost. 2023. Bit complexity for computing one point in each connected component of a smooth real algebraic set. Journal of Symbolic Computation 116 (2023) 72\u201397.","DOI":"10.1016\/j.jsc.2022.08.010"},{"key":"e_1_3_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/3666000.3669718"},{"key":"e_1_3_3_1_15_2","doi-asserted-by":"crossref","unstructured":"D.\u00a0Yu Grigor\u2019ev. 1988. Complexity of deciding Tarski algebra. Journal of Symbolic Computation 5 1 (1988) 65\u2013108. doi:https:\/\/doi.org\/10.1016\/S0747-7171(88)80006-3","DOI":"10.1016\/S0747-7171(88)80006-3"},{"key":"e_1_3_3_1_16_2","doi-asserted-by":"crossref","unstructured":"J. Heintz. 1983. Definability and fast quantifier elimination in algebraically closed fields. Theoretical Computer Science 24 3 (1983) 239\u2013277.","DOI":"10.1016\/0304-3975(83)90002-6"},{"key":"e_1_3_3_1_17_2","doi-asserted-by":"crossref","unstructured":"D. Henrion S. Naldi and M. Safey El\u00a0Din. 2016. Exact algorithms for linear matrix inequalities. SIAM Journal on Optimization 26 4 (2016) 2512\u20132539.","DOI":"10.1137\/15M1036543"},{"key":"e_1_3_3_1_18_2","doi-asserted-by":"crossref","unstructured":"D. Henrion S. Naldi and M. Safey El\u00a0Din. 2016. Real root finding for determinants of linear matrices. Journal of symbolic computation 74 (2016) 205\u2013238.","DOI":"10.1016\/j.jsc.2015.06.010"},{"key":"e_1_3_3_1_19_2","doi-asserted-by":"crossref","unstructured":"C. Hermite. 1856. Extrait d\u2019une lettre de Mr. Ch. Hermite de Paris \u00e0 Mr. Borchardt de Berlin sur le nombre des racines d\u2019une \u00e9quation alg\u00e9brique comprises entre des limites donn\u00e9es.","DOI":"10.1515\/crll.1856.52.39"},{"key":"e_1_3_3_1_20_2","doi-asserted-by":"crossref","unstructured":"M. Kalkbrener. 1997. On the stability of Gr\u00f6bner bases under specializations. Journal of Symbolic Computation 24 1 (1997) 51\u201358.","DOI":"10.1006\/jsco.1997.0113"},{"key":"e_1_3_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/3452143.3465546"},{"key":"e_1_3_3_1_22_2","doi-asserted-by":"crossref","unstructured":"H.\u00a0P. Le and M. Safey El\u00a0Din. 2022. Solving parametric systems of polynomial equations over the reals through Hermite matrices. Journal of Symbolic Computation 112 (2022) 25\u201361.","DOI":"10.1016\/j.jsc.2021.12.002"},{"key":"e_1_3_3_1_23_2","unstructured":"T.\u00a0S. Motzkin. 1967. The arithmetic-geometric inequality. Inequalities (Proc. Sympos. Wright-Patterson Air Force Base Ohio 1965) 205 (1967) 54."},{"key":"e_1_3_3_1_24_2","unstructured":"R.\u00a0M. Robinson. 1973. Some definite polynomials which are not sums of squares of real polynomials. Selected questions of algebra and logic (1973) 264\u2013282."},{"key":"e_1_3_3_1_25_2","doi-asserted-by":"crossref","unstructured":"E.\u00a0K. Ryu A.\u00a0B. Taylor C. Bergeling and P. Giselsson. 2020. Operator splitting performance estimation: tight contraction factors and optimal parameter selection. SIAM Journal on Optimization 30 3 (2020) 2251\u20132271.","DOI":"10.1137\/19M1304854"},{"key":"e_1_3_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/860854.860901"},{"key":"e_1_3_3_1_27_2","doi-asserted-by":"crossref","unstructured":"M. Safey El\u00a0Din and \u00c9. Schost. 2017. A nearly optimal algorithm for deciding connectivity queries in smooth and bounded real algebraic sets. Journal of the ACM (JACM) 63 6 (2017) 1\u201337.","DOI":"10.1145\/2996450"},{"key":"e_1_3_3_1_28_2","doi-asserted-by":"crossref","unstructured":"\u00c9. Schost. 2003. Computing parametric geometric resolutions. Applicable Algebra in Engineering Communication and Computing 13 5 (2003) 349\u2013393.","DOI":"10.1007\/s00200-002-0109-x"},{"key":"e_1_3_3_1_29_2","volume-title":"Basic algebraic geometry","author":"Shafarevich I.\u00a0R.","year":"1994","unstructured":"I.\u00a0R. Shafarevich and M. Reid. 1994. Basic algebraic geometry. Springer."},{"key":"e_1_3_3_1_30_2","doi-asserted-by":"crossref","unstructured":"A.\u00a0W. Strzebo\u0144ski. 2006. Cylindrical algebraic decomposition using validated numerics. Journal of Symbolic Computation 41 9 (2006) 1021\u20131038.","DOI":"10.1016\/j.jsc.2006.06.004"},{"key":"e_1_3_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.1525\/9780520348097"},{"key":"e_1_3_3_1_32_2","doi-asserted-by":"crossref","unstructured":"A.\u00a0B. Taylor J.\u00a0M. Hendrickx and F. Glineur. 2017. Exact worst-case performance of first-order methods for composite convex optimization. SIAM Journal on Optimization 27 3 (2017) 1283\u20131313.","DOI":"10.1137\/16M108104X"},{"key":"e_1_3_3_1_33_2","doi-asserted-by":"crossref","unstructured":"A.\u00a0B. Taylor J.\u00a0M. Hendrickx and F. Glineur. 2017. Smooth strongly convex interpolation and exact worst-case performance of first-order methods. Mathematical Programming 161 (2017) 307\u2013345.","DOI":"10.1007\/s10107-016-1009-3"}],"event":{"name":"ISSAC '25: International Symposium on Symbolic and Algebraic Computation","sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"location":"Guanajuato Mexico","acronym":"ISSAC '25"},"container-title":["Proceedings of the 2025 International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3747199.3747570","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T11:40:34Z","timestamp":1762774834000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3747199.3747570"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,28]]},"references-count":32,"alternative-id":["10.1145\/3747199.3747570","10.1145\/3747199"],"URL":"https:\/\/doi.org\/10.1145\/3747199.3747570","relation":{},"subject":[],"published":{"date-parts":[[2025,7,28]]},"assertion":[{"value":"2025-11-10","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}