{"id":"https://openalex.org/W4415284046","doi":"https://doi.org/10.1007/s10589-025-00739-z","title":"Active set-based inexact proximal bundle algorithm for stochastic quadratic programming","display_name":"Active set-based inexact proximal bundle algorithm for stochastic quadratic programming","publication_year":2025,"publication_date":"2025-10-17","ids":{"openalex":"https://openalex.org/W4415284046","doi":"https://doi.org/10.1007/s10589-025-00739-z"},"language":"en","primary_location":{"id":"doi:10.1007/s10589-025-00739-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10589-025-00739-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10589-025-00739-z.pdf","source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Optimization and Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10589-025-00739-z.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5075469786","display_name":"Niloofar Fadavi","orcid":null},"institutions":[{"id":"https://openalex.org/I178169726","display_name":"Southern Methodist University","ror":"https://ror.org/042tdr378","country_code":"US","type":"education","lineage":["https://openalex.org/I178169726"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Niloofar Fadavi","raw_affiliation_strings":["Operations Research and Engineering Management, Southern Methodist University, Caruth Hall, 3145 Dyer St, Dallas, TX, 75205, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Operations Research and Engineering Management, Southern Methodist University, Caruth Hall, 3145 Dyer St, Dallas, TX, 75205, USA","institution_ids":["https://openalex.org/I178169726"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064906847","display_name":"Harsha Gangammanavar","orcid":"https://orcid.org/0000-0003-4389-5433"},"institutions":[{"id":"https://openalex.org/I178169726","display_name":"Southern Methodist University","ror":"https://ror.org/042tdr378","country_code":"US","type":"education","lineage":["https://openalex.org/I178169726"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Harsha Gangammanavar","raw_affiliation_strings":["Operations Research and Engineering Management, Southern Methodist University, Caruth Hall, 3145 Dyer St, Dallas, TX, 75205, USA"],"raw_orcid":"https://orcid.org/0000-0003-4389-5433","affiliations":[{"raw_affiliation_string":"Operations Research and Engineering Management, Southern Methodist University, Caruth Hall, 3145 Dyer St, Dallas, TX, 75205, USA","institution_ids":["https://openalex.org/I178169726"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5075469786"],"corresponding_institution_ids":["https://openalex.org/I178169726"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":{"value":2390,"currency":"EUR","value_usd":2990},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.33074158,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"93","issue":"2","first_page":"489","last_page":"521"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9991999864578247,"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.9991999864578247,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.996399998664856,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9961000084877014,"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.6237999796867371},{"id":"https://openalex.org/keywords/bundle","display_name":"Bundle","score":0.6103000044822693},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.5461000204086304},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.5429999828338623},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5313000082969666},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.46380001306533813},{"id":"https://openalex.org/keywords/sequential-quadratic-programming","display_name":"Sequential quadratic programming","score":0.3880000114440918},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.3779999911785126}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6376000046730042},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6237999796867371},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6230999827384949},{"id":"https://openalex.org/C2778134712","wikidata":"https://www.wikidata.org/wiki/Q1047307","display_name":"Bundle","level":2,"score":0.6103000044822693},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5536999702453613},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5461000204086304},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.5429999828338623},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5313000082969666},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.46380001306533813},{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.3880000114440918},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.3779999911785126},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.37139999866485596},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.3488999903202057},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.31859999895095825},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.29910001158714294},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.29339998960494995},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.2863999903202057},{"id":"https://openalex.org/C206588197","wikidata":"https://www.wikidata.org/wiki/Q846574","display_name":"Reuse","level":2,"score":0.2800000011920929},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.2750999927520752},{"id":"https://openalex.org/C55479107","wikidata":"https://www.wikidata.org/wiki/Q97663916","display_name":"Stochastic approximation","level":3,"score":0.2567000091075897},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.25060001015663147}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10589-025-00739-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10589-025-00739-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10589-025-00739-z.pdf","source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Optimization and Applications","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s10589-025-00739-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10589-025-00739-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10589-025-00739-z.pdf","source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Optimization and Applications","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4720003262","display_name":null,"funder_award_id":"N00014-22","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"},{"id":"https://openalex.org/G8876996369","display_name":null,"funder_award_id":"N00014","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"}],"funders":[{"id":"https://openalex.org/F4320318036","display_name":"Southern Methodist University","ror":"https://ror.org/042tdr378"},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4415284046.pdf"},"referenced_works_count":31,"referenced_works":["https://openalex.org/W290360019","https://openalex.org/W643478325","https://openalex.org/W1503492992","https://openalex.org/W1569990960","https://openalex.org/W1969007958","https://openalex.org/W2002569352","https://openalex.org/W2026365342","https://openalex.org/W2027852107","https://openalex.org/W2031244688","https://openalex.org/W2033957915","https://openalex.org/W2034662057","https://openalex.org/W2037360107","https://openalex.org/W2049266538","https://openalex.org/W2050388101","https://openalex.org/W2072675086","https://openalex.org/W2089472568","https://openalex.org/W2094721569","https://openalex.org/W2125657878","https://openalex.org/W2146818753","https://openalex.org/W2168469008","https://openalex.org/W2169988972","https://openalex.org/W2171467378","https://openalex.org/W2216549247","https://openalex.org/W2306672949","https://openalex.org/W2505844790","https://openalex.org/W2545770483","https://openalex.org/W3010146039","https://openalex.org/W3030444336","https://openalex.org/W4236139273","https://openalex.org/W4252698487","https://openalex.org/W4301014524"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"In":[1,40],"this":[2,71],"paper,":[3],"we":[4,73,145,159],"examine":[5],"two-stage":[6],"stochastic":[7,53],"quadratic":[8],"programming":[9],"problems,":[10],"where":[11],"the":[12,16,24,33,44,51,63,83,106,111,121,138,161,182],"objective":[13,108],"functions":[14],"of":[15,46,86,95,164,188],"first":[17,90],"and":[18,23,37,175],"second":[19],"stages":[20],"are":[21,26,66],"quadratic,":[22],"constraints":[25],"linear.":[27],"The":[28,89,178],"uncertainty":[29],"is":[30,55],"associated":[31],"with":[32,130],"second-stage":[34,98],"right-hand":[35],"side":[36],"variable":[38],"bounds.":[39],"large-scale":[41],"settings,":[42],"when":[43],"number":[45],"scenarios":[47],"necessary":[48],"to":[49,101,136,150,191],"represent":[50],"underlying":[52],"process":[54],"exuberantly":[56],"large,":[57],"standard":[58],"decomposition-based":[59],"methods":[60],"that":[61,80,181],"require":[62],"exact":[64,195],"solutions":[65,100,187],"computationally":[67],"prohibitive.":[68],"To":[69],"address":[70],"issue,":[72],"develop":[74],"two":[75],"inexact":[76,103,116,139],"proximal":[77,117],"bundle":[78,118],"algorithms":[79,166],"rely":[81],"on":[82,171],"efficient":[84],"reuse":[85],"solution":[87],"information.":[88],"algorithm":[91,119,184],"utilizes":[92,120],"a":[93,114,131,154],"collection":[94],"previously":[96],"encountered":[97],"dual":[99],"construct":[102,137],"minorants":[104],"for":[105],"expectation-valued":[107],"function.":[109],"On":[110],"other":[112],"hand,":[113],"partition-based":[115,183],"optimal":[122,151],"active":[123,133],"sets":[124],"obtained":[125,193],"in":[126],"earlier":[127],"iterations,":[128],"along":[129],"primal-dual":[132],"set":[134],"method,":[135],"minorant.":[140],"For":[141],"both":[142],"these":[143,165],"variants,":[144],"establish":[146],"their":[147],"asymptotic":[148],"convergence":[149],"solutions.":[152],"Using":[153],"carefully":[155],"developed":[156],"computer":[157],"implementation,":[158],"demonstrate":[160],"practical":[162],"behavior":[163],"through":[167],"numerical":[168],"experiments":[169],"conducted":[170],"power":[172],"systems":[173],"planning":[174],"operations":[176],"problems.":[177],"results":[179],"indicate":[180],"consistently":[185],"identifies":[186],"comparable":[189],"quality":[190],"those":[192],"from":[194],"algorithms,":[196],"while":[197],"significantly":[198],"reducing":[199],"computational":[200],"time.":[201]},"counts_by_year":[],"updated_date":"2026-02-01T03:34:12.195049","created_date":"2025-10-17T00:00:00"}