{"id":"https://openalex.org/W2095857169","doi":"https://doi.org/10.1137/070693461","title":"A Polynomial Predictor-Corrector Trust-Region Algorithm for Linear Programming","display_name":"A Polynomial Predictor-Corrector Trust-Region Algorithm for Linear Programming","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2095857169","doi":"https://doi.org/10.1137/070693461","mag":"2095857169"},"language":"en","primary_location":{"id":"doi:10.1137/070693461","is_oa":false,"landing_page_url":"https://doi.org/10.1137/070693461","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/A5042544900","display_name":"Guanghui Lan","orcid":"https://orcid.org/0000-0002-2103-087X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Guanghui Lan","raw_affiliation_strings":["glan@isye.gatech.edu and monteiro@isye.gatech.edu#TAB#"],"affiliations":[{"raw_affiliation_string":"glan@isye.gatech.edu and monteiro@isye.gatech.edu#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108765688","display_name":"Renato D. C. Monteiro","orcid":null},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Renato D. C. Monteiro","raw_affiliation_strings":["[Georgia Institute of Technology.]"],"affiliations":[{"raw_affiliation_string":"[Georgia Institute of Technology.]","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020790231","display_name":"Takashi Tsuchiya","orcid":"https://orcid.org/0000-0002-6950-6160"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Takashi Tsuchiya","raw_affiliation_strings":["tsuchiya@sun312.ism.ac.jp#TAB#"],"affiliations":[{"raw_affiliation_string":"tsuchiya@sun312.ism.ac.jp#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5042544900"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4715,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.66760431,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"19","issue":"4","first_page":"1918","last_page":"1946"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9944999814033508,"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/T11435","display_name":"Polynomial and algebraic computation","score":0.9901999831199646,"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/mathematics","display_name":"Mathematics","score":0.8422784805297852},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.7198000550270081},{"id":"https://openalex.org/keywords/scaling","display_name":"Scaling","score":0.6497188210487366},{"id":"https://openalex.org/keywords/trust-region","display_name":"Trust region","score":0.61885666847229},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5982661247253418},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5723313689231873},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5643036365509033},{"id":"https://openalex.org/keywords/invariant","display_name":"Invariant (physics)","score":0.5390616655349731},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5380231142044067},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.500211238861084},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.41879022121429443},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3554862141609192},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.16392731666564941},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.09700870513916016}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8422784805297852},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.7198000550270081},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.6497188210487366},{"id":"https://openalex.org/C89109886","wikidata":"https://www.wikidata.org/wiki/Q1535924","display_name":"Trust region","level":3,"score":0.61885666847229},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5982661247253418},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5723313689231873},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5643036365509033},{"id":"https://openalex.org/C190470478","wikidata":"https://www.wikidata.org/wiki/Q2370229","display_name":"Invariant (physics)","level":2,"score":0.5390616655349731},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5380231142044067},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.500211238861084},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.41879022121429443},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3554862141609192},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.16392731666564941},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.09700870513916016},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","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/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.0},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/070693461","is_oa":false,"landing_page_url":"https://doi.org/10.1137/070693461","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W34169854","https://openalex.org/W47264501","https://openalex.org/W165985421","https://openalex.org/W1533868172","https://openalex.org/W1573409602","https://openalex.org/W1577199596","https://openalex.org/W1973117121","https://openalex.org/W1978913642","https://openalex.org/W2000957535","https://openalex.org/W2012696830","https://openalex.org/W2014885585","https://openalex.org/W2021505225","https://openalex.org/W2030674458","https://openalex.org/W2032368946","https://openalex.org/W2035532822","https://openalex.org/W2036622774","https://openalex.org/W2049432961","https://openalex.org/W2054543516","https://openalex.org/W2059969305","https://openalex.org/W2074316151","https://openalex.org/W2076684514","https://openalex.org/W2077875563","https://openalex.org/W2103985627","https://openalex.org/W2125815834","https://openalex.org/W2127378310","https://openalex.org/W2168825111","https://openalex.org/W2172044747","https://openalex.org/W2611147814","https://openalex.org/W3216259776","https://openalex.org/W4205492143","https://openalex.org/W4241510060","https://openalex.org/W4243297076","https://openalex.org/W4251295118"],"related_works":["https://openalex.org/W2965106131","https://openalex.org/W2114808974","https://openalex.org/W2094757704","https://openalex.org/W25030584","https://openalex.org/W2610104823","https://openalex.org/W1970997620","https://openalex.org/W2092044038","https://openalex.org/W29231041","https://openalex.org/W2144582354","https://openalex.org/W2074889170"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3],"present":[4],"a":[5,27,54,63],"scaling-invariant,":[6],"interior-point,":[7],"predictor-corrector":[8],"type":[9,57],"algorithm":[10,41,119],"for":[11],"linear":[12],"programming":[13],"(LP)":[14],"whose":[15,59,95],"iteration-complexity":[16],"is":[17,110],"polynomially":[18],"bounded":[19],"by":[20,70],"the":[21,24,32,37,40,44,47,67,71,77,102,113,118,123,127,130,135,139,142],"dimension":[22],"and":[23,86,126],"logarithm":[25],"of":[26,31,66,101,117,129,134,141],"certain":[28],"condition":[29],"number":[30],"LP":[33,131],"constraint":[34],"matrix.":[35],"At":[36],"predictor":[38],"stage,":[39],"either":[42],"takes":[43],"step":[45],"along":[46],"standard":[48],"affine":[49],"scaling":[50],"(AS)":[51],"direction":[52,81],"or":[53],"new":[55],"trust-region":[56],"direction,":[58],"construction":[60,96],"depends":[61,97,121],"on":[62,98,122],"scaling-invariant":[64],"bipartition":[65],"variables":[68,103],"determined":[69],"AS":[72],"direction.":[73],"This":[74],"contrasts":[75],"with":[76],"layered":[78],"least":[79],"squares":[80],"introduced":[82],"in":[83,132,138],"S.":[84],"Vavasis":[85],"Y.":[87],"Ye":[88],"[Math.":[89],"Program.,":[90],"74":[91],"(1996),":[92],"pp.":[93],"79\u2013120],":[94],"multiple-layered":[99],"partitions":[100],"that":[104,112],"are":[105],"not":[106],"scaling-invariant.":[107],"Moreover,":[108],"it":[109],"shown":[111],"overall":[114],"arithmetic":[115],"complexity":[116],"(weakly)":[120],"right-hand":[124],"side":[125],"cost":[128],"view":[133],"work":[136],"involved":[137],"computation":[140],"trust":[143],"region":[144],"steps.":[145]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}