{"id":"https://openalex.org/W2093180021","doi":"https://doi.org/10.1137/0805003","title":"Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming","display_name":"Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming","publication_year":1995,"publication_date":"1995-02-01","ids":{"openalex":"https://openalex.org/W2093180021","doi":"https://doi.org/10.1137/0805003","mag":"2093180021"},"language":"en","primary_location":{"id":"doi:10.1137/0805003","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0805003","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/A5113643531","display_name":"Shinji Mizuno","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shinji Mizuno","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113974670","display_name":"Masakazu Kojima","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Masakazu Kojima","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5102817920","display_name":"Michael J. Todd","orcid":"https://orcid.org/0000-0001-9458-3443"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michael J. Todd","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":13.9904,"has_fulltext":false,"cited_by_count":60,"citation_normalized_percentile":{"value":0.99385965,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"5","issue":"1","first_page":"52","last_page":"67"},"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/T11435","display_name":"Polynomial and algebraic computation","score":0.9962000250816345,"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.9890999794006348,"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.8070249557495117},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7908357381820679},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.7021035552024841},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.6550393104553223},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.6020174622535706},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5686389803886414},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5566166043281555},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4843657910823822},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4805039167404175},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4790583550930023},{"id":"https://openalex.org/keywords/duality","display_name":"Duality (order theory)","score":0.4600306749343872},{"id":"https://openalex.org/keywords/duality-gap","display_name":"Duality gap","score":0.43234843015670776},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.41399532556533813},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.2757844924926758},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2034292221069336},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1486341655254364}],"concepts":[{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.8070249557495117},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7908357381820679},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.7021035552024841},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.6550393104553223},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.6020174622535706},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5686389803886414},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5566166043281555},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4843657910823822},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4805039167404175},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4790583550930023},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.4600306749343872},{"id":"https://openalex.org/C5274546","wikidata":"https://www.wikidata.org/wiki/Q5310264","display_name":"Duality gap","level":3,"score":0.43234843015670776},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.41399532556533813},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2757844924926758},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2034292221069336},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1486341655254364},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/0805003","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0805003","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.29.4214","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.4214","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.orie.cornell.edu/pub/techreps/TR1023.ps.Z","raw_type":"text"},{"id":"pmh:oai:ecommons.cornell.edu:1813/8908","is_oa":false,"landing_page_url":"https://hdl.handle.net/1813/8908","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"},{"id":"pmh:oai:t2r2.star.titech.ac.jp:00032019","is_oa":false,"landing_page_url":"http://t2r2.star.titech.ac.jp/cgi-bin/publicationinfo.cgi?q_publication_content_number=CTT100429694","pdf_url":null,"source":{"id":"https://openalex.org/S4377196385","display_name":"Tokyo Tech Research Repository (Tokyo Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I114531698","host_organization_name":"Tokyo Institute of Technology","host_organization_lineage":["https://openalex.org/I114531698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W34169854","https://openalex.org/W1533868172","https://openalex.org/W1573409602","https://openalex.org/W1997656066","https://openalex.org/W2014885585","https://openalex.org/W2022004439","https://openalex.org/W2030490984","https://openalex.org/W2030674458","https://openalex.org/W2041443873","https://openalex.org/W2043868859","https://openalex.org/W2044061073","https://openalex.org/W2066864762","https://openalex.org/W2074316151","https://openalex.org/W2079401288","https://openalex.org/W2089389443","https://openalex.org/W2094757704","https://openalex.org/W2108201835","https://openalex.org/W2168825111","https://openalex.org/W2599168675","https://openalex.org/W2611147814"],"related_works":["https://openalex.org/W2593555778","https://openalex.org/W2121876331","https://openalex.org/W2201555914","https://openalex.org/W2725387418","https://openalex.org/W2614523486","https://openalex.org/W2089739134","https://openalex.org/W640885572","https://openalex.org/W4220928172","https://openalex.org/W2046743339","https://openalex.org/W2000354435"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"primal-dual":[3,37],"potential-reduction":[4],"algorithms":[5,22,33,113],"are":[6,27,101],"proposed":[7],"that":[8,25,49,106],"can":[9],"start":[10],"from":[11],"an":[12],"infeasible":[13],"interior":[14],"point.":[15],"The":[16,63,112],"authors":[17],"first":[18],"describe":[19],"two":[20],"such":[21],"and":[23],"show":[24],"both":[26],"polynomial-time":[28],"bounded.":[29],"One":[30],"of":[31,98,119],"the":[32,35,47,50,57,61,77,93,117],"decreases":[34,53],"Tanabe\u2013Todd\u2013Ye":[36,78],"potential":[38,69,79],"function":[39],"by":[40,54,81],"a":[41,67,82],"constant":[42,84],"at":[43,55,85],"each":[44,86],"iteration":[45,87],"under":[46],"condition":[48],"duality":[51],"gap":[52],"most":[56],"same":[58],"ratio":[59],"as":[60],"infeasibility.":[62],"other":[64,90],"algorithm":[65],"reduces":[66],"new":[68],"function,":[70,80],"which":[71],"has":[72],"one":[73],"more":[74],"term":[75],"in":[76],"fixed":[83],"without":[88],"any":[89],"conditions":[91],"on":[92],"step":[94],"size.":[95],"Finally,":[96],"modifications":[97],"these":[99],"methods":[100],"described":[102],"(incorporating":[103],"centering":[104],"steps)":[105],"dramatically":[107],"decrease":[108],"their":[109],"computational":[110],"complexity.":[111],"also":[114],"extend":[115],"to":[116],"case":[118],"monotone":[120],"linear":[121],"complementarily":[122],"problems.":[123]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}