{"id":"https://openalex.org/W2050215206","doi":"https://doi.org/10.1137/s1052623496306620","title":"On the Complexity of a Practical Interior-Point Method","display_name":"On the Complexity of a Practical Interior-Point Method","publication_year":1998,"publication_date":"1998-08-01","ids":{"openalex":"https://openalex.org/W2050215206","doi":"https://doi.org/10.1137/s1052623496306620","mag":"2050215206"},"language":"en","primary_location":{"id":"doi:10.1137/s1052623496306620","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623496306620","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/A5111764384","display_name":"Stephen G. Nash","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Stephen G. Nash","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5044942283","display_name":"Ariela Sofer","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ariela Sofer","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":0.8868,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.74466065,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"8","issue":"3","first_page":"833","last_page":"849"},"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.9993000030517578,"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/T10792","display_name":"Matrix Theory and Algorithms","score":0.998199999332428,"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.8467563390731812},{"id":"https://openalex.org/keywords/newtons-method-in-optimization","display_name":"Newton's method in optimization","score":0.7882823944091797},{"id":"https://openalex.org/keywords/extrapolation","display_name":"Extrapolation","score":0.7831652760505676},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6957360506057739},{"id":"https://openalex.org/keywords/newtons-method","display_name":"Newton's method","score":0.641745388507843},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.6073834896087646},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.5968841314315796},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4759259521961212},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4608772099018097},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.44461846351623535},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.43014198541641235},{"id":"https://openalex.org/keywords/steffensens-method","display_name":"Steffensen's method","score":0.41792696714401245},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3954148292541504},{"id":"https://openalex.org/keywords/local-convergence","display_name":"Local convergence","score":0.28560638427734375},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2422812581062317},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.17205649614334106},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.14591088891029358},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.11996877193450928},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.06891399621963501}],"concepts":[{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.8467563390731812},{"id":"https://openalex.org/C179127668","wikidata":"https://www.wikidata.org/wiki/Q17086396","display_name":"Newton's method in optimization","level":4,"score":0.7882823944091797},{"id":"https://openalex.org/C132459708","wikidata":"https://www.wikidata.org/wiki/Q744069","display_name":"Extrapolation","level":2,"score":0.7831652760505676},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6957360506057739},{"id":"https://openalex.org/C85189116","wikidata":"https://www.wikidata.org/wiki/Q374195","display_name":"Newton's method","level":3,"score":0.641745388507843},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.6073834896087646},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.5968841314315796},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4759259521961212},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4608772099018097},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.44461846351623535},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.43014198541641235},{"id":"https://openalex.org/C173443657","wikidata":"https://www.wikidata.org/wiki/Q7606635","display_name":"Steffensen's method","level":5,"score":0.41792696714401245},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3954148292541504},{"id":"https://openalex.org/C117898588","wikidata":"https://www.wikidata.org/wiki/Q6664310","display_name":"Local convergence","level":3,"score":0.28560638427734375},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2422812581062317},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.17205649614334106},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.14591088891029358},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.11996877193450928},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.06891399621963501},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s1052623496306620","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623496306620","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.25.3951","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.25.3951","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://iris.gmu.edu/~asofer/concord.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.4399999976158142}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W212237665","https://openalex.org/W1514645957","https://openalex.org/W1601541039","https://openalex.org/W1632601927","https://openalex.org/W1963650328","https://openalex.org/W1976750320","https://openalex.org/W1985984741","https://openalex.org/W1994523706","https://openalex.org/W1994722534","https://openalex.org/W2014746566","https://openalex.org/W2022234616","https://openalex.org/W2034755620","https://openalex.org/W2035959039","https://openalex.org/W2065704444","https://openalex.org/W2066119044","https://openalex.org/W2076192270","https://openalex.org/W2077274614","https://openalex.org/W2086686229","https://openalex.org/W2127959492","https://openalex.org/W2140142240","https://openalex.org/W2150768816","https://openalex.org/W2157590940","https://openalex.org/W2912522929"],"related_works":["https://openalex.org/W2050215206","https://openalex.org/W2015985877","https://openalex.org/W2082907018","https://openalex.org/W3012351555","https://openalex.org/W2360024674","https://openalex.org/W4206640546","https://openalex.org/W1518402494","https://openalex.org/W2083431695","https://openalex.org/W2354939793","https://openalex.org/W355496366"],"abstract_inverted_index":{"The":[0,90],"theory":[1],"of":[2,14,86,101],"self-concordance":[3],"in":[4,38,111],"convex":[5],"optimization":[6],"has":[7],"been":[8],"used":[9,110],"to":[10,28,42,75,81,137],"analyze":[11,34],"the":[12,43,64,102,112],"complexity":[13],"interior-point":[15,52],"methods":[16,53],"based":[17],"on":[18],"Newton's":[19,30,105],"method.":[20,89,106],"For":[21],"large":[22],"problems,":[23],"it":[24],"may":[25,134],"be":[26,135],"impractical":[27],"use":[29],"method;":[31],"here":[32],"we":[33],"a":[35,82,87,93,98],"truncated-Newton":[36],"method,":[37,115],"which":[39],"an":[40,77],"approximation":[41],"Newton":[44],"search":[45],"direction":[46],"is":[47,109],"used.":[48],"In":[49],"addition,":[50],"practical":[51],"often":[54],"include":[55],"enhancements":[56],"such":[57,76],"as":[58],"extrapolation":[59,108],"that":[60,73],"are":[61,97,119],"absent":[62],"from":[63],"theoretical":[65,71,126],"algorithms":[66],"analyzed":[67],"previously.":[68],"We":[69,122],"derive":[70],"results":[72,91,103,118,133],"apply":[74],"algorithm,":[78],"one":[79],"similar":[80],"sophisticated":[83],"computer":[84],"implementation":[85],"barrier":[88,95,114],"for":[92,104],"single":[94],"subproblem":[96],"satisfying":[99],"extension":[100],"When":[107],"overall":[113],"however,":[116],"our":[117],"more":[120,131],"limited.":[121],"indicate":[123],"(by":[124],"both":[125],"arguments":[127],"and":[128],"examples)":[129],"why":[130],"elaborate":[132],"difficult":[136],"obtain.":[138]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-08-27T14:10:00.468798","created_date":"2025-10-10T00:00:00"}