{"id":"https://openalex.org/W1588330761","doi":"https://doi.org/10.1137/s1052623496299187","title":"Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming","display_name":"Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming","publication_year":1998,"publication_date":"1998-02-01","ids":{"openalex":"https://openalex.org/W1588330761","doi":"https://doi.org/10.1137/s1052623496299187","mag":"1588330761"},"language":"en","primary_location":{"id":"doi:10.1137/s1052623496299187","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623496299187","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","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/A5101766226","display_name":"Zhi\u2010Quan Luo","orcid":"https://orcid.org/0000-0003-3995-914X"},"institutions":[{"id":"https://openalex.org/I98251732","display_name":"McMaster University","ror":"https://ror.org/02fa3aq29","country_code":"CA","type":"education","lineage":["https://openalex.org/I98251732"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Zhi-Quan Luo","raw_affiliation_strings":["McMaster university#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"McMaster university#TAB#","institution_ids":["https://openalex.org/I98251732"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025859376","display_name":"J.F. Sturm","orcid":null},"institutions":[{"id":"https://openalex.org/I913958620","display_name":"Erasmus University Rotterdam","ror":"https://ror.org/057w15z03","country_code":"NL","type":"education","lineage":["https://openalex.org/I913958620"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Jos F. Sturm","raw_affiliation_strings":["Erasmus University Rotterdam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Erasmus University Rotterdam","institution_ids":["https://openalex.org/I913958620"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089542160","display_name":"Shuzhong Zhang","orcid":"https://orcid.org/0000-0001-5838-1676"},"institutions":[{"id":"https://openalex.org/I913958620","display_name":"Erasmus University Rotterdam","ror":"https://ror.org/057w15z03","country_code":"NL","type":"education","lineage":["https://openalex.org/I913958620"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Shuzhong Zhang","raw_affiliation_strings":["Erasmus University Rotterdam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Erasmus University Rotterdam","institution_ids":["https://openalex.org/I913958620"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":10.6535,"has_fulltext":false,"cited_by_count":102,"citation_normalized_percentile":{"value":0.98627104,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"8","issue":"1","first_page":"59","last_page":"81"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998999834060669,"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.9998999834060669,"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.9969000220298767,"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.9891999959945679,"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/mathematics","display_name":"Mathematics","score":0.8681796193122864},{"id":"https://openalex.org/keywords/duality-gap","display_name":"Duality gap","score":0.8012135028839111},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.7701407670974731},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.6834487915039062},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.6803014278411865},{"id":"https://openalex.org/keywords/duality","display_name":"Duality (order theory)","score":0.569717288017273},{"id":"https://openalex.org/keywords/quadratic-growth","display_name":"Quadratic growth","score":0.5650659799575806},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5184468626976013},{"id":"https://openalex.org/keywords/semidefinite-embedding","display_name":"Semidefinite embedding","score":0.487648606300354},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.48005637526512146},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.463886559009552},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4593416154384613},{"id":"https://openalex.org/keywords/quadratically-constrained-quadratic-program","display_name":"Quadratically constrained quadratic program","score":0.4158984124660492},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.37010759115219116},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3567289412021637},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3419727683067322},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.31835973262786865},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24107545614242554},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.21055173873901367},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.14709213376045227},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.07090571522712708}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8681796193122864},{"id":"https://openalex.org/C5274546","wikidata":"https://www.wikidata.org/wiki/Q5310264","display_name":"Duality gap","level":3,"score":0.8012135028839111},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.7701407670974731},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.6834487915039062},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.6803014278411865},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.569717288017273},{"id":"https://openalex.org/C195956108","wikidata":"https://www.wikidata.org/wiki/Q7268362","display_name":"Quadratic growth","level":2,"score":0.5650659799575806},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5184468626976013},{"id":"https://openalex.org/C206818286","wikidata":"https://www.wikidata.org/wiki/Q7449403","display_name":"Semidefinite embedding","level":4,"score":0.487648606300354},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.48005637526512146},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.463886559009552},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4593416154384613},{"id":"https://openalex.org/C65148998","wikidata":"https://www.wikidata.org/wiki/Q7268373","display_name":"Quadratically constrained quadratic program","level":3,"score":0.4158984124660492},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37010759115219116},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3567289412021637},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3419727683067322},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.31835973262786865},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24107545614242554},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.21055173873901367},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.14709213376045227},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.07090571522712708},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s1052623496299187","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623496299187","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.41999998688697815,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W67212155","https://openalex.org/W198845011","https://openalex.org/W1484458065","https://openalex.org/W1570961610","https://openalex.org/W1963753244","https://openalex.org/W1985984741","https://openalex.org/W1994350792","https://openalex.org/W2012110988","https://openalex.org/W2014885585","https://openalex.org/W2023381926","https://openalex.org/W2025486357","https://openalex.org/W2026418020","https://openalex.org/W2075379600","https://openalex.org/W2077274614","https://openalex.org/W2117065890","https://openalex.org/W2128202699","https://openalex.org/W2168204766","https://openalex.org/W2235997969","https://openalex.org/W2334285086","https://openalex.org/W2912522929","https://openalex.org/W3121603694","https://openalex.org/W4234065251","https://openalex.org/W4241871259"],"related_works":["https://openalex.org/W3035921962","https://openalex.org/W2037790839","https://openalex.org/W2897697015","https://openalex.org/W3151409190","https://openalex.org/W2083575507","https://openalex.org/W2288577150","https://openalex.org/W2554941982","https://openalex.org/W2169350232","https://openalex.org/W2233303476","https://openalex.org/W4298879965"],"abstract_inverted_index":{"This":[0],"paper":[1],"establishes":[2],"the":[3,18,21,33,36,51,70,75,98,101,123,133,137,143,147,153,159,169],"superlinear":[4],"convergence":[5],"of":[6,35,122,146],"a":[7,25,119],"symmetric":[8],"primal-dual":[9,28,138,148],"path":[10,38,125,140,161],"following":[11],"algorithm":[12,46],"for":[13,55,126],"semidefinite":[14,22],"programming":[15,57],"(SDP)":[16],"under":[17,132],"assumptions":[19],"that":[20,32,68,131],"program":[23],"has":[24],"strictly":[26],"complementary":[27],"optimal":[29,149],"solution":[30,150],"and":[31,152],"size":[34],"central":[37,124,139,160],"neighborhood":[39],"tends":[40],"to":[41,61,142,162],"zero.":[42],"The":[43,115],"interior":[44],"point":[45,157],"considered":[47],"here":[48],"closely":[49],"resembles":[50],"Mizuno--Todd--Ye":[52],"predictor-corrector":[53],"method":[54],"linear":[56],"which":[58],"is":[59,66,78,90,129,166],"known":[60],"be":[62],"quadratically":[63],"convergent.":[64],"It":[65,128],"shown":[67,130],"when":[69],"iterates":[71],"are":[72],"well":[73],"centered,":[74],"duality":[76,102,170],"gap":[77,103],"reduced":[79],"superlinearly":[80,104],"after":[81],"each":[82,87],"predictor":[83,88,99],"step.":[84],"Indeed,":[85],"if":[86],"step":[89],"succeeded":[91],"by":[92,168],"r":[93,113],"consecutive":[94],"corrector":[95],"steps":[96],"then":[97],"reduces":[100],"with":[105],"order":[106],"2":[107,111],"(":[108],"1":[109],"+":[110],"-":[112],").":[114],"proof":[116],"relies":[117],"on":[118,158],"careful":[120],"analysis":[121],"SDP.":[127],"strict":[134],"complementarity":[135],"assumption,":[136],"converges":[141],"analytic":[144,164],"center":[145,165],"set,":[151],"distance":[154],"from":[155],"any":[156],"this":[163],"bounded":[167],"gap.":[171]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":5},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}