{"id":"https://openalex.org/W7135021324","doi":"https://doi.org/10.48550/arxiv.2603.10230","title":"A Trust-Region Interior-Point Stochastic Sequential Quadratic Programming Method","display_name":"A Trust-Region Interior-Point Stochastic Sequential Quadratic Programming Method","publication_year":2026,"publication_date":"2026-03-10","ids":{"openalex":"https://openalex.org/W7135021324","doi":"https://doi.org/10.48550/arxiv.2603.10230"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.10230","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.10230","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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.2603.10230","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101552118","display_name":"Yuchen Fang","orcid":"https://orcid.org/0000-0002-7882-8698"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fang, Yuchen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082216544","display_name":"Jihun Kim","orcid":"https://orcid.org/0009-0002-9692-0030"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kim, Jihun","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056179845","display_name":"Sen Na","orcid":"https://orcid.org/0000-0002-7977-5276"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Na, Sen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5128815093","display_name":"James Demmel","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Demmel, James","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5128895554","display_name":"Javad Lavaei","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lavaei, Javad","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/T11413","display_name":"Risk and Portfolio Optimization","score":0.5101000070571899,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.5101000070571899,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.2944999933242798,"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.05310000106692314,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5527999997138977},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.534600019454956},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.5238999724388123},{"id":"https://openalex.org/keywords/sequential-quadratic-programming","display_name":"Sequential quadratic programming","score":0.4966999888420105},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4553000032901764},{"id":"https://openalex.org/keywords/stochastic-optimization","display_name":"Stochastic optimization","score":0.45170000195503235},{"id":"https://openalex.org/keywords/stochastic-approximation","display_name":"Stochastic approximation","score":0.4171000123023987},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.41499999165534973},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.38530001044273376}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7096999883651733},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6416000127792358},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5527999997138977},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.534600019454956},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.5238999724388123},{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.4966999888420105},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4553000032901764},{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.45170000195503235},{"id":"https://openalex.org/C55479107","wikidata":"https://www.wikidata.org/wiki/Q97663916","display_name":"Stochastic approximation","level":3,"score":0.4171000123023987},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.41499999165534973},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.38909998536109924},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.38530001044273376},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.3587000072002411},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.35850000381469727},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.3549000024795532},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.30079999566078186},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2888000011444092},{"id":"https://openalex.org/C8272713","wikidata":"https://www.wikidata.org/wiki/Q176737","display_name":"Stochastic process","level":2,"score":0.2809000015258789},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2786000072956085},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.2784000039100647},{"id":"https://openalex.org/C95763700","wikidata":"https://www.wikidata.org/wiki/Q578985","display_name":"Convergence of random variables","level":3,"score":0.2782000005245209},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.2750999927520752},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.2680000066757202},{"id":"https://openalex.org/C141042865","wikidata":"https://www.wikidata.org/wiki/Q200125","display_name":"Expected value","level":2,"score":0.25679999589920044},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2502000033855438}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.10230","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.10230","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.10230","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.10230","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.5350620150566101}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0,29,50],"this":[1,30],"paper,":[2],"we":[3,81,100],"propose":[4],"a":[5,19,74,93,118],"trust-region":[6],"interior-point":[7,84],"stochastic":[8,20,45,58],"sequential":[9],"quadratic":[10],"programming":[11],"(TR-IP-SSQP)":[12],"method":[13,56,85,108,116],"for":[14],"solving":[15],"optimization":[16],"problems":[17,121],"with":[18,73],"objective":[21,36,63],"and":[22,26,38,65],"deterministic":[23],"nonlinear":[24],"equality":[25],"inequality":[27,79],"constraints.":[28],"setting,":[31],"exact":[32],"evaluations":[33],"of":[34,105,120],"the":[35,62,89,106,115,123],"function":[37],"its":[39,136],"gradient":[40,66],"are":[41],"unavailable,":[42],"but":[43],"their":[44],"estimates":[46],"can":[47],"be":[48],"constructed.":[49],"particular,":[51],"at":[52],"each":[53],"iteration":[54],"our":[55],"builds":[57],"oracles,":[59],"which":[60,88],"estimate":[61],"value":[64],"to":[67,109,134],"satisfy":[68],"proper":[69],"adaptive":[70],"accuracy":[71],"conditions":[72],"fixed":[75],"probability.":[76],"To":[77],"handle":[78],"constraints,":[80],"adopt":[82],"an":[83],"(IPM),":[86],"in":[87],"barrier":[90],"parameter":[91],"follows":[92],"prescribed":[94],"decaying":[95],"sequence.":[96],"Under":[97],"standard":[98],"assumptions,":[99],"establish":[101],"global":[102],"almost-sure":[103],"convergence":[104],"proposed":[107],"first-order":[110],"stationary":[111],"points.":[112],"We":[113],"implement":[114],"on":[117,130],"subset":[119],"from":[122],"CUTEst":[124],"test":[125],"set,":[126],"as":[127,129],"well":[128],"logistic":[131],"regression":[132],"problems,":[133],"demonstrate":[135],"practical":[137],"performance.":[138]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-03-13T00:00:00"}