{"id":"https://openalex.org/W1985984741","doi":"https://doi.org/10.1137/s1052623495296115","title":"On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming","display_name":"On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming","publication_year":1998,"publication_date":"1998-05-01","ids":{"openalex":"https://openalex.org/W1985984741","doi":"https://doi.org/10.1137/s1052623495296115","mag":"1985984741"},"language":"en","primary_location":{"id":"doi:10.1137/s1052623495296115","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623495296115","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/A5100343713","display_name":"Yin Zhang","orcid":"https://orcid.org/0000-0002-3225-3382"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Yin Zhang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5100343713"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":22.1708,"has_fulltext":false,"cited_by_count":246,"citation_normalized_percentile":{"value":0.99810157,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":100},"biblio":{"volume":"8","issue":"2","first_page":"365","last_page":"386"},"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/T10545","display_name":"Optimization and Variational Analysis","score":0.9846000075340271,"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/T10791","display_name":"Advanced Control Systems Optimization","score":0.9805999994277954,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.893208920955658},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.8387048840522766},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.793424665927887},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.6995481252670288},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4667755663394928},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.4381645917892456},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4352084696292877},{"id":"https://openalex.org/keywords/semidefinite-embedding","display_name":"Semidefinite embedding","score":0.43233299255371094},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42936909198760986},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.34630337357521057},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.32790154218673706},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.16978758573532104},{"id":"https://openalex.org/keywords/quadratically-constrained-quadratic-program","display_name":"Quadratically constrained quadratic program","score":0.14181363582611084},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.08126810193061829}],"concepts":[{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.893208920955658},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.8387048840522766},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.793424665927887},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.6995481252670288},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4667755663394928},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.4381645917892456},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4352084696292877},{"id":"https://openalex.org/C206818286","wikidata":"https://www.wikidata.org/wiki/Q7449403","display_name":"Semidefinite embedding","level":4,"score":0.43233299255371094},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42936909198760986},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34630337357521057},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.32790154218673706},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.16978758573532104},{"id":"https://openalex.org/C65148998","wikidata":"https://www.wikidata.org/wiki/Q7268373","display_name":"Quadratically constrained quadratic program","level":3,"score":0.14181363582611084},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.08126810193061829},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s1052623495296115","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623495296115","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.53.6694","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.6694","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.caam.rice.edu/pub/people/zhang/papers/sdp.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1963753244","https://openalex.org/W1982604350","https://openalex.org/W1989395545","https://openalex.org/W1994350792","https://openalex.org/W2014885585","https://openalex.org/W2034235667","https://openalex.org/W2043868859","https://openalex.org/W2077274614","https://openalex.org/W2089389443","https://openalex.org/W2128202699","https://openalex.org/W2144787788","https://openalex.org/W2912522929","https://openalex.org/W3210839039","https://openalex.org/W4230800447","https://openalex.org/W4241871259","https://openalex.org/W4246985475"],"related_works":["https://openalex.org/W2024899540","https://openalex.org/W2036562274","https://openalex.org/W1985090152","https://openalex.org/W2239063252","https://openalex.org/W2386411162","https://openalex.org/W2152386286","https://openalex.org/W1989395545","https://openalex.org/W2128202699","https://openalex.org/W4298225443","https://openalex.org/W2461836650"],"abstract_inverted_index":{"This":[0],"work":[1],"concerns":[2],"primal--dual":[3,151],"interior-point":[4],"methods":[5],"for":[6,100,146,150],"semidefinite":[7],"programming":[8,110],"(SDP)":[9],"that":[10,115],"use":[11],"a":[12,53,61,91,129],"search":[13,163],"direction":[14],"originally":[15],"proposed":[16],"by":[17,43],"Helmberg":[18],"et":[19],"al.":[20],"[SIAM":[21,33,45,178],"J.":[22,34,46,179],"Optim.,":[23,35,47,180],"6":[24],"(1996),":[25],"pp.":[26,38,50,183],"342--361]":[27],"and":[28,31,40,66,73,75,82,98,136,161],"Kojima,":[29],"Shindoh,":[30,72],"Hara":[32],"7":[36,48],"(1997),":[37,49],"86--125.]":[39],"recently":[41],"rediscovered":[42],"Monteiro":[44],"663--678]":[51],"in":[52,70,77,83,108,124],"more":[54],"explicit":[55],"form.":[56],"In":[57,86],"analyzing":[58],"these":[59],"methods,":[60],"number":[62],"of":[63,94,132,139,168,176],"basic":[64,113],"equalities":[65,97],"inequalities":[67,99],"were":[68],"developed":[69],"[Kojima,":[71],"Hara]":[74],"also":[76,127],"[Monteiro]":[78],"through":[79],"different":[80,84],"means":[81],"forms.":[85],"this":[87],"paper,":[88],"we":[89],"give":[90],"concise":[92],"derivation":[93],"the":[95,104,133,159,172],"key":[96],"complexity":[101],"analysis":[102],"along":[103],"exact":[105],"line":[106],"used":[107],"linear":[109],"(LP),":[111],"producing":[112],"relationships":[114],"have":[116],"compact":[117],"forms":[118],"almost":[119],"identical":[120],"to":[121,156],"their":[122],"counterparts":[123],"LP.":[125],"We":[126,165],"introduce":[128],"new":[130],"formulation":[131],"central":[134],"path":[135],"variable-metric":[137],"measures":[138],"centrality.":[140],"These":[141],"results":[142,149],"provide":[143],"convenient":[144],"tools":[145],"deriving":[147],"polynomiality":[148],"algorithms":[152],"extended":[153],"from":[154],"LP":[155],"SDP":[157],"using":[158],"aforementioned":[160],"related":[162],"directions.":[164],"present":[166],"examples":[167],"such":[169],"extensions,":[170],"including":[171],"long-step":[173],"infeasible-interior-point":[174],"algorithm":[175],"Zhang":[177],"4":[181],"(1994),":[182],"208--227].":[184]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":11},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":14},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":10},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":10}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}