{"id":"https://openalex.org/W2138505091","doi":"https://doi.org/10.1007/s10107-004-0564-1","title":"Local Minima and Convergence in Low-Rank Semidefinite Programming","display_name":"Local Minima and Convergence in Low-Rank Semidefinite Programming","publication_year":2004,"publication_date":"2004-12-29","ids":{"openalex":"https://openalex.org/W2138505091","doi":"https://doi.org/10.1007/s10107-004-0564-1","mag":"2138505091"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-004-0564-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-004-0564-1","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5002663715","display_name":"Samuel Burer","orcid":"https://orcid.org/0000-0001-5886-458X"},"institutions":[{"id":"https://openalex.org/I126307644","display_name":"University of Iowa","ror":"https://ror.org/036jqmy94","country_code":"US","type":"education","lineage":["https://openalex.org/I126307644"]},{"id":"https://openalex.org/I4210155590","display_name":"Management Sciences (United States)","ror":"https://ror.org/05shz5j84","country_code":"US","type":"company","lineage":["https://openalex.org/I4210155590"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Samuel Burer","raw_affiliation_strings":["Department of Management Sciences, University of Iowa, Iowa City, IA, 52242-1000, USA","Department of Management Sciences, University of Iowa, 52242-1000, Iowa City, IA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Management Sciences, University of Iowa, Iowa City, IA, 52242-1000, USA","institution_ids":["https://openalex.org/I126307644","https://openalex.org/I4210155590"]},{"raw_affiliation_string":"Department of Management Sciences, University of Iowa, 52242-1000, Iowa City, IA, USA","institution_ids":["https://openalex.org/I126307644"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108765688","display_name":"Renato D. C. Monteiro","orcid":null},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Renato D.C. Monteiro","raw_affiliation_strings":["School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia, 30332, USA","School of Industrial and Systems Engineering, Georgia Institute of Technology, 30332, Atlanta, Georgia, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia, 30332, USA","institution_ids":["https://openalex.org/I130701444"]},{"raw_affiliation_string":"School of Industrial and Systems Engineering, Georgia Institute of Technology, 30332, Atlanta, Georgia, USA#TAB#","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5002663715"],"corresponding_institution_ids":["https://openalex.org/I126307644","https://openalex.org/I4210155590"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":7.6881,"has_fulltext":false,"cited_by_count":372,"citation_normalized_percentile":{"value":0.98129593,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"103","issue":"3","first_page":"427","last_page":"444"},"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","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.8820258378982544},{"id":"https://openalex.org/keywords/maxima-and-minima","display_name":"Maxima and minima","score":0.847082257270813},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7864463329315186},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.6974668502807617},{"id":"https://openalex.org/keywords/semidefinite-embedding","display_name":"Semidefinite embedding","score":0.6802379488945007},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5874081254005432},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5477780699729919},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5283761024475098},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4670283794403076},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.4292466640472412},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.41246938705444336},{"id":"https://openalex.org/keywords/quadratically-constrained-quadratic-program","display_name":"Quadratically constrained quadratic program","score":0.3157425820827484},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1431640386581421}],"concepts":[{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.8820258378982544},{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.847082257270813},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7864463329315186},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.6974668502807617},{"id":"https://openalex.org/C206818286","wikidata":"https://www.wikidata.org/wiki/Q7449403","display_name":"Semidefinite embedding","level":4,"score":0.6802379488945007},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5874081254005432},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5477780699729919},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5283761024475098},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4670283794403076},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.4292466640472412},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.41246938705444336},{"id":"https://openalex.org/C65148998","wikidata":"https://www.wikidata.org/wiki/Q7268373","display_name":"Quadratically constrained quadratic program","level":3,"score":0.3157425820827484},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1431640386581421},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s10107-004-0564-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-004-0564-1","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.100.7257","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.100.7257","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.optimization-online.org/DB_FILE/2003/09/740.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.371.6438","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.371.6438","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www2.isye.gatech.edu/~monteiro/publications/tech_reports/lr2.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.86.1757","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.86.1757","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www2.isye.gatech.edu/~monteiro/publications/tech_reports/lr.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W34399546","https://openalex.org/W391578156","https://openalex.org/W572922989","https://openalex.org/W1553621070","https://openalex.org/W1553702074","https://openalex.org/W1595903022","https://openalex.org/W1985984741","https://openalex.org/W1986591158","https://openalex.org/W2005102197","https://openalex.org/W2009832821","https://openalex.org/W2012110988","https://openalex.org/W2024457515","https://openalex.org/W2025486357","https://openalex.org/W2035412546","https://openalex.org/W2049371785","https://openalex.org/W2051306216","https://openalex.org/W2062068908","https://openalex.org/W2065110770","https://openalex.org/W2075379600","https://openalex.org/W2092162155","https://openalex.org/W2096247314","https://openalex.org/W2128202699","https://openalex.org/W2133184112","https://openalex.org/W2143075842","https://openalex.org/W2148016452","https://openalex.org/W2164948865","https://openalex.org/W2495457432","https://openalex.org/W2610857016","https://openalex.org/W4210953350","https://openalex.org/W4249667877","https://openalex.org/W4253214256"],"related_works":["https://openalex.org/W2348903644","https://openalex.org/W2975050997","https://openalex.org/W2737505353","https://openalex.org/W2912522929","https://openalex.org/W2364528045","https://openalex.org/W2352839224","https://openalex.org/W1653317167","https://openalex.org/W1989828432","https://openalex.org/W2371590971","https://openalex.org/W2000645105"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":10},{"year":2025,"cited_by_count":21},{"year":2024,"cited_by_count":26},{"year":2023,"cited_by_count":21},{"year":2022,"cited_by_count":18},{"year":2021,"cited_by_count":35},{"year":2020,"cited_by_count":27},{"year":2019,"cited_by_count":34},{"year":2018,"cited_by_count":27},{"year":2017,"cited_by_count":23},{"year":2016,"cited_by_count":25},{"year":2015,"cited_by_count":18},{"year":2014,"cited_by_count":19},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":11}],"updated_date":"2026-07-31T08:31:51.225901","created_date":"2025-10-10T00:00:00"}