{"id":"https://openalex.org/W2157590940","doi":"https://doi.org/10.1017/s0962492900002300","title":"Interior methods for constrained optimization","display_name":"Interior methods for constrained optimization","publication_year":1992,"publication_date":"1992-01-01","ids":{"openalex":"https://openalex.org/W2157590940","doi":"https://doi.org/10.1017/s0962492900002300","mag":"2157590940"},"language":"en","primary_location":{"id":"doi:10.1017/s0962492900002300","doi":"https://doi.org/10.1017/s0962492900002300","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0962492900002300","pdf_url":null,"source":{"id":"https://openalex.org/S124973578","display_name":"Acta Numerica","issn_l":"0962-4929","issn":["0962-4929","1474-0508"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","dongbi-b","jufo-2","norway-2","poland-200","russia-white-list-1"],"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Acta Numerica","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"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/A5103458692","display_name":"Margaret H. Wright","orcid":"https://orcid.org/0000-0001-7133-4970","observed_orcids":["https://orcid.org/0000-0001-7133-4970"]},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Margaret H. Wright","raw_affiliation_strings":["AT&T Bell Laboratories Murray Hill, New Jersey 07974USA, E-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"AT&T Bell Laboratories Murray Hill, New Jersey 07974USA, E-mail:","institution_ids":["https://openalex.org/I1283103587"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5103458692"],"corresponding_institution_ids":["https://openalex.org/I1283103587"],"apc_list":{"value":4260,"currency":"USD","value_usd":4260},"apc_paid":null,"fwci":10.6432,"has_fulltext":false,"cited_by_count":282,"citation_normalized_percentile":{"value":0.99064171,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":93,"max":99},"biblio":{"volume":"1","issue":null,"first_page":"341","last_page":"407"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9984999895095825,"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.9984999895095825,"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.0003000000142492354,"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/T10792","display_name":"Matrix Theory and Algorithms","score":0.00019999999494757503,"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/constrained-optimization","display_name":"constrained optimization","score":0.9599999785423279},{"id":"https://openalex.org/keywords/interior-point-methods","display_name":"interior point methods","score":0.9869999885559082},{"id":"https://openalex.org/keywords/linear-programming","display_name":"linear programming","score":0.9020000100135803},{"id":"https://openalex.org/keywords/karmarkar-s-algorithm","display_name":"Karmarkar's algorithm","score":0.8650000095367432},{"id":"https://openalex.org/keywords/polynomial-time-algorithms","display_name":"polynomial-time algorithms","score":0.7829999923706055},{"id":"https://openalex.org/keywords/computational-complexity","display_name":"computational complexity","score":0.9399999976158142},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"nonlinear programming","score":0.6190000176429749},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.9570000171661377}],"concepts":[{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.6957163214683533},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.6798447370529175},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.6696127653121948},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6168819665908813},{"id":"https://openalex.org/C2778869765","wikidata":"https://www.wikidata.org/wiki/Q6028363","display_name":"Inefficiency","level":2,"score":0.5522206425666809},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5514267683029175},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.43869829177856445},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.4245753288269043},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.411082923412323},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27499473094940186},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2741827964782715},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.2412552535533905},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.11596038937568665},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07454890012741089},{"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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/C175444787","wikidata":"https://www.wikidata.org/wiki/Q39072","display_name":"Microeconomics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0962492900002300","doi":"https://doi.org/10.1017/s0962492900002300","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0962492900002300","pdf_url":null,"source":{"id":"https://openalex.org/S124973578","display_name":"Acta Numerica","issn_l":"0962-4929","issn":["0962-4929","1474-0508"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","dongbi-b","jufo-2","norway-2","poland-200","russia-white-list-1"],"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Acta Numerica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":60,"referenced_works":["https://openalex.org/W21055737","https://openalex.org/W40680864","https://openalex.org/W51359543","https://openalex.org/W132318879","https://openalex.org/W246903215","https://openalex.org/W291003596","https://openalex.org/W1504590272","https://openalex.org/W1559606740","https://openalex.org/W1573409602","https://openalex.org/W1574856455","https://openalex.org/W1590012787","https://openalex.org/W1788350818","https://openalex.org/W1888890775","https://openalex.org/W1967960319","https://openalex.org/W1972639694","https://openalex.org/W1973117121","https://openalex.org/W1973909189","https://openalex.org/W1979359234","https://openalex.org/W1981315194","https://openalex.org/W1981885118","https://openalex.org/W1985393884","https://openalex.org/W1987953347","https://openalex.org/W1996025842","https://openalex.org/W2003856348","https://openalex.org/W2009667013","https://openalex.org/W2014746566","https://openalex.org/W2027634563","https://openalex.org/W2028570814","https://openalex.org/W2031392034","https://openalex.org/W2033040247","https://openalex.org/W2036622774","https://openalex.org/W2052602889","https://openalex.org/W2053913299","https://openalex.org/W2057200219","https://openalex.org/W2059635037","https://openalex.org/W2071425572","https://openalex.org/W2071609006","https://openalex.org/W2074316151","https://openalex.org/W2079547145","https://openalex.org/W2090963365","https://openalex.org/W2115974907","https://openalex.org/W2168825111","https://openalex.org/W2214462370","https://openalex.org/W2231645612","https://openalex.org/W2249508874","https://openalex.org/W2317002898","https://openalex.org/W2326806701","https://openalex.org/W2611147814","https://openalex.org/W2622732576","https://openalex.org/W3012317737","https://openalex.org/W3044040718","https://openalex.org/W3045589250","https://openalex.org/W3142300713","https://openalex.org/W4212997115","https://openalex.org/W4231047849","https://openalex.org/W4249290066","https://openalex.org/W4249667877","https://openalex.org/W4249872099","https://openalex.org/W4252052822","https://openalex.org/W4299512035"],"related_works":["https://openalex.org/W2030723843","https://openalex.org/W1539001169","https://openalex.org/W2069671092","https://openalex.org/W2063882470","https://openalex.org/W4234772957","https://openalex.org/W7099321341","https://openalex.org/W4378529241","https://openalex.org/W2071563913","https://openalex.org/W1690027706","https://openalex.org/W3205360536"],"abstract_inverted_index":{"Interior":[0,140],"methods":[1,35,115,126,141],"for":[2,42,67,116],"optimization":[3],"were":[4,19],"widely":[5],"used":[6],"in":[7,11,73,97,113,131,163],"the":[8,12,28,31,40,53,74,120,172],"1960s,":[9],"primarily":[10],"form":[13],"of":[14,27,30,45,61,76,110,124,137,160,176],"barrier":[15,89],"methods.":[16,178],"However,":[17],"they":[18],"not":[20],"seriously":[21],"applied":[22,145],"to":[23,149,171],"linear":[24,68,117,135],"programming":[25,69],"because":[26],"dominance":[29],"simplex":[32],"method.":[33],"Barrier":[34],"fell":[36],"from":[37],"favour":[38],"during":[39],"1970s":[41],"a":[43,62,95,157],"variety":[44],"reasons,":[46],"including":[47],"their":[48],"apparent":[49],"inefficiency":[50],"compared":[51],"with":[52,146],"best":[54],"available":[55],"alternatives.":[56],"In":[57],"1984,":[58],"Karmarkar's":[59],"announcement":[60],"fast":[63],"polynomial-time":[64],"interior":[65,114,125,177],"method":[66,86],"caused":[70],"tremendous":[71],"excitement":[72],"field":[75],"optimization.":[77],"A":[78],"formal":[79],"connection":[80],"can":[81],"be":[82],"shown":[83],"between":[84],"his":[85],"and":[87,99,151,167,174],"classical":[88,165],"methods,":[90],"which":[91],"have":[92,106,127,142],"consequently":[93],"undergone":[94],"renaissance":[96],"interest":[98],"popularity.":[100],"Most":[101],"papers":[102],"published":[103],"since":[104],"1984":[105],"concentrated":[107],"on":[108],"issues":[109],"computational":[111],"complexity":[112],"programming.":[118],"During":[119],"same":[121],"period,":[122],"implementations":[123],"displayed":[128],"great":[129],"efficiency":[130],"solving":[132],"many":[133],"large":[134],"programs":[136],"ever-increasing":[138],"size.":[139],"also":[143],"been":[144],"notable":[147],"success":[148],"nonlinear":[150],"combinatorial":[152],"problems.":[153],"This":[154],"paper":[155],"presents":[156],"self-contained":[158],"survey":[159],"major":[161],"themes":[162],"both":[164],"material":[166],"recent":[168],"developments":[169],"related":[170],"theory":[173],"practice":[175]},"counts_by_year":[{"year":2026,"cited_by_count":5},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":9},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":10}],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2016-06-24T00:00:00"}