{"id":"https://openalex.org/W7157054851","doi":"https://doi.org/10.48550/arxiv.2604.24488","title":"Scalable First-Order Interior Point Trust Region Algorithms for Linearly Constrained Optimization","display_name":"Scalable First-Order Interior Point Trust Region Algorithms for Linearly Constrained Optimization","publication_year":2026,"publication_date":"2026-04-27","ids":{"openalex":"https://openalex.org/W7157054851","doi":"https://doi.org/10.48550/arxiv.2604.24488"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.24488","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.24488","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"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":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.24488","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5134778243","display_name":"Yuexin Su","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Su, Yuexin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5134818673","display_name":"Chenyi Zhang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhang, Chenyi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5134816295","display_name":"Peiyuan Huang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Huang, Peiyuan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5134808814","display_name":"Tongyang Li","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li, Tongyang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5134775121","display_name":"Yinyu Ye","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ye, Yinyu","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":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.76910001039505,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.76910001039505,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.15549999475479126,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.041200000792741776,"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/karush\u2013kuhn\u2013tucker-conditions","display_name":"Karush\u2013Kuhn\u2013Tucker conditions","score":0.8342999815940857},{"id":"https://openalex.org/keywords/hessian-matrix","display_name":"Hessian matrix","score":0.7081999778747559},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6427000164985657},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6097000241279602},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.5800999999046326},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.5672000050544739},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.5202999711036682},{"id":"https://openalex.org/keywords/constrained-optimization","display_name":"Constrained optimization","score":0.5195000171661377},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4887999892234802},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.4821000099182129}],"concepts":[{"id":"https://openalex.org/C50454189","wikidata":"https://www.wikidata.org/wiki/Q2075125","display_name":"Karush\u2013Kuhn\u2013Tucker conditions","level":2,"score":0.8342999815940857},{"id":"https://openalex.org/C203616005","wikidata":"https://www.wikidata.org/wiki/Q620495","display_name":"Hessian matrix","level":2,"score":0.7081999778747559},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.657800018787384},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6427000164985657},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6097000241279602},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.5800999999046326},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5717999935150146},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.5672000050544739},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.5202999711036682},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.5195000171661377},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.506600022315979},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4887999892234802},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4821000099182129},{"id":"https://openalex.org/C89109886","wikidata":"https://www.wikidata.org/wiki/Q1535924","display_name":"Trust region","level":3,"score":0.42910000681877136},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.37560001015663147},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.367900013923645},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3646000027656555},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.35420000553131104},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.3472000062465668},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.3441999852657318},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.34119999408721924},{"id":"https://openalex.org/C2989514635","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization problem","level":3,"score":0.3400999903678894},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.3294000029563904},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.32330000400543213},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.29280000925064087},{"id":"https://openalex.org/C189237950","wikidata":"https://www.wikidata.org/wiki/Q2500758","display_name":"Stationary point","level":2,"score":0.2768999934196472},{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.2757999897003174},{"id":"https://openalex.org/C143587482","wikidata":"https://www.wikidata.org/wiki/Q1543216","display_name":"Iterative and incremental development","level":2,"score":0.2671000063419342},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.2630999982357025},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.2619999945163727},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.25589999556541443},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.2500999867916107}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.24488","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.24488","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.24488","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.24488","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"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":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Computing":[0],"approximate":[1,64,80,113,142],"Karush--Kuhn--Tucker":[2],"(KKT)":[3],"points":[4,116],"for":[5,23],"constrained":[6],"nonconvex":[7],"programs":[8],"is":[9,48],"a":[10,39,123,154],"fundamental":[11],"problem":[12],"in":[13,146],"mathematical":[14],"programming.":[15],"Interior-point":[16],"trust-region":[17,55,75],"(IPTR)":[18],"methods":[19],"are":[20],"particularly":[21],"attractive":[22],"such":[24],"problems":[25],"because":[26],"they":[27],"maintain":[28],"strictly":[29],"feasible":[30],"iterates":[31],"throughout":[32],"the":[33,51,92,103,109,138,158],"iterative":[34],"process":[35],"and":[36,41,91],"converge":[37],"to":[38,111,136,153],"first-order":[40,65,119,143,160],"second-order":[42,114],"KKT":[43,115],"solution.":[44],"Their":[45],"scalability,":[46],"however,":[47],"limited":[49],"by":[50,72,121],"repeated":[52],"computation":[53],"of":[54,96,140],"search":[56],"directions.":[57],"In":[58],"this":[59,70],"paper,":[60],"we":[61],"propose":[62],"an":[63,79],"IPTR":[66,98,144,161],"framework":[67,110,145],"that":[68],"addresses":[69],"bottleneck":[71],"replacing":[73],"exact":[74],"subproblem":[76],"solves":[77],"with":[78],"projector":[81],"maintained":[82],"through":[83],"low-rank":[84],"updates.":[85],"The":[86],"resulting":[87],"method":[88],"preserves":[89],"feasibility":[90],"global":[93],"convergence":[94],"guarantees":[95],"standard":[97],"schemes":[99],"while":[100],"substantially":[101],"reducing":[102],"per-iteration":[104],"cost.":[105],"We":[106,132],"further":[107],"extend":[108],"obtain":[112],"using":[117],"only":[118],"information":[120],"integrating":[122],"gradient-based":[124],"negative-curvature":[125],"routine,":[126],"thus":[127],"avoiding":[128],"explicit":[129],"Hessian":[130],"computations.":[131],"conduct":[133],"numerical":[134],"experiments":[135],"demonstrate":[137],"scalability":[139],"our":[141],"large-scale":[147],"settings,":[148],"where":[149],"it":[150],"achieves":[151],"up":[152],"$2.48\\times$":[155],"speedup":[156],"over":[157],"existing":[159],"algorithm.":[162]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-04-29T00:00:00"}