{"id":"https://openalex.org/W2268798953","doi":"https://doi.org/10.1145/2930889.2930925","title":"Solving Rank-Constrained Semidefinite Programs in Exact Arithmetic","display_name":"Solving Rank-Constrained Semidefinite Programs in Exact Arithmetic","publication_year":2016,"publication_date":"2016-07-19","ids":{"openalex":"https://openalex.org/W2268798953","doi":"https://doi.org/10.1145/2930889.2930925","mag":"2268798953"},"language":"en","primary_location":{"id":"doi:10.1145/2930889.2930925","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2930889.2930925","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.science/hal-01363339","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5014288326","display_name":"Simone Naldi","orcid":"https://orcid.org/0000-0002-4556-6935"},"institutions":[{"id":"https://openalex.org/I9267121","display_name":"Fields Institute for Research in Mathematical Sciences","ror":"https://ror.org/03zzj3f20","country_code":"CA","type":"facility","lineage":["https://openalex.org/I185261750","https://openalex.org/I9267121"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Simone Naldi","raw_affiliation_strings":["Fields Institute for Research in Mathematical Sciences, Toronto, ON, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Fields Institute for Research in Mathematical Sciences, Toronto, ON, Canada","institution_ids":["https://openalex.org/I9267121"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5014288326"],"corresponding_institution_ids":["https://openalex.org/I9267121"],"apc_list":null,"apc_paid":null,"fwci":1.3509,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.7759901,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"357","last_page":"364"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11435","display_name":"Polynomial and algebraic computation","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.7510571479797363},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.6017311811447144},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.594753086566925},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.553617000579834},{"id":"https://openalex.org/keywords/quadratically-constrained-quadratic-program","display_name":"Quadratically constrained quadratic program","score":0.5313946008682251},{"id":"https://openalex.org/keywords/conic-optimization","display_name":"Conic optimization","score":0.5111530423164368},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4758419990539551},{"id":"https://openalex.org/keywords/semidefinite-embedding","display_name":"Semidefinite embedding","score":0.4511486887931824},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4507007598876953},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.4390602111816406},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.41726452112197876},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4040836989879608},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33599886298179626},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.2779877781867981},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.2690507471561432},{"id":"https://openalex.org/keywords/convex-analysis","display_name":"Convex analysis","score":0.2160269021987915},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.18649807572364807}],"concepts":[{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.7510571479797363},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.6017311811447144},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.594753086566925},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.553617000579834},{"id":"https://openalex.org/C65148998","wikidata":"https://www.wikidata.org/wiki/Q7268373","display_name":"Quadratically constrained quadratic program","level":3,"score":0.5313946008682251},{"id":"https://openalex.org/C79187972","wikidata":"https://www.wikidata.org/wiki/Q2654791","display_name":"Conic optimization","level":5,"score":0.5111530423164368},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4758419990539551},{"id":"https://openalex.org/C206818286","wikidata":"https://www.wikidata.org/wiki/Q7449403","display_name":"Semidefinite embedding","level":4,"score":0.4511486887931824},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4507007598876953},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.4390602111816406},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.41726452112197876},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4040836989879608},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33599886298179626},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.2779877781867981},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.2690507471561432},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.2160269021987915},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.18649807572364807},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2930889.2930925","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2930889.2930925","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-01363339v1","is_oa":true,"landing_page_url":"https://hal.science/hal-01363339","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"International Symposium on Symbolic and Algebraic Computation (2016), Jul 2016, Waterloo, Canada. ⟨10.1145/2930889.2930925⟩","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-01363339v1","is_oa":true,"landing_page_url":"https://hal.science/hal-01363339","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"International Symposium on Symbolic and Algebraic Computation (2016), Jul 2016, Waterloo, Canada. ⟨10.1145/2930889.2930925⟩","raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1495410784","https://openalex.org/W1496909474","https://openalex.org/W1559760555","https://openalex.org/W1590002045","https://openalex.org/W1632601927","https://openalex.org/W1828839365","https://openalex.org/W1964603869","https://openalex.org/W1967184028","https://openalex.org/W1967344706","https://openalex.org/W1982216340","https://openalex.org/W1985123706","https://openalex.org/W1986124084","https://openalex.org/W2003232014","https://openalex.org/W2011693299","https://openalex.org/W2039539620","https://openalex.org/W2058209380","https://openalex.org/W2059522106","https://openalex.org/W2060414131","https://openalex.org/W2063194632","https://openalex.org/W2098958718","https://openalex.org/W2100440346","https://openalex.org/W2117819179","https://openalex.org/W2166998199","https://openalex.org/W2170042437","https://openalex.org/W2212277022","https://openalex.org/W2912522929","https://openalex.org/W2953135863","https://openalex.org/W3210839039","https://openalex.org/W4299482635","https://openalex.org/W6638597717","https://openalex.org/W7047715039"],"related_works":["https://openalex.org/W2348903644","https://openalex.org/W2912522929","https://openalex.org/W2734667871","https://openalex.org/W2461836650","https://openalex.org/W2941716933","https://openalex.org/W4231773446","https://openalex.org/W2771160919","https://openalex.org/W1544933314","https://openalex.org/W2952841129","https://openalex.org/W4224903435"],"abstract_inverted_index":{"We":[0,99,164],"consider":[1],"the":[2,14,21,25,32,120,127,130,133,138,143,153],"problem":[3,128],"of":[4,13,16,126,132,145],"minimizing":[5],"a":[6,39,46],"linear":[7],"function":[8],"over":[9],"an":[10,93,101],"affine":[11],"section":[12],"cone":[15],"positive":[17],"semidefinite":[18,47,107],"matrices,":[19],"with":[20],"additional":[22],"constraint":[23,34],"that":[24,158],"feasible":[26,134],"matrix":[27,135],"has":[28],"prescribed":[29],"rank.":[30],"When":[31],"rank":[33],"is":[35,38,45,111,136,140],"active,":[36],"this":[37,80,89],"non-convex":[40],"optimization":[41,70,122],"problem,":[42,81],"otherwise":[43],"it":[44,167],"program.":[48],"Both":[49],"find":[50],"numerous":[51],"applications":[52],"especially":[53],"in":[54,63,88,142,168],"systems":[55],"control":[56],"theory":[57],"and":[58,170],"combinatorial":[59],"optimization,":[60],"but":[61],"even":[62],"more":[64],"general":[65],"contexts":[66],"such":[67,82],"as":[68,83],"polynomial":[69,141],"or":[71,85],"real":[72],"algebra.":[73],"While":[74],"numerical":[75],"algorithms":[76],"exist":[77],"for":[78,104,124],"solving":[79,105],"interior-point":[84],"Newton-like":[86],"algorithms,":[87],"paper":[90],"we":[91,156],"propose":[92],"approach":[94],"based":[95],"on":[96,114,152],"symbolic":[97],"computation.":[98],"design":[100],"exact":[102],"algorithm":[103,148],"rank-constrained":[106],"programs,":[108],"whose":[109],"complexity":[110,139],"essentially":[112],"quadratic":[113],"natural":[115],"degree":[116],"bounds":[117],"associated":[118],"to":[119],"given":[121],"problem:":[123],"subfamilies":[125],"where":[129],"size":[131],"fixed,":[137],"number":[144],"variables.":[146],"The":[147],"works":[149],"under":[150],"assumptions":[151,160],"input":[154],"data:":[155],"prove":[157],"these":[159],"are":[161],"generically":[162],"satisfied.":[163],"also":[165],"implement":[166],"Maple":[169],"discuss":[171],"practical":[172],"experiments.":[173]},"counts_by_year":[{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}