{"id":"https://openalex.org/W2077274614","doi":"https://doi.org/10.1137/s1052623495290209","title":"Primal-Dual Interior-Point Methods for Self-Scaled Cones","display_name":"Primal-Dual Interior-Point Methods for Self-Scaled Cones","publication_year":1998,"publication_date":"1998-05-01","ids":{"openalex":"https://openalex.org/W2077274614","doi":"https://doi.org/10.1137/s1052623495290209","mag":"2077274614"},"language":"en","primary_location":{"id":"doi:10.1137/s1052623495290209","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623495290209","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/A5108665803","display_name":"Yu. E. Nesterov","orcid":null},"institutions":[{"id":"https://openalex.org/I95674353","display_name":"UCLouvain","ror":"https://ror.org/02495e989","country_code":"BE","type":"education","lineage":["https://openalex.org/I95674353"]}],"countries":["BE"],"is_corresponding":true,"raw_author_name":"Yu. E. Nesterov","raw_affiliation_strings":["CORE, Catholic University of Louvain, Louvain-la-Neuve, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CORE, Catholic University of Louvain, Louvain-la-Neuve, Belgium","institution_ids":["https://openalex.org/I95674353"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102817920","display_name":"Michael J. Todd","orcid":"https://orcid.org/0000-0001-9458-3443"},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M. J. Todd","raw_affiliation_strings":["School of Operations Research and Industrial Engineering, Cornell University, Ithaca, New York 14853"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Operations Research and Industrial Engineering, Cornell University, Ithaca, New York 14853","institution_ids":["https://openalex.org/I205783295"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5108665803"],"corresponding_institution_ids":["https://openalex.org/I95674353"],"apc_list":null,"apc_paid":null,"fwci":31.2154,"has_fulltext":false,"cited_by_count":514,"citation_normalized_percentile":{"value":0.99912049,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"8","issue":"2","first_page":"324","last_page":"364"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":1.0,"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":1.0,"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.9976000189781189,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.9969000220298767,"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.894517183303833},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7909346222877502},{"id":"https://openalex.org/keywords/second-order-cone-programming","display_name":"Second-order cone programming","score":0.6902724504470825},{"id":"https://openalex.org/keywords/quadratically-constrained-quadratic-program","display_name":"Quadratically constrained quadratic program","score":0.6199504137039185},{"id":"https://openalex.org/keywords/quadratic-growth","display_name":"Quadratic growth","score":0.5949135422706604},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.5828036665916443},{"id":"https://openalex.org/keywords/conic-optimization","display_name":"Conic optimization","score":0.5751760601997375},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5338590741157532},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4961739480495453},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.4675542116165161},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.45288753509521484},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.3476366102695465},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2284007966518402},{"id":"https://openalex.org/keywords/convex-analysis","display_name":"Convex analysis","score":0.17465057969093323},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.10882401466369629}],"concepts":[{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.894517183303833},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7909346222877502},{"id":"https://openalex.org/C111397411","wikidata":"https://www.wikidata.org/wiki/Q7442977","display_name":"Second-order cone programming","level":4,"score":0.6902724504470825},{"id":"https://openalex.org/C65148998","wikidata":"https://www.wikidata.org/wiki/Q7268373","display_name":"Quadratically constrained quadratic program","level":3,"score":0.6199504137039185},{"id":"https://openalex.org/C195956108","wikidata":"https://www.wikidata.org/wiki/Q7268362","display_name":"Quadratic growth","level":2,"score":0.5949135422706604},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.5828036665916443},{"id":"https://openalex.org/C79187972","wikidata":"https://www.wikidata.org/wiki/Q2654791","display_name":"Conic optimization","level":5,"score":0.5751760601997375},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5338590741157532},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4961739480495453},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.4675542116165161},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.45288753509521484},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3476366102695465},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2284007966518402},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.17465057969093323},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.10882401466369629}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s1052623495290209","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623495290209","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:dial.uclouvain.be:boreal:45350","is_oa":false,"landing_page_url":"http://hdl.handle.net/2078.1/45350","pdf_url":null,"source":{"id":"https://openalex.org/S4306401974","display_name":"DIAL (Catholic University of Leuven)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I99464096","host_organization_name":"KU Leuven","host_organization_lineage":["https://openalex.org/I99464096"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Optimization, Vol. 8, no. 2, p. 324-364 (1998)","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3970459422","display_name":"Presidential Young Investigator Award: Analysis of          Stochastic in Dynamic Models in Combinatorial Optimization  in Queueing Networks","funder_award_id":"9158118","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4400661635","display_name":"Mathematical Sciences: Eigenvalue Optimization and Robust   Mathematical Programming","funder_award_id":"9303772","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7293295650","display_name":"Numerical Methods for Large-Scale Continuous Optimization","funder_award_id":"9103804","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320309369","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44"},{"id":"https://openalex.org/F4320310094","display_name":"University of Washington","ror":"https://ror.org/00cvxb145"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1576233016","https://openalex.org/W1632601927","https://openalex.org/W1653619892","https://openalex.org/W1970050176","https://openalex.org/W1984617485","https://openalex.org/W1993247264","https://openalex.org/W1999031104","https://openalex.org/W2014885585","https://openalex.org/W2030674458","https://openalex.org/W2074316151","https://openalex.org/W2093249882","https://openalex.org/W2117065890","https://openalex.org/W2125815834","https://openalex.org/W2611147814","https://openalex.org/W4233560870","https://openalex.org/W4301021743"],"related_works":["https://openalex.org/W2951903936","https://openalex.org/W2004392729","https://openalex.org/W4298879965","https://openalex.org/W2233303476","https://openalex.org/W2492346510","https://openalex.org/W2897697015","https://openalex.org/W2108515966","https://openalex.org/W3121603694","https://openalex.org/W2077274614","https://openalex.org/W2034618192"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3,68],"continue":[4],"the":[5,25,97,119,122,125,139,144,147],"development":[6],"of":[7,49,73,96,100,106,118,124,135,146],"a":[8,70,115,133],"theoretical":[9],"foundation":[10],"for":[11,16,82],"efficient":[12],"primal-dual":[13,85],"interior-point":[14],"algorithms":[15,108],"convex":[17,59],"programming":[18,63],"problems":[19,50,67],"expressed":[20],"in":[21,138],"conic":[22],"form,":[23],"when":[24],"cone":[26],"and":[27,37,58,75,103],"its":[28],"associated":[29],"barrier":[30],"are":[31],"self-scaled":[32],"(see":[33],"Yu.":[34],"E.":[35],"Nesterov":[36],"M.J.":[38],"Todd,":[39],"Math.":[40],"Oper.":[41],"Res.,":[42],"22":[43],"(1997),":[44],"pp.":[45],"1--42).":[46],"The":[47],"class":[48],"under":[51],"consideration":[52],"includes":[53],"linear":[54],"programming,":[55,57],"semidefinite":[56],"quadratically":[60],"constrained,":[61],"quadratic":[62],"problems.":[64],"For":[65],"such":[66],"introduce":[69],"new":[71],"definition":[72],"affine-scaling":[74],"centering":[76],"directions.":[77],"We":[78],"present":[79],"efficiency":[80],"estimates":[81],"several":[83],"symmetric":[84],"methods":[86],"that":[87,112],"can":[88,109],"loosely":[89],"be":[90],"classified":[91],"as":[92],"path-following":[93],"methods.":[94],"Because":[95],"special":[98],"properties":[99],"these":[101],"cones":[102],"barriers,":[104],"two":[105],"our":[107],"take":[110],"steps":[111],"typically":[113],"go":[114],"large":[116],"fraction":[117],"way":[120],"to":[121,132],"boundary":[123],"feasible":[126],"region,":[127],"rather":[128],"than":[129],"being":[130],"confined":[131],"ball":[134],"unit":[136],"radius":[137],"local":[140],"norm":[141],"defined":[142],"by":[143],"Hessian":[145],"barrier.":[148]},"counts_by_year":[{"year":2026,"cited_by_count":5},{"year":2025,"cited_by_count":11},{"year":2024,"cited_by_count":18},{"year":2023,"cited_by_count":10},{"year":2022,"cited_by_count":15},{"year":2021,"cited_by_count":20},{"year":2020,"cited_by_count":19},{"year":2019,"cited_by_count":10},{"year":2018,"cited_by_count":28},{"year":2017,"cited_by_count":21},{"year":2016,"cited_by_count":24},{"year":2015,"cited_by_count":17},{"year":2014,"cited_by_count":26},{"year":2013,"cited_by_count":28},{"year":2012,"cited_by_count":23}],"updated_date":"2026-06-16T09:24:06.705377","created_date":"2025-10-10T00:00:00"}