{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T23:52:26Z","timestamp":1769730746062,"version":"3.49.0"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T00:00:00Z","timestamp":1760659200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T00:00:00Z","timestamp":1760659200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100018258","name":"Southern Methodist University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100018258","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2026,3]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>In this paper, we examine two-stage stochastic quadratic programming problems, where the objective functions of the first and second stages are quadratic, and the constraints are linear. The uncertainty is associated with the second-stage right-hand side and variable bounds. In large-scale settings, when the number of scenarios necessary to represent the underlying stochastic process is exuberantly large, standard decomposition-based methods that require the exact solutions are computationally prohibitive. To address this issue, we develop two inexact proximal bundle algorithms that rely on the efficient reuse of solution information. The first algorithm utilizes a collection of previously encountered second-stage dual solutions to construct inexact minorants for the expectation-valued objective function. On the other hand, a partition-based inexact proximal bundle algorithm utilizes the optimal active sets obtained in earlier iterations, along with a primal-dual active set method, to construct the inexact minorant. For both these variants, we establish their asymptotic convergence to optimal solutions. Using a carefully developed computer implementation, we demonstrate the practical behavior of these algorithms through numerical experiments conducted on power systems planning and operations problems. The results indicate that the partition-based algorithm consistently identifies solutions of comparable quality to those obtained from exact algorithms, while significantly reducing computational time.<\/jats:p>","DOI":"10.1007\/s10589-025-00739-z","type":"journal-article","created":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T16:46:54Z","timestamp":1760719614000},"page":"489-521","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Active set-based inexact proximal bundle algorithm for stochastic quadratic programming"],"prefix":"10.1007","volume":"93","author":[{"given":"Niloofar","family":"Fadavi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4389-5433","authenticated-orcid":false,"given":"Harsha","family":"Gangammanavar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,17]]},"reference":[{"issue":"1","key":"739_CR1","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1137\/0114008","volume":"14","author":"RR-J Wets","year":"1966","unstructured":"Wets, R.R.-J.: Programming under uncertainty: the equivalent convex program. SIAM J. Appl. Math. 14(1), 89\u2013105 (1966)","journal-title":"SIAM J. Appl. Math."},{"issue":"1","key":"739_CR2","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1287\/moor.16.1.119","volume":"16","author":"RT Rockafellar","year":"1991","unstructured":"Rockafellar, R.T., Wets, R.-J.: Scenarios and policy aggregation in optimization under uncertainty. Math. Oper. Res. 16(1), 119\u2013147 (1991)","journal-title":"Math. Oper. Res."},{"key":"739_CR3","first-page":"63","volume-title":"A Lagrangian Finite Generation Technique for Solving Linear-Quadratic Problems in Stochastic Programming","year":"1986","unstructured":"Rockafellar, R.T., Pre\u00e9kopa, A., Wets, R.J.-B., Wets, R.J.-B. (eds.): A Lagrangian Finite Generation Technique for Solving Linear-Quadratic Problems in Stochastic Programming, pp. 63\u201393. Springer, Berlin (1986)"},{"issue":"1\u20132","key":"739_CR4","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0377-0427(94)00082-C","volume":"60","author":"X Chen","year":"1995","unstructured":"Chen, X., Qi, L., Womersley, R.S.: Newton\u2019s method for quadratic stochastic programs with recourse. J. Comput. Appl. Math. 60(1\u20132), 29\u201346 (1995)","journal-title":"J. Comput. Appl. Math."},{"issue":"4","key":"739_CR5","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1287\/opre.1080.0659","volume":"57","author":"S Mehrotra","year":"2009","unstructured":"Mehrotra, S., Ozevin, M.G.: Decomposition based interior point methods for two-stage stochastic convex quadratic programs with recourse. Oper. Res. 57(4), 964\u2013974 (2009)","journal-title":"Oper. Res."},{"key":"739_CR6","unstructured":"Birge, J.R., Qi, L., Chen, X.: A stochastic newton method for stochastic quadratic programs with recourse. Technical report AM94\/9, School of Mathematics, University of New South Wales (1995)"},{"issue":"1","key":"739_CR7","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1137\/19M1247796","volume":"30","author":"J Liu","year":"2020","unstructured":"Liu, J., Sen, S.: Asymptotic results of stochastic decomposition for two-stage stochastic quadratic programming. SIAM J. Optim. 30(1), 823\u2013852 (2020)","journal-title":"SIAM J. Optim."},{"key":"739_CR8","unstructured":"Lemar\u00e9chal, C.: Nonsmooth optimization and descent methods. Technical report research report RR-78-4, International Institute of Applied Systems Analysis (1978)"},{"issue":"3","key":"739_CR9","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/BF01580883","volume":"35","author":"A Ruszczy\u0144ski","year":"1986","unstructured":"Ruszczy\u0144ski, A.: A regularized decomposition method for minimizing a sum of polyhedral functions. Math. Program. 35(3), 309\u2013333 (1986)","journal-title":"Math. Program."},{"issue":"3","key":"739_CR10","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1023\/A:1011259017643","volume":"20","author":"M Hinterm\u00fcller","year":"2001","unstructured":"Hinterm\u00fcller, M.: A proximal bundle method based on approximate subgradients. Comput. Optim. Appl. 20(3), 245\u2013266 (2001)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"739_CR11","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1137\/040603929","volume":"16","author":"KC Kiwiel","year":"2006","unstructured":"Kiwiel, K.C.: A proximal bundle method with approximate subgradient linearizations. SIAM J. Optim. 16(4), 1007\u20131023 (2006)","journal-title":"SIAM J. Optim."},{"key":"739_CR12","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s10107-014-0809-6","volume":"148","author":"W Oliveira","year":"2014","unstructured":"Oliveira, W., Sagastiz\u00e1bal, C., Lemar\u00e9chal, C.: Convex proximal bundle methods in depth: a unified analysis for inexact oracles. Math. Program. 148, 241\u2013277 (2014)","journal-title":"Math. Program."},{"issue":"2","key":"739_CR13","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1137\/100808289","volume":"21","author":"W Oliveira","year":"2011","unstructured":"Oliveira, W., Sagastiz\u00e1bal, C., Scheimberg, S.: Inexact bundle methods for two-stage stochastic programming. SIAM J. Optim. 21(2), 517\u2013544 (2011)","journal-title":"SIAM J. Optim."},{"issue":"1\u20133","key":"739_CR14","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BF01582219","volume":"67","author":"JL Higle","year":"1994","unstructured":"Higle, J.L., Sen, S.: Finite master programs in regularized stochastic decomposition. Math. Program. 67(1\u20133), 143\u2013168 (1994)","journal-title":"Math. Program."},{"issue":"1","key":"739_CR15","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01585555","volume":"69","author":"C Lemar\u00e9chal","year":"1995","unstructured":"Lemar\u00e9chal, C., Nemirovskii, A., Nesterov, Y.: New variants of bundle methods. Math. Program. 69(1), 111\u2013147 (1995)","journal-title":"Math. Program."},{"issue":"1","key":"739_CR16","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/BF01585554","volume":"69","author":"KC Kiwiel","year":"1995","unstructured":"Kiwiel, K.C.: Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities. Math. Program. 69(1), 89\u2013109 (1995)","journal-title":"Math. Program."},{"issue":"1","key":"739_CR17","first-page":"35","volume":"8","author":"CI F\u00e1bi\u00e1n","year":"2000","unstructured":"F\u00e1bi\u00e1n, C.I.: Bundle-type methods for inexact data. CEJOR 8(1), 35\u201355 (2000)","journal-title":"CEJOR"},{"issue":"6","key":"739_CR18","doi-asserted-by":"publisher","first-page":"1180","DOI":"10.1080\/10556788.2013.871282","volume":"29","author":"W Oliveira","year":"2014","unstructured":"Oliveira, W., Sagastiz\u00e1bal, C.: Level bundle methods for oracles with on-demand accuracy. Optim. Methods Softw. 29(6), 1180\u20131209 (2014)","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"739_CR19","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/j.ejor.2014.05.010","volume":"239","author":"C Wolf","year":"2014","unstructured":"Wolf, C., F\u00e1bi\u00e1n, C.I., Koberstein, A., Suhl, L.: Applying oracles of on-demand accuracy in two-stage stochastic programming-a computational study. Eur. J. Oper. Res. 239(2), 437\u2013448 (2014)","journal-title":"Eur. J. Oper. Res."},{"key":"739_CR20","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s10287-006-0026-8","volume":"4","author":"CI F\u00e1bi\u00e1n","year":"2007","unstructured":"F\u00e1bi\u00e1n, C.I., Sz\u0151ke, Z.: Solving two-stage stochastic programming problems with level decomposition. CMS 4, 313\u2013353 (2007)","journal-title":"CMS"},{"key":"739_CR21","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/s10107-015-0966-2","volume":"159","author":"A Forsgren","year":"2016","unstructured":"Forsgren, A., Gill, P.E., Wong, E.: Primal and dual active-set methods for convex quadratic programming. Math. Program. 159, 469\u2013508 (2016)","journal-title":"Math. Program."},{"key":"739_CR22","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization, 2nd edn. Springer, New York (2006)","edition":"2"},{"issue":"3","key":"739_CR23","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1137\/S1052623401383558","volume":"13","author":"M Hinterm\u00fcller","year":"2002","unstructured":"Hinterm\u00fcller, M., Ito, K., Kunisch, K.: The primal-dual active set strategy as a semismooth Newton method. SIAM J. Optim. 13(3), 865\u2013888 (2002)","journal-title":"SIAM J. Optim."},{"key":"739_CR24","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s10589-014-9681-9","volume":"60","author":"FE Curtis","year":"2015","unstructured":"Curtis, F.E., Han, Z., Robinson, D.P.: A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization. Comput. Optim. Appl. 60, 311\u2013341 (2015)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"739_CR25","doi-asserted-by":"publisher","first-page":"2261","DOI":"10.1137\/140993314","volume":"26","author":"FE Curtis","year":"2016","unstructured":"Curtis, F.E., Han, Z.: Globally convergent primal-dual active-set methods with inexact subproblem solves. SIAM J. Optim. 26(4), 2261\u20132283 (2016)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"739_CR26","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1090\/qam\/112751","volume":"18","author":"WS Dorn","year":"1960","unstructured":"Dorn, W.S.: Duality in quadratic programming. Q. Appl. Math. 18(2), 155\u2013162 (1960)","journal-title":"Q. Appl. Math."},{"issue":"1","key":"739_CR27","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1137\/S0363012902411015","volume":"43","author":"K Ito","year":"2004","unstructured":"Ito, K., Kunisch, K.: The primal-dual active set method for nonlinear optimal control problems with bilateral constraints. SIAM J. Control. Optim. 43(1), 357\u2013376 (2004)","journal-title":"SIAM J. Control. Optim."},{"key":"739_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-0237-4","volume-title":"Introduction to Stochastic Programming","author":"JR Birge","year":"2011","unstructured":"Birge, J.R., Louveaux, F.: Introduction to Stochastic Programming. Springer, New York (2011)"},{"key":"739_CR29","first-page":"1","volume":"10","author":"A Ruszczy\u0144ski","year":"2003","unstructured":"Ruszczy\u0144ski, A., Shapiro, A.: Stochastic programming models. Handb. Oper. Res. Manag. Sci. 10, 1\u201364 (2003)","journal-title":"Handb. Oper. Res. Manag. Sci."},{"key":"739_CR30","volume-title":"Large Scale Linear Programming Techniques in Stochastic Programming","author":"RR-J Wets","year":"1988","unstructured":"Wets, R.R.-J.: 3. In: Ermoliev, Y., Wets, R. (eds.) Large Scale Linear Programming Techniques in Stochastic Programming. Springer (1988)"},{"issue":"3","key":"739_CR31","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1137\/S1052623497318700","volume":"10","author":"G Zakeri","year":"2000","unstructured":"Zakeri, G., Philpott, A.B., Ryan, D.M.: Inexact cuts in benders decomposition. SIAM J. Optim. 10(3), 643\u2013657 (2000)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"739_CR32","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1287\/ijoc.2019.0929","volume":"33","author":"H Gangammanavar","year":"2021","unstructured":"Gangammanavar, H., Liu, Y., Sen, S.: Stochastic decomposition for two-stage stochastic linear programs with random cost coefficients. INFORMS J. Comput. 33(1), 51\u201371 (2021)","journal-title":"INFORMS J. Comput."},{"key":"739_CR33","doi-asserted-by":"publisher","DOI":"10.1002\/9781118593103","volume-title":"Handbook of Probability","author":"I Florescu","year":"2013","unstructured":"Florescu, I., Tudor, C.A.: Handbook of Probability. Wiley (2013)"},{"key":"739_CR34","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4115-8","volume-title":"Stochastic Decomposition: A Statistical Method for Large Scale Stochastic Linear Programming","author":"JL Higle","year":"1996","unstructured":"Higle, J.L., Sen, S.: Stochastic Decomposition: A Statistical Method for Large Scale Stochastic Linear Programming. Kluwer Academic Publishers, Boston (1996)"},{"key":"739_CR35","unstructured":"Christie, R.: Power Systems Test Case Archive, 1999 (2015)"},{"key":"739_CR36","doi-asserted-by":"publisher","unstructured":"Gassmann, H.I.: 2. The SMPS Format for Stochastic Linear Programs, pp. 9\u201319. https:\/\/doi.org\/10.1137\/1.9780898718799.ch2. https:\/\/epubs.siam.org\/doi\/abs\/10.1137\/1.9780898718799.ch2","DOI":"10.1137\/1.9780898718799.ch2"},{"key":"739_CR37","doi-asserted-by":"publisher","unstructured":"Shapiro, A., Dentcheva, D., Ruszczynski, A.: Lectures on Stochastic Programming: Modeling and Theory, 3rd edn. Society for Industrial and Applied Mathematics, Philadelphia (2021). https:\/\/doi.org\/10.1137\/1.9781611976595","DOI":"10.1137\/1.9781611976595"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-025-00739-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-025-00739-z","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-025-00739-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T12:01:52Z","timestamp":1769688112000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-025-00739-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,17]]},"references-count":37,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["739"],"URL":"https:\/\/doi.org\/10.1007\/s10589-025-00739-z","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,17]]},"assertion":[{"value":"28 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 October 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare they have no financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}