{"id":"https://openalex.org/W1994350792","doi":"https://doi.org/10.1137/s1052623495294955","title":"A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming","display_name":"A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming","publication_year":1998,"publication_date":"1998-11-01","ids":{"openalex":"https://openalex.org/W1994350792","doi":"https://doi.org/10.1137/s1052623495294955","mag":"1994350792"},"language":"en","primary_location":{"id":"doi:10.1137/s1052623495294955","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623495294955","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/A5051944217","display_name":"Florian A. Potra","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Florian A. Potra","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5103425254","display_name":"Rongqin Sheng","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rongqin Sheng","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":13.7459,"has_fulltext":false,"cited_by_count":94,"citation_normalized_percentile":{"value":0.99098244,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"8","issue":"4","first_page":"1007","last_page":"1028"},"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.9940999746322632,"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.9926999807357788,"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/interior-point-method","display_name":"Interior point method","score":0.8472599983215332},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8450506925582886},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.5310637950897217},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5212076902389526},{"id":"https://openalex.org/keywords/quadratic-growth","display_name":"Quadratic growth","score":0.5130876302719116},{"id":"https://openalex.org/keywords/norm","display_name":"Norm (philosophy)","score":0.4899281859397888},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.47748395800590515},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.46446341276168823},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44627201557159424},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.43694251775741577},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4240094721317291},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4130847454071045},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.12411481142044067}],"concepts":[{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.8472599983215332},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8450506925582886},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.5310637950897217},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5212076902389526},{"id":"https://openalex.org/C195956108","wikidata":"https://www.wikidata.org/wiki/Q7268362","display_name":"Quadratic growth","level":2,"score":0.5130876302719116},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.4899281859397888},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.47748395800590515},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.46446341276168823},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44627201557159424},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.43694251775741577},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4240094721317291},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4130847454071045},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.12411481142044067},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","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/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","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},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/s1052623495294955","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623495294955","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.30.6739","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.30.6739","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://user.dls.net/~rsheng/siam3.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.56.8557","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.8557","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.cs.uiowa.edu/pub/comp_math_rep/report-78.ps.Z","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":17,"referenced_works":["https://openalex.org/W1546369267","https://openalex.org/W1963753244","https://openalex.org/W1980610004","https://openalex.org/W1985984741","https://openalex.org/W2012110988","https://openalex.org/W2014885585","https://openalex.org/W2018226863","https://openalex.org/W2025486357","https://openalex.org/W2049020606","https://openalex.org/W2075379600","https://openalex.org/W2077274614","https://openalex.org/W2078693534","https://openalex.org/W2128202699","https://openalex.org/W2610857016","https://openalex.org/W2912522929","https://openalex.org/W4230800447","https://openalex.org/W4252193285"],"related_works":["https://openalex.org/W2036562274","https://openalex.org/W2037790839","https://openalex.org/W2121045497","https://openalex.org/W2269291726","https://openalex.org/W2965106131","https://openalex.org/W2897697015","https://openalex.org/W2114808974","https://openalex.org/W2128202699","https://openalex.org/W2531901171","https://openalex.org/W1985090152"],"abstract_inverted_index":{"A":[0],"primal-dual":[1,96],"infeasible-interior-point":[2],"path-following":[3],"algorithm":[4,21,37,79,133],"is":[5,22,29,49,57,74,134],"proposed":[6],"for":[7,114,130],"solving":[8],"semidefinite":[9],"programming":[10],"(SDP)":[11],"problems.":[12],"If":[13,25,70],"the":[14,20,26,36,50,53,58,61,64,68,71,78,95,115,119,132],"problem":[15,54,97],"has":[16,98],"a":[17,89,105,111],"solution,":[18],"then":[19,77],"globally":[23],"convergent.":[24,136],"starting":[27,72],"point":[28,73],"feasible":[30],"or":[31,91],"close":[32],"to":[33],"being":[34],"feasible,":[35],"finds":[38],"an":[39],"optimal":[40],"solution":[41,90,100],"in":[42,81],"at":[43,82],"most":[44,83],"$O(\\sqrt{n}L)$":[45],"iterations,":[46],"where":[47],"n":[48],"size":[51],"of":[52,60,63,101,118,128],"and":[55,67],"L":[56],"logarithm":[59],"ratio":[62],"initial":[65],"error":[66],"tolerance.":[69],"large":[75],"enough,":[76],"terminates":[80],"O(nL)":[84],"steps":[85],"either":[86],"by":[87,92],"finding":[88],"determining":[93],"that":[94],"no":[99],"norm":[102],"less":[103],"than":[104],"given":[106],"number.":[107],"Moreover,":[108],"we":[109,123],"propose":[110],"sufficient":[112],"condition":[113],"superlinear":[116],"convergence":[117],"algorithm.":[120],"In":[121],"addition,":[122],"give":[124],"two":[125],"special":[126],"cases":[127],"SDP":[129],"which":[131],"quadratically":[135]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}