{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T09:18:34Z","timestamp":1781342314096,"version":"3.54.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2023,12,11]],"date-time":"2023-12-11T00:00:00Z","timestamp":1702252800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,11]],"date-time":"2023-12-11T00:00:00Z","timestamp":1702252800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100006602","name":"Air Force Research Laboratory","doi-asserted-by":"publisher","award":["FA9550-22-1-0088"],"award-info":[{"award-number":["FA9550-22-1-0088"]}],"id":[{"id":"10.13039\/100006602","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2024,11]]},"DOI":"10.1007\/s10107-023-02035-2","type":"journal-article","created":{"date-parts":[[2023,12,11]],"date-time":"2023-12-11T17:04:22Z","timestamp":1702314262000},"page":"173-208","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A single cut proximal bundle method for stochastic convex composite optimization"],"prefix":"10.1007","volume":"208","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7439-3845","authenticated-orcid":false,"given":"Jiaming","family":"Liang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vincent","family":"Guigues","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Renato D. C.","family":"Monteiro","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,12,11]]},"reference":[{"key":"2035_CR1","unstructured":"Andersen, E.D., Andersen, K.D.: The MOSEK optimization toolbox for MATLAB manual. Version 9.2, (2019). https:\/\/www.mosek.com\/documentation\/"},{"issue":"3","key":"2035_CR2","doi-asserted-by":"publisher","first-page":"1784","DOI":"10.1137\/120888867","volume":"23","author":"A Astorino","year":"2013","unstructured":"Astorino, A., Frangioni, A., Fuduli, A., Gorgone, E.: A nonmonotone proximal bundle method with (potentially) continuous step decisions. SIAM J. Optim. 23(3), 1784\u20131809 (2013)","journal-title":"SIAM J. Optim."},{"key":"2035_CR3","volume-title":"Introduction to Stochastic Programming","author":"J Birge","year":"1997","unstructured":"Birge, J., Louveaux, F.: Introduction to Stochastic Programming. Springer-Verlag, New York (1997)"},{"key":"2035_CR4","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1016\/0377-2217(88)90159-2","volume":"34","author":"JR Birge","year":"1988","unstructured":"Birge, J.R., Louveaux, F.V.: A multicut algorithm for two-stage stochastic linear programs. Eur. J. Oper. Res. 34, 384\u2013392 (1988)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"2035_CR5","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1137\/21M1428601","volume":"33","author":"M D\u00edaz","year":"2023","unstructured":"D\u00edaz, M., Grimmer, B.: Optimal convergence rates for the proximal bundle method. SIAM J. Optim. 33(2), 424\u2013454 (2023)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"2035_CR6","doi-asserted-by":"publisher","first-page":"908","DOI":"10.1007\/s10957-017-1108-1","volume":"173","author":"Y Du","year":"2017","unstructured":"Du, Y., Ruszczy\u0144ski, A.: Rate of convergence of the bundle method. J. Optim. Theory Appl. 173(3), 908\u2013922 (2017)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"2035_CR7","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1137\/S1052623498342186","volume":"13","author":"A Frangioni","year":"2002","unstructured":"Frangioni, A.: Generalized bundle methods. SIAM J. Optim. 13(1), 117\u2013156 (2002)","journal-title":"SIAM J. Optim."},{"key":"2035_CR8","doi-asserted-by":"publisher","first-page":"2468","DOI":"10.1137\/140983136","volume":"26","author":"V Guigues","year":"2016","unstructured":"Guigues, V.: Convergence analysis of sampling-based decomposition methods for risk-averse multistage stochastic convex programs. SIAM J. Optim. 26, 2468\u20132494 (2016)","journal-title":"SIAM J. Optim."},{"key":"2035_CR9","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s10107-016-1060-0","volume":"163","author":"V Guigues","year":"2017","unstructured":"Guigues, V.: Multistep stochastic mirror descent for risk-averse convex stochastic programs based on extended polyhedral risk measures. Math. Program. 163, 169\u2013212 (2017)","journal-title":"Math. Program."},{"key":"2035_CR10","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/s10107-020-01490-5","volume":"187","author":"V Guigues","year":"2021","unstructured":"Guigues, V.: Inexact stochastic mirror descent for two-stage nonlinear stochastic programs. Math. Program. 187, 533\u2013577 (2021)","journal-title":"Math. Program."},{"key":"2035_CR11","doi-asserted-by":"publisher","first-page":"1033","DOI":"10.1080\/10556788.2017.1350177","volume":"32","author":"V Guigues","year":"2017","unstructured":"Guigues, V., Juditsky, A., Nemirovski, A.: Non-asymptotic confidence bounds for the optimal value of a stochastic program. Optim. Methods Softw. 32, 1033\u20131058 (2017)","journal-title":"Optim. Methods Softw."},{"key":"2035_CR12","doi-asserted-by":"publisher","first-page":"1133","DOI":"10.1007\/s11081-020-09511-0","volume":"21","author":"V Guigues","year":"2020","unstructured":"Guigues, V., Tekaya, W., Lejeune, M.: Regularized decomposition methods for deterministic and stochastic convex optimization and application to portfolio selection with direct transaction and market impact costs. Optim. Eng. 21, 1133\u20131165 (2020)","journal-title":"Optim. Eng."},{"key":"2035_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4115-8","volume-title":"Stochastic Decomposition","author":"JL Higle","year":"1996","unstructured":"Higle, J.L., Sen, S.: Stochastic Decomposition. Kluwer, Dordrecht (1996)"},{"key":"2035_CR14","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1287\/moor.18.1.148","volume":"18","author":"AJ King","year":"1993","unstructured":"King, A.J., Rockafellar, R.T.: Asymptotic theory for solutions in statistical estimation and stochastic programming. Math. Oper. Res. 18, 148\u2013162 (1993)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"2035_CR15","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1023\/A:1004689609425","volume":"104","author":"KC Kiwiel","year":"2000","unstructured":"Kiwiel, K.C.: Efficiency of proximal bundle methods. J. Optim. Theory Appl. 104(3), 589\u2013603 (2000)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"2035_CR16","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1137\/S1052623499363220","volume":"12","author":"AJ Kleywegt","year":"2002","unstructured":"Kleywegt, A.J., Shapiro, A., Homem-de Mello, T.: The sample average approximation method for stochastic discrete optimization. SIAM J. Optim. 12(2), 479\u2013502 (2002)","journal-title":"SIAM J. Optim."},{"key":"2035_CR17","doi-asserted-by":"crossref","unstructured":"Lemar\u00e9chal, C.: An extension of davidon methods to non differentiable problems. In Nondifferentiable Optimization, pages 95\u2013109. Springer (1975)","DOI":"10.1007\/BFb0120700"},{"key":"2035_CR18","unstructured":"Lemar\u00e9chal, C.: Nonsmooth optimization and descent methods. (1978)"},{"issue":"4","key":"2035_CR19","doi-asserted-by":"publisher","first-page":"2955","DOI":"10.1137\/20M1327513","volume":"31","author":"J Liang","year":"2021","unstructured":"Liang, J., Monteiro, R.D.C.: A proximal bundle variant with optimal iteration-complexity for a large range of prox stepsizes. SIAM J. Optim. 31(4), 2955\u20132986 (2021)","journal-title":"SIAM J. Optim."},{"key":"2035_CR20","doi-asserted-by":"crossref","unstructured":"Liang, J. and Monteiro, R.D.C.: A unified analysis of a class of proximal bundle methods for solving hybrid convex composite optimization problems. Math. Oper. Res., (2023)","DOI":"10.1287\/moor.2023.1372"},{"key":"2035_CR21","doi-asserted-by":"crossref","unstructured":"Mifflin, R.: A modification and an extension of Lemar\u00e9chal\u2019s algorithm for nonsmooth minimization. In Nondifferential and Variational Techniques in Optimization, pages 77\u201390. Springer, (1982)","DOI":"10.1007\/BFb0120960"},{"key":"2035_CR22","doi-asserted-by":"publisher","first-page":"1574","DOI":"10.1137\/070704277","volume":"19","author":"A Nemirovski","year":"2009","unstructured":"Nemirovski, A., Juditsky, A., Lan, G., Shapiro, A.: Robust stochastic approximation approach to stochastic programming. SIAM J. Optim. 19, 1574\u20131609 (2009)","journal-title":"SIAM J. Optim."},{"key":"2035_CR23","unstructured":"Nemirovski, A. and Yudin, D.: On Cezari\u2019s convergence of the steepest descent method for approximating saddle point of convex-concave functions. Soviet Math. Dokl., 19, (1978)"},{"key":"2035_CR24","unstructured":"Nemirovski, A., Yudin, D.B.: Problem Complexity and Method Efficiency in Optimization. Wiley (1983)"},{"issue":"1","key":"2035_CR25","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10107-007-0149-x","volume":"120","author":"Y Nesterov","year":"2009","unstructured":"Nesterov, Y.: Primal-dual subgradient methods for convex problems. Math. Program. 120(1), 221\u2013259 (2009)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"2035_CR26","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s10107-014-0809-6","volume":"148","author":"W de Oliveira","year":"2014","unstructured":"de Oliveira, W., Sagastiz\u00e1bal, C., Lemar\u00e9chal, C.: Convex proximal bundle methods in depth: a unified analysis for inexact oracles. Math. Program. 148(1\u20132), 241\u2013277 (2014)","journal-title":"Math. Program."},{"key":"2035_CR27","first-page":"98","volume":"7","author":"BT Polyak","year":"1990","unstructured":"Polyak, B.T.: New stochastic approximation type procedures. Automat. i Telemekh 7, 98\u2013107 (1990)","journal-title":"Automat. i Telemekh"},{"key":"2035_CR28","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1137\/0330046","volume":"30","author":"BT Polyak","year":"1992","unstructured":"Polyak, B.T., Juditsky, A.: Acceleration of stochastic approximation by averaging. SIAM J. Contr. Optim. 30, 838\u2013855 (1992)","journal-title":"SIAM J. Contr. Optim."},{"key":"2035_CR29","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1214\/aoms\/1177729586","volume":"22","author":"H Robbins","year":"1951","unstructured":"Robbins, H., Monroe, S.: A stochastic approximation method. Annals Math. Stat. 22, 400\u2013407 (1951)","journal-title":"Annals Math. Stat."},{"key":"2035_CR30","doi-asserted-by":"publisher","DOI":"10.2307\/j.ctvcm4hcj","volume-title":"Nonlinear Optimization","author":"A Ruszczy\u0144ski","year":"2011","unstructured":"Ruszczy\u0144ski, A.: Nonlinear Optimization. Princeton University Press, NY (2011)"},{"key":"2035_CR31","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02204815","volume":"30","author":"A Shapiro","year":"1991","unstructured":"Shapiro, A.: Asymptotic analysis of stochastic programs. Ann. Oper. Res. 30, 169\u2013186 (1991)","journal-title":"Ann. Oper. Res."},{"key":"2035_CR32","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718751","volume-title":"Lectures on Stochastic Programming: Modeling and Theory","author":"A Shapiro","year":"2009","unstructured":"Shapiro, A., Dentcheva, D., Ruszczy\u0144ski, A.: Lectures on Stochastic Programming: Modeling and Theory. SIAM, Philadelphia (2009)"},{"key":"2035_CR33","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1137\/0117061","volume":"17","author":"RM Van Slyke","year":"1969","unstructured":"Van Slyke, R.M., Wets, R.J.-B.: L-shaped linear programs with applications to optimal control and stochastic programming. J. SIAM Appl. Math. 17, 638\u2013663 (1969)","journal-title":"J. SIAM Appl. Math."},{"key":"2035_CR34","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.cor.2016.08.002","volume":"77","author":"W van Ackooij","year":"2017","unstructured":"van Ackooij, W., Berge, V., de Oliveira, W., Sagastiz\u00e1bal, C.: Probabilistic optimization via approximate p-efficient points and bundle methods. Comput. Oper. Res. 77, 177\u2013193 (2017)","journal-title":"Comput. Oper. Res."},{"issue":"2\u20133","key":"2035_CR35","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1023\/A:1021814225969","volume":"24","author":"B Verweij","year":"2003","unstructured":"Verweij, B., Ahmed, S., Kleywegt, A.J., Nemhauser, G., Shapiro, A.: The sample average approximation method applied to stochastic routing problems: a computational study. Comput. Optim. Appl. 24(2\u20133), 289\u2013333 (2003)","journal-title":"Comput. Optim. Appl."},{"key":"2035_CR36","unstructured":"Wang, W. and Carreira-Perpin\u00e1n, M.A.: Projection onto the probability simplex: an efficient algorithm with a simple proof, and an application. Available on arXiv:1309.1541, 2013"},{"key":"2035_CR37","doi-asserted-by":"crossref","unstructured":"Wolfe, P.: A method of conjugate subgradients for minimizing nondifferentiable functions. In Nondifferentiable Optimization, pages 145\u2013173. Springer, 1975","DOI":"10.1007\/BFb0120703"},{"issue":"88","key":"2035_CR38","first-page":"2543","volume":"11","author":"L Xiao","year":"2010","unstructured":"Xiao, L.: Dual averaging methods for regularized stochastic learning and online optimization. J. Mach. Learn. Res. 11(88), 2543\u20132596 (2010)","journal-title":"J. Mach. Learn. Res."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-023-02035-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-023-02035-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-023-02035-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,15]],"date-time":"2024-10-15T16:06:18Z","timestamp":1729008378000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-023-02035-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,11]]},"references-count":38,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2024,11]]}},"alternative-id":["2035"],"URL":"https:\/\/doi.org\/10.1007\/s10107-023-02035-2","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,11]]},"assertion":[{"value":"3 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 November 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 December 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}