{"id":"https://openalex.org/W2044219297","doi":"https://doi.org/10.1137/0802011","title":"A Low Complexity Interior-Point Algorithm for Linear Programming","display_name":"A Low Complexity Interior-Point Algorithm for Linear Programming","publication_year":1992,"publication_date":"1992-05-01","ids":{"openalex":"https://openalex.org/W2044219297","doi":"https://doi.org/10.1137/0802011","mag":"2044219297"},"language":"en","primary_location":{"id":"doi:10.1137/0802011","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0802011","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/A5102817920","display_name":"Michael J. Todd","orcid":"https://orcid.org/0000-0001-9458-3443"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Michael J. Todd","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5102817920"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.016,"has_fulltext":false,"cited_by_count":29,"citation_normalized_percentile":{"value":0.97681452,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"2","issue":"2","first_page":"198","last_page":"209"},"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/T11697","display_name":"Numerical Methods and Algorithms","score":0.9975000023841858,"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.9919000267982483,"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.9085007905960083},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7717623710632324},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.7360744476318359},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5987831354141235},{"id":"https://openalex.org/keywords/affine-transformation","display_name":"Affine transformation","score":0.5513708591461182},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5368348360061646},{"id":"https://openalex.org/keywords/scaling","display_name":"Scaling","score":0.5248972177505493},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.49196764826774597},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.47810739278793335},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.43627113103866577},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.4199557304382324},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3213893175125122},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.10514950752258301}],"concepts":[{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.9085007905960083},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7717623710632324},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.7360744476318359},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5987831354141235},{"id":"https://openalex.org/C92757383","wikidata":"https://www.wikidata.org/wiki/Q382497","display_name":"Affine transformation","level":2,"score":0.5513708591461182},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5368348360061646},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.5248972177505493},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.49196764826774597},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.47810739278793335},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43627113103866577},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.4199557304382324},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3213893175125122},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.10514950752258301},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/0802011","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0802011","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:ecommons.cornell.edu:1813/8786","is_oa":false,"landing_page_url":"https://hdl.handle.net/1813/8786","pdf_url":null,"source":{"id":"https://openalex.org/S4306400757","display_name":"eCommons (Cornell University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"technical report"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W21055737","https://openalex.org/W1528546869","https://openalex.org/W1533868172","https://openalex.org/W1573409602","https://openalex.org/W1973117121","https://openalex.org/W1980845317","https://openalex.org/W1982967176","https://openalex.org/W1996309927","https://openalex.org/W1996591064","https://openalex.org/W2026021734","https://openalex.org/W2030674458","https://openalex.org/W2031527878","https://openalex.org/W2034761330","https://openalex.org/W2044061073","https://openalex.org/W2070244796","https://openalex.org/W2072821511","https://openalex.org/W2074316151","https://openalex.org/W2086920040","https://openalex.org/W2116800096","https://openalex.org/W2168825111","https://openalex.org/W2599168675","https://openalex.org/W2611147814"],"related_works":["https://openalex.org/W2965106131","https://openalex.org/W2114808974","https://openalex.org/W2094757704","https://openalex.org/W25030584","https://openalex.org/W29231041","https://openalex.org/W2610104823","https://openalex.org/W1970997620","https://openalex.org/W2092044038","https://openalex.org/W2144582354","https://openalex.org/W2074889170"],"abstract_inverted_index":{"This":[0],"paper":[1],"describes":[2],"an":[3],"interior-point":[4],"algorithm":[5,35],"for":[6,51],"linear":[7],"programming":[8],"that":[9],"is":[10,46],"almost":[11],"as":[12,14],"simple":[13],"the":[15,21,52],"affine-scaling":[16],"method":[17],"and":[18],"yet":[19],"achieves":[20],"currently":[22],"best":[23],"complexity":[24],"of":[25],"$O(\\sqrt{n}":[26],"t)$":[27],"iterations":[28],"to":[29],"attain":[30],"precision":[31],"t.":[32],"The":[33],"basic":[34],"needs":[36],"neither":[37],"dual":[38],"estimates":[39],"nor":[40],"lower":[41],"bounds,":[42],"although":[43],"its":[44],"analysis":[45],"based":[47],"on":[48],"Ye\u2019s":[49],"results":[50],"primal\u2013dual":[53],"potential":[54],"function.":[55],"Some":[56],"computationally":[57],"preferable":[58],"variants":[59],"are":[60],"also":[61],"presented.":[62]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}