{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:24:58Z","timestamp":1759667098921},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2019,7,12]],"date-time":"2019-07-12T00:00:00Z","timestamp":1562889600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,7,12]],"date-time":"2019-07-12T00:00:00Z","timestamp":1562889600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1007\/s10107-019-01414-y","type":"journal-article","created":{"date-parts":[[2019,7,12]],"date-time":"2019-07-12T11:03:20Z","timestamp":1562929400000},"page":"319-348","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Asynchronous level bundle methods"],"prefix":"10.1007","volume":"184","author":[{"given":"Franck","family":"Iutzeler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e9r\u00f4me","family":"Malick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Welington","family":"de Oliveira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,12]]},"reference":[{"key":"1414_CR1","unstructured":"Arda, A., Feyzmahdavian, H.R., Johansson, M.: Analysis and implementation of an asynchronous optimization algorithm for the parameter server (2016). arXiv preprint \narXiv:1610.05507"},{"key":"1414_CR2","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1023\/A:1011202900805","volume":"20","author":"L Bacaud","year":"2001","unstructured":"Bacaud, L., Lemar\u00e9chal, C., Renaud, A., Sagastiz\u00e1bal, C.: Bundle methods in stochastic optimal power management: a disaggregated approach using preconditioners. Comput. Optim. Appl. 20, 227\u2013244 (2001)","journal-title":"Comput. Optim. Appl."},{"key":"1414_CR3","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1016\/j.jmaa.2011.12.002","volume":"389","author":"NC Bernardes","year":"2012","unstructured":"Bernardes, N.C.: On nested sequences of convex sets in Banach spaces. J. Math. Anal. Appl. 389, 558\u2013561 (2012)","journal-title":"J. Math. Anal. Appl."},{"key":"1414_CR4","volume-title":"Parallel and Distributed Computation: Numerical Methods","author":"DP Bertsekas","year":"1989","unstructured":"Bertsekas, D.P., Tsitsiklis, J.N.: Parallel and Distributed Computation: Numerical Methods, vol. 23. Prentice Hall, Englewood Cliffs (1989)"},{"key":"1414_CR5","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/s10107-006-0079-z","volume":"113","author":"O Briant","year":"2008","unstructured":"Briant, O., Claude Lemar\u00e9chal, P., Meurdesoif, S.M., Perrot, N., Vanderbeck, F.: Comparison of bundle and classical column generation. Math. Programm. 113, 299\u2013344 (2008)","journal-title":"Math. Programm."},{"key":"1414_CR6","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s12667-015-0172-6","volume":"8","author":"SVB Bruno","year":"2017","unstructured":"Bruno, S.V.B., Moraes, L.A.M., de Oliveira, W.: Optimization techniques for the Brazilian natural gas network planning problem. Energy Syst. 8, 81\u2013101 (2017)","journal-title":"Energy Syst."},{"key":"1414_CR7","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1016\/j.orl.2017.10.010","volume":"45","author":"W de Oliveira","year":"2017","unstructured":"de Oliveira, W.: Target radius methods for nonsmooth convex optimization. Oper. Res. Lett. 45, 659\u2013664 (2017)","journal-title":"Oper. Res. Lett."},{"key":"1414_CR8","doi-asserted-by":"crossref","first-page":"1180","DOI":"10.1080\/10556788.2013.871282","volume":"29","author":"W de Oliveira","year":"2014","unstructured":"de Oliveira, W., Sagastiz\u00e1bal, C.: Level bundle methods for oracles with on-demand accuracy. Optim. Methods Softw. 29, 1180\u20131209 (2014)","journal-title":"Optim. Methods Softw."},{"key":"1414_CR9","unstructured":"de Oliveira, W., Solodov, M.: Bundle methods for inexact data. Technical report (2018)"},{"key":"1414_CR10","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/s10107-005-0593-4","volume":"104","author":"L Dubost","year":"2005","unstructured":"Dubost, L., Gonzalez, R., Lemar\u00e9chal, C.: A primal-proximal heuristic applied to the french unit-commitment problem. Math. Program. 104, 129\u2013151 (2005)","journal-title":"Math. Program."},{"key":"1414_CR11","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1137\/120865987","volume":"24","author":"F Fischer","year":"2014","unstructured":"Fischer, F., Helmberg, C.: A parallel bundle framework for asynchronous subspace optimization of nonsmooth convex functions. SIAM J. Optim. 24, 795\u2013822 (2014)","journal-title":"SIAM J. Optim."},{"key":"1414_CR12","unstructured":"Frangioni, A.: Standard bundle methods: untrusted models and duality. Technical report, Universita di Pisa (2018)"},{"key":"1414_CR13","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/s10107-013-0642-3","volume":"145","author":"A Frangioni","year":"2014","unstructured":"Frangioni, A., Gorgone, E.: Bundle methods for sum-functions with \u201ceasy\u201d components: applications to multicommodity network design. Math. Program. 145, 133\u2013161 (2014)","journal-title":"Math. Program."},{"key":"1414_CR14","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/BF00934810","volume":"10","author":"AM Geoffrion","year":"1972","unstructured":"Geoffrion, A.M.: Generalized benders decomposition. J. Optim. Theory Appl. 10, 237\u2013260 (1972)","journal-title":"J. Optim. Theory Appl."},{"key":"1414_CR15","unstructured":"Hannah, R., Yin, W.: More iterations per second, same quality\u2013why asynchronous algorithms may drastically outperform traditional ones (2017). arXiv preprint \narXiv:1708.05136"},{"key":"1414_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-06409-2","volume-title":"Convex Analysis Minimization Algorithms","author":"J-B Hiriart-Urruty","year":"1993","unstructured":"Hiriart-Urruty, J.-B., Lemar\u00e9chal, C.: Convex Analysis Minimization Algorithms, vol. 305 and 306. Springer, Berlin (1993)"},{"key":"1414_CR17","unstructured":"Johnson, R., Zhang, T.: Accelerating stochastic gradient descent using predictive variance reduction. In: Advances in Neural Information Processing Systems, pp. 315\u2013323 (2013)"},{"key":"1414_CR18","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1137\/17M1148189","volume":"29","author":"K Kim","year":"2019","unstructured":"Kim, K., Petra, C., Zavala, V.: An asynchronous bundle-trust-region method for dual decomposition of stochastic mixed-integer programming. SIAM J. Optim. 29, 318\u2013342 (2019)","journal-title":"SIAM J. Optim."},{"key":"1414_CR19","first-page":"89","volume":"69","author":"KC Kiwiel","year":"1995","unstructured":"Kiwiel, K.C.: Proximal level bubdle methods for convex nondiferentiable optimization, saddle-point problems and variational inequalities. Math. Program. 69, 89\u2013109 (1995)","journal-title":"Math. Program."},{"key":"1414_CR20","unstructured":"Konecn\u1ef3, J., McMahan, H.B., Ramage, D., Richt\u00e1rik, P.: Federated optimization: distributed machine learning for on-device intelligence (2016). arXiv preprint \narXiv:1610.02527"},{"key":"1414_CR21","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BFb0120700","volume":"3","author":"C Lemar\u00e9chal","year":"1975","unstructured":"Lemar\u00e9chal, C.: An extension of davidon methods to nondifferentiable problems. Math. Program. Study 3, 95\u2013109 (1975)","journal-title":"Math. Program. Study"},{"key":"1414_CR22","doi-asserted-by":"publisher","unstructured":"Lemar\u00e9chal, C.: Lagrangian relaxation. In: J\u00fcnger, M., Naddef, D. (eds.) Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions, pp. 112\u2013156. Springer, Berlin, Heidelberg (2001). \nhttps:\/\/doi.org\/10.1007\/3-540-45586-8_4","DOI":"10.1007\/3-540-45586-8_4"},{"key":"1414_CR23","doi-asserted-by":"crossref","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, 111\u2013147 (1995)","journal-title":"Math. Program."},{"key":"1414_CR24","unstructured":"Ma, C., Smith, V., Jaggi, M., Jordan, M., Richtarik, P., Takac, M.: Adding vs. averaging in distributed primal-dual optimization. In: International Conference on Machine Learning, pp. 1973\u20131982 (2015)"},{"key":"1414_CR25","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s13675-015-0060-9","volume":"5","author":"J Malick","year":"2017","unstructured":"Malick, J., de Oliveira, W., Zaourar, S.: Uncontrolled inexact information within bundle methods. EURO J. Comput. Optim. 5, 5\u201329 (2017)","journal-title":"EURO J. Comput. Optim."},{"key":"1414_CR26","unstructured":"Mishchenko, K., Iutzeler, F., Malick, J., Amini, M.-R.: A delay-tolerant proximal-gradient algorithm for distributed learning. In: Proceedings of the 35th International Conference on Machine Learning, vol.\u00a080 of Proceedings of Machine Learning Research, PMLR, 10\u201315, pp. 3584\u20133592 (Jul 2018)"},{"key":"1414_CR27","doi-asserted-by":"publisher","unstructured":"Moritsch, H.W., Pflug, GCh., Siomak, M.: Asynchronous nested optimization algorithms and their parallel implementation. Wuhan Univ. J. Nat. Sci. 6(1\u20132), 560\u2013567 (2001). \nhttps:\/\/doi.org\/10.1007\/BF03160302","DOI":"10.1007\/BF03160302"},{"key":"1414_CR28","doi-asserted-by":"crossref","first-page":"A2851","DOI":"10.1137\/15M1024950","volume":"38","author":"Z Peng","year":"2016","unstructured":"Peng, Z., Yangyang, X., Yan, M., Yin, W.: Arock: an algorithmic framework for asynchronous parallel coordinate updates. SIAM J. Sci. Comput. 38, A2851\u2013A2879 (2016)","journal-title":"SIAM J. Sci. Comput."},{"key":"1414_CR29","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-02431-3","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"1998","unstructured":"Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis. Springer, Heidelberg (1998)"},{"key":"1414_CR30","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1287\/moor.16.1.119","volume":"16","author":"RT Rockafellar","year":"1991","unstructured":"Rockafellar, R.T., Wets, R.J.-B.: Scenarios and policy aggregation in optimization under uncertainty. Math. Oper. Res. 16, 119\u2013147 (1991)","journal-title":"Math. Oper. Res."},{"key":"1414_CR31","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/s10107-012-0570-7","volume":"134","author":"C Sagastiz\u00e1bal","year":"2012","unstructured":"Sagastiz\u00e1bal, C.: Divide to conquer: decomposition methods for energy optimization. Math. Program. 134, 187\u2013222 (2012)","journal-title":"Math. Program."},{"key":"1414_CR32","first-page":"3785","volume":"3","author":"C Sagastiz\u00e1bal","year":"2018","unstructured":"Sagastiz\u00e1bal, C.: A VU-point of view of nonsmooth optimization. Proc. Int. Congr. Math. 3, 3785\u20133806 (2018)","journal-title":"Proc. Int. Congr. Math."},{"key":"1414_CR33","doi-asserted-by":"crossref","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, Bangkok (2009)"},{"issue":"47","key":"1414_CR34","first-page":"317","volume":"5","author":"V Smulian","year":"1939","unstructured":"Smulian, V.: On the principle of inclusion in the space of the type $$(b)$$. Rec. Math. [Mat. Sbornik] N.S. 5(47), 317\u2013328 (1939)","journal-title":"Rec. Math. [Mat. Sbornik] N.S."},{"key":"1414_CR35","unstructured":"Sun, T., Hannah, R., Yin, W.:Asynchronous coordinate descent under more realistic assumption. In: Proceedings of the 31st International Conference on Neural Information Processing Systems, NIPS\u201917, pp. 6183\u20136191, Curran Associates Inc., Long Beach, California, USA (2017). \nhttp:\/\/dl.acm.org\/citation.cfm?id=3295222.3295366"},{"key":"1414_CR36","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1109\/TAC.1986.1104412","volume":"31","author":"J Tsitsiklis","year":"1986","unstructured":"Tsitsiklis, J., Bertsekas, D., Athans, M.: Distributed asynchronous deterministic and stochastic gradient optimization algorithms. IEEE Trans. Autom. Control 31, 803\u2013812 (1986)","journal-title":"IEEE Trans. Autom. Control"},{"key":"1414_CR37","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/s10589-013-9610-3","volume":"57","author":"W van Ackooij","year":"2014","unstructured":"van Ackooij, W., de Oliveira, W.: Level bundle methods for constrained convex optimization with various oracles. Comput. Optim. Appl. 57, 555\u2013597 (2014)","journal-title":"Comput. Optim. Appl."},{"key":"1414_CR38","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1007\/s10479-015-2029-8","volume":"238","author":"W van Ackooij","year":"2015","unstructured":"van Ackooij, W., Malick, J.: Decomposition algorithm for large-scale two-stage unit-commitment. Ann. Oper. Res. 238, 587\u2013613 (2015)","journal-title":"Ann. Oper. Res."},{"key":"1414_CR39","doi-asserted-by":"publisher","unstructured":"van Ackooij, W., Frangioni, A.: Incremental bundle methods using upper models. SIAM. J. Optimi. 28(1), 379\u2013410 (2018). \nhttps:\/\/doi.org\/10.1137\/16M1089897","DOI":"10.1137\/16M1089897"},{"key":"1414_CR40","doi-asserted-by":"crossref","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, 437\u2013448 (2014)","journal-title":"Eur. J. Oper. Res."},{"key":"1414_CR41","unstructured":"Zhang, R., Kwok, J.: Asynchronous distributed ADMM for consensus optimization. In: International Conference on Machine Learning, pp. 1701\u20131709 (2014)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-019-01414-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-019-01414-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-019-01414-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,15]],"date-time":"2020-10-15T11:01:28Z","timestamp":1602759688000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-019-01414-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,12]]},"references-count":41,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["1414"],"URL":"https:\/\/doi.org\/10.1007\/s10107-019-01414-y","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,7,12]]},"assertion":[{"value":"18 September 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 July 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 July 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}