{"id":"https://openalex.org/W2025617394","doi":"https://doi.org/10.1137/s105262349630009x","title":"Interior Point Trajectories in Semidefinite Programming","display_name":"Interior Point Trajectories in Semidefinite Programming","publication_year":1998,"publication_date":"1998-11-01","ids":{"openalex":"https://openalex.org/W2025617394","doi":"https://doi.org/10.1137/s105262349630009x","mag":"2025617394"},"language":"en","primary_location":{"id":"doi:10.1137/s105262349630009x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s105262349630009x","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/A5027297328","display_name":"Donald Goldfarb","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"D. Goldfarb","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5026789944","display_name":"Katya Scheinberg","orcid":"https://orcid.org/0000-0003-3547-1841"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"K. Scheinberg","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":5.7644,"has_fulltext":false,"cited_by_count":73,"citation_normalized_percentile":{"value":0.96345515,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"8","issue":"4","first_page":"871","last_page":"886"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9894000291824341,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.9810000061988831,"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.8913608193397522},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7452656626701355},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.7168934345245361},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6550229787826538},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.6228030323982239},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6128107309341431},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5781153440475464},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5259140729904175},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.516737163066864},{"id":"https://openalex.org/keywords/semidefinite-embedding","display_name":"Semidefinite embedding","score":0.4570472538471222},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.32141029834747314},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.22168290615081787},{"id":"https://openalex.org/keywords/quadratically-constrained-quadratic-program","display_name":"Quadratically constrained quadratic program","score":0.21317237615585327},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.07370945811271667},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06216457486152649}],"concepts":[{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.8913608193397522},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7452656626701355},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.7168934345245361},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6550229787826538},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.6228030323982239},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6128107309341431},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5781153440475464},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5259140729904175},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.516737163066864},{"id":"https://openalex.org/C206818286","wikidata":"https://www.wikidata.org/wiki/Q7449403","display_name":"Semidefinite embedding","level":4,"score":0.4570472538471222},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.32141029834747314},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.22168290615081787},{"id":"https://openalex.org/C65148998","wikidata":"https://www.wikidata.org/wiki/Q7268373","display_name":"Quadratically constrained quadratic program","level":3,"score":0.21317237615585327},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.07370945811271667},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06216457486152649},{"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/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","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":2,"locations":[{"id":"doi:10.1137/s105262349630009x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s105262349630009x","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.9356","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.30.9356","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ORLY1.snu.ac.kr/pub/lib/interior/sdp_cp.ps","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":30,"referenced_works":["https://openalex.org/W66060913","https://openalex.org/W1487405513","https://openalex.org/W1524254951","https://openalex.org/W1530239534","https://openalex.org/W1573409602","https://openalex.org/W1588330761","https://openalex.org/W1963753244","https://openalex.org/W1967960319","https://openalex.org/W1980610004","https://openalex.org/W1985984741","https://openalex.org/W2003324738","https://openalex.org/W2012110988","https://openalex.org/W2025486357","https://openalex.org/W2035412546","https://openalex.org/W2059352176","https://openalex.org/W2075379600","https://openalex.org/W2077274614","https://openalex.org/W2078030154","https://openalex.org/W2092569137","https://openalex.org/W2117065890","https://openalex.org/W2128202699","https://openalex.org/W2146241362","https://openalex.org/W2146371908","https://openalex.org/W2165452678","https://openalex.org/W2168204766","https://openalex.org/W2734997509","https://openalex.org/W2912522929","https://openalex.org/W4230800447","https://openalex.org/W4234065251","https://openalex.org/W4241871259"],"related_works":["https://openalex.org/W2024899540","https://openalex.org/W2036562274","https://openalex.org/W1989395545","https://openalex.org/W1985090152","https://openalex.org/W2239063252","https://openalex.org/W2386411162","https://openalex.org/W2531901171","https://openalex.org/W2152386286","https://openalex.org/W4298225443","https://openalex.org/W2461836650"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3,60,120],"study":[4,116,121],"interior":[5,110],"point":[6],"trajectories":[7,32,93,126],"in":[8,35],"semidefinite":[9],"programming":[10,31],"(SDP)":[11],"including":[12],"the":[13,24,63,73,77,82,85,98,122],"central":[14,67,99],"path":[15,100],"of":[16,27,54,76,92,124],"an":[17,52],"SDP.":[18],"This":[19],"work":[20,26],"was":[21],"inspired":[22],"by":[23],"seminal":[25],"Megiddo":[28],"on":[29],"linear":[30],"[":[33],"Progress":[34],"Math.":[36],"Programming:":[37],"Interior-Point":[38],"Algorithms":[39],"and":[40,56,65,70,84,115,127],"Related":[41],"Methods,":[42],"N.":[43],"Megiddo,":[44],"ed.,":[45],"Springer-Verlag,":[46],"Berlin,":[47],"1989,":[48],"pp.":[49],"131--158].":[50],"Under":[51],"assumption":[53],"primal":[55,64,83],"dual":[57,66,86],"strict":[58],"feasibility,":[59],"show":[61],"that":[62,94],"paths":[68],"exist":[69],"converge":[71],"to":[72,97,105],"analytic":[74],"centers":[75],"optimal":[78],"faces":[79],"of,":[80],"respectively,":[81],"problems.":[87],"We":[88],"consider":[89],"a":[90],"class":[91],"are":[95],"similar":[96],"but":[101],"can":[102],"be":[103],"constructed":[104],"pass":[106],"through":[107],"any":[108],"given":[109],"feasible":[111],"or":[112],"infeasible":[113],"point,":[114],"their":[117,128],"convergence.":[118,129],"Finally,":[119],"derivatives":[123],"these":[125]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"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"}