{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:12:45Z","timestamp":1761293565082},"reference-count":64,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,5,6]],"date-time":"2017-05-06T00:00:00Z","timestamp":1494028800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s12532-017-0120-7","type":"journal-article","created":{"date-parts":[[2017,5,6]],"date-time":"2017-05-06T14:27:10Z","timestamp":1494080830000},"page":"573-604","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["On the computational efficiency of subgradient methods: a case study with Lagrangian bounds"],"prefix":"10.1007","volume":"9","author":[{"given":"Antonio","family":"Frangioni","sequence":"first","affiliation":[]},{"given":"Bernard","family":"Gendron","sequence":"additional","affiliation":[]},{"given":"Enrico","family":"Gorgone","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,6]]},"reference":[{"key":"120_CR1","unstructured":"Ahookhosh, M.: Optimal subgradient algorithms with application to large-scale linear inverse problems. Tech. rep., Optimization Online (2014)"},{"issue":"1","key":"120_CR2","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/s10107-007-0148-y","volume":"120","author":"K Anstreicher","year":"2009","unstructured":"Anstreicher, K., Wolsey, L.: Two \u201cwell-known\u201d properties of subgradient optimization. Math. Program. 120(1), 213\u2013220 (2009)","journal-title":"Math. Program."},{"issue":"3","key":"120_CR3","doi-asserted-by":"crossref","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":"120_CR4","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."},{"issue":"1","key":"120_CR5","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/s10107-002-0357-3","volume":"94","author":"L Bahiense","year":"2002","unstructured":"Bahiense, L., Maculan, N., Sagastiz\u00e1bal, C.: The volume algorithm revisited: relation with bundle methods. Math. Program. 94(1), 41\u201370 (2002)","journal-title":"Math. Program."},{"issue":"3","key":"120_CR6","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/s101070050002","volume":"87","author":"F Barahona","year":"2000","unstructured":"Barahona, F., Anbil, R.: The volume algorithm: producing primal solutions with a subgradient method. Math. Program. 87(3), 385\u2013399 (2000)","journal-title":"Math. Program."},{"issue":"2","key":"120_CR7","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1137\/100818327","volume":"22","author":"A Beck","year":"2012","unstructured":"Beck, A., Teboulle, M.: Smoothing and first order methods: a unified framework. SIAM J. Optim. 22(2), 557\u2013580 (2012)","journal-title":"SIAM J. Optim."},{"issue":"6","key":"120_CR8","doi-asserted-by":"crossref","first-page":"1167","DOI":"10.1016\/j.dam.2008.06.021","volume":"157","author":"H Ben Amor","year":"2009","unstructured":"Ben Amor, H., Desrosiers, J., Frangioni, A.: On the choice of explicit stabilizing terms in column generation. Discrete Appl. Math. 157(6), 1167\u20131184 (2009)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"120_CR9","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1137\/S1052623499362111","volume":"12","author":"D Bertsekas","year":"2001","unstructured":"Bertsekas, D., Nedi\u0107, A.: Incremental subgradient methods for nondifferentiable optimization. SIAM J. Optim. 12(1), 109\u2013138 (2001)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"120_CR10","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1109\/TPWRS.2002.807114","volume":"18","author":"A Borghetti","year":"2003","unstructured":"Borghetti, A., Frangioni, A., Lacalandra, F., Nucci, C.: Lagrangian heuristics based on disaggregated bundle methods for hydrothermal unit commitment. IEEE Trans. Power Syst. 18(1), 313\u2013323 (2003)","journal-title":"IEEE Trans. Power Syst."},{"key":"120_CR11","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1007\/s11750-014-0326-z","volume":"23","author":"R Bot","year":"2014","unstructured":"Bot, R., Hendrich, C.: A variable smoothing algorithm for solving convex optimization problems. TOP 23, 124\u2013150 (2014)","journal-title":"TOP"},{"key":"120_CR12","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BF01585999","volume":"71","author":"U Br\u00e4nnlund","year":"1995","unstructured":"Br\u00e4nnlund, U.: A generalised subgradient method with relaxation step. Math. Program. 71, 207\u2013219 (1995)","journal-title":"Math. Program."},{"issue":"2","key":"120_CR13","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/s10107-006-0079-z","volume":"113","author":"O Briant","year":"2008","unstructured":"Briant, O., Lemar\u00e9chal, C., Meurdesoif, P., Michel, S., Perrot, N., Vanderbeck, F.: Comparison of bundle and classical column generation. Math. Program. 113(2), 299\u2013344 (2008)","journal-title":"Math. Program."},{"key":"120_CR14","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/BFb0120697","volume":"3","author":"P Camerini","year":"1975","unstructured":"Camerini, P., Fratta, L., Maffioli, F.: On improving relaxation methods by modified gradient techniques. Math. Program. Study 3, 26\u201334 (1975)","journal-title":"Math. Program. Study"},{"issue":"4","key":"120_CR15","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1287\/ijoc.15.4.369.24887","volume":"15","author":"P Cappanera","year":"2003","unstructured":"Cappanera, P., Frangioni, A.: Symmetric and asymmetric parallelization of a cost-decomposition algorithm for multi-commodity flow problems. INFORMS J. Comput. 15(4), 369\u2013384 (2003)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"120_CR16","doi-asserted-by":"crossref","first-page":"730","DOI":"10.1007\/s10957-013-0408-3","volume":"160","author":"Y Censor","year":"2014","unstructured":"Censor, Y., Davidi, R., Herman, G., Schulte, R., Tetruashvili, L.: Projected subgradient minimization cersus superiorization. J. Optim. Theory Appl. 160(3), 730\u2013747 (2014)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"120_CR17","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1007\/s10851-010-0251-1","volume":"40","author":"A Chambolle","year":"2011","unstructured":"Chambolle, A., Pock, T.: A first-order primal-dual algorithm for convex problems with applications to imaging. J. Math. Imaging Vis. 40(1), 120\u2013145 (2011)","journal-title":"J. Math. Imaging Vis."},{"key":"120_CR18","doi-asserted-by":"crossref","unstructured":"Crainic, T.G., Frangioni, A., Gendron, B.: Multicommodity capacitated network design. In: Soriano, P., Sanso, B. (eds.) Telecommunications network planning, pp. 1\u201319. Kluwer Academics Publisher (1999)","DOI":"10.1007\/978-1-4615-5087-7_1"},{"key":"120_CR19","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0166-218X(00)00310-3","volume":"112","author":"T Crainic","year":"2001","unstructured":"Crainic, T., Frangioni, A., Gendron, B.: Bundle-based relaxation methods for multicommodity capacitated fixed charge network design problems. Discrete Appl. Math. 112, 73\u201399 (2001)","journal-title":"Discrete Appl. Math."},{"key":"120_CR20","doi-asserted-by":"crossref","first-page":"31743186","DOI":"10.1016\/j.cor.2005.11.024","volume":"34","author":"A Crema","year":"2007","unstructured":"Crema, A., Loreto, M., Raydan, M.: Spectral projected subgradient with a momentum term for the Lagrangean dual approach. Comput. Oper. Res. 34, 31743186 (2007)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"120_CR21","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1137\/080718814","volume":"20","author":"G d\u2019Antonio","year":"2009","unstructured":"d\u2019Antonio, G., Frangioni, A.: Convergence analysis of deflected conditional approximate subgradient methods. SIAM J. Optim. 20(1), 357\u2013386 (2009)","journal-title":"SIAM J. Optim."},{"key":"120_CR22","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1023\/A:1018318117350","volume":"11","author":"O Merle du","year":"1998","unstructured":"du Merle, O., Goffin, J.L., Vial, J.P.: On improvements to the analytic center cutting plane method. Comput. Optim. Appl. 11, 37\u201352 (1998)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"120_CR23","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1137\/S1052623498332336","volume":"10","author":"S Feltenmark","year":"2000","unstructured":"Feltenmark, S., Kiwiel, K.: Dual applications of proximal bundle methods, including Lagrangian relaxation of nonconvex problems. SIAM J. Optim. 10(3), 697\u2013721 (2000)","journal-title":"SIAM J. Optim."},{"key":"120_CR24","doi-asserted-by":"crossref","first-page":"1099","DOI":"10.1016\/0305-0548(96)00006-8","volume":"21","author":"A Frangioni","year":"1996","unstructured":"Frangioni, A.: Solving semidefinite quadratic problems within nonsmooth optimization algorithms. Comput. Oper. Res. 21, 1099\u20131118 (1996)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"120_CR25","doi-asserted-by":"crossref","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."},{"issue":"4","key":"120_CR26","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1287\/ijoc.11.4.370","volume":"11","author":"A Frangioni","year":"1999","unstructured":"Frangioni, A., Gallo, G.: A bundle type dual-ascent approach to linear multicommodity min cost flow problems. INFORMS J. Comput. 11(4), 370\u2013393 (1999)","journal-title":"INFORMS J. Comput."},{"key":"120_CR27","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/s10107-012-0626-8","volume":"140","author":"A Frangioni","year":"2013","unstructured":"Frangioni, A., Gendron, B.: A stabilized structured Dantzig\u2013Wolfe decomposition method. Math. Program. 140, 45\u201376 (2013)","journal-title":"Math. Program."},{"issue":"1","key":"120_CR28","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/j.ejor.2013.02.038","volume":"229","author":"A Frangioni","year":"2013","unstructured":"Frangioni, A., Gorgone, E.: A library for continuous convex separable quadratic knapsack problems. Eur. J. Oper. Res. 229(1), 37\u201340 (2013)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"120_CR29","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.: Generalized bundle methods for sum-functions with \u201ceasy\u201d components: applications to multicommodity network design. Math. Program. 145(1), 133\u2013161 (2014)","journal-title":"Math. Program."},{"issue":"2\u20133","key":"120_CR30","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/s10107-005-0620-5","volume":"104","author":"A Frangioni","year":"2005","unstructured":"Frangioni, A., Lodi, A., Rinaldi, G.: New approaches for optimizing over the semimetric polytope. Math. Program. 104(2\u20133), 375\u2013388 (2005)","journal-title":"Math. Program."},{"issue":"1","key":"120_CR31","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/S0305-0548(99)00085-4","volume":"28","author":"F Fumero","year":"2001","unstructured":"Fumero, F.: A modified subgradient algorithm for Lagrangean relaxation. Comput. Oper. Res. 28(1), 33\u201352 (2001)","journal-title":"Comput. Oper. Res."},{"key":"120_CR32","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BFb0120690","volume":"2","author":"A Geoffrion","year":"1974","unstructured":"Geoffrion, A.: Lagrangian relaxation and its uses in iteger programming. Math. Program. Study 2, 82\u2013114 (1974)","journal-title":"Math. Program. Study"},{"issue":"1","key":"120_CR33","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.ejor.2012.07.024","volume":"224","author":"J Gondzio","year":"2013","unstructured":"Gondzio, J., Gonz\u00e1lez-Brevis, P., Munari, P.: New developments in the primal\u2013dual column generation technique. Eur. J. Oper. Res. 224(1), 41\u201351 (2013)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"120_CR34","doi-asserted-by":"crossref","first-page":"597610","DOI":"10.1287\/ijoc.1110.0468","volume":"24","author":"S G\u00f6rtz","year":"2012","unstructured":"G\u00f6rtz, S., Klose, A.: A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem. INFORMS J. Comput. 24(4), 597610 (2012)","journal-title":"INFORMS J. Comput."},{"key":"120_CR35","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/S0377-2217(97)00034-9","volume":"105","author":"M Guignard","year":"1998","unstructured":"Guignard, M.: Efficient cuts in Lagrangean \u2018relax-and-cut\u2019 schemes. Eur. J. Oper. Res. 105, 216\u2013223 (1998)","journal-title":"Eur. J. Oper. Res."},{"key":"120_CR36","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","volume":"18","author":"M Held","year":"1970","unstructured":"Held, M., Karp, R.: The traveling salesman problem and minimum spanning trees. Oper. Res. 18, 1138\u20131162 (1970)","journal-title":"Oper. Res."},{"key":"120_CR37","volume-title":"Convex Analysis and Minimization Algorithms II\u2013Advanced Theory and Bundle Methods, Grundlehren Math. Wiss.","author":"JB Hiriart-Urruty","year":"1993","unstructured":"Hiriart-Urruty, J.B., Lemar\u00e9chal, C.: Convex Analysis and Minimization Algorithms II\u2013Advanced Theory and Bundle Methods, Grundlehren Math. Wiss., vol. 306. Springer, New York (1993)"},{"key":"120_CR38","unstructured":"Ito, M., Fukuda, M.: A family of subgradient-based methods for convex optimization problems in a unifying framework. Tech. rep., Optimization Online (2014)"},{"key":"120_CR39","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF01585162","volume":"62","author":"K Jones","year":"1993","unstructured":"Jones, K., Lustig, I., Farwolden, J., Powell, W.: Multicommodity network flows: the impact of formulation on decomposition. Math. Program. 62, 95\u2013117 (1993)","journal-title":"Math. Program."},{"key":"120_CR40","first-page":"703","volume":"8","author":"J Kelley","year":"1960","unstructured":"Kelley, J.: The cutting-plane method for solving convex programs. J. SIAM 8, 703\u2013712 (1960)","journal-title":"J. SIAM"},{"issue":"3","key":"120_CR41","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1137\/S1052623400376366","volume":"14","author":"K Kiwiel","year":"2003","unstructured":"Kiwiel, K.: Convergence of approximate and incremental subgradient methods for convex optimization. SIAM J. Optim. 14(3), 807\u2013840 (2003)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"120_CR42","first-page":"207","volume":"85","author":"K Kiwiel","year":"1999","unstructured":"Kiwiel, K., Goffin, J.: Convergence of a simple subgradient level method. Math. Program. 85(4), 207\u2013211 (1999)","journal-title":"Math. Program."},{"key":"120_CR43","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1287\/moor.24.1.237","volume":"23","author":"K Kiwiel","year":"1999","unstructured":"Kiwiel, K., Larsson, T., Lindberg, P.: The efficiency of ballstep subgradient level methods for convex optimization. Math. Oper. Res. 23, 237\u2013254 (1999)","journal-title":"Math. Oper. Res."},{"key":"120_CR44","unstructured":"Lan, G., Zhou, Y.: Approximation accuracy, gradient methods, and error bound for structured convex optimization. Technical report, University of Florida (2014)"},{"issue":"2","key":"120_CR45","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1016\/0377-2217(94)00200-2","volume":"88","author":"T Larsson","year":"1996","unstructured":"Larsson, T., Patriksson, M., Str\u00f6mberg, A.B.: Conditional subgradient optimization\u2014theory and applications. Eur. J. Oper. Res. 88(2), 382\u2013403 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"120_CR46","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/s101070050090","volume":"86","author":"T Larsson","year":"1999","unstructured":"Larsson, T., Patriksson, M., Str\u00f6mberg, A.B.: Ergodic, primal convergence in dual subgradient schemes for convex programming. Math. Program. 86, 283\u2013312 (1999)","journal-title":"Math. Program."},{"key":"120_CR47","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BFb0120700","volume-title":"Nondifferentiable Optimization, Mathematical Programming Study","author":"C Lemar\u00e9chal","year":"1975","unstructured":"Lemar\u00e9chal, C.: An extension of Davidon methods to nondifferentiable problems. In: Balinski, M., Wolfe, P. (eds.) Nondifferentiable Optimization, Mathematical Programming Study, vol. 3, pp. 95\u2013109. North-Holland, Amsterdam (1975)"},{"key":"120_CR48","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/PL00011429","volume":"90","author":"C Lemar\u00e9chal","year":"2001","unstructured":"Lemar\u00e9chal, C., Renaud, A.: A geometric study of duality gaps, with applications. Math. Program. 90, 399\u2013427 (2001)","journal-title":"Math. Program."},{"issue":"11","key":"120_CR49","doi-asserted-by":"crossref","first-page":"2674","DOI":"10.1109\/TAC.2008.2007159","volume":"53","author":"I Necoara","year":"2008","unstructured":"Necoara, I., Suykens, J.: Application of a smoothing technique to decomposition in convex optimization. IEEE Trans. Autom. Control 53(11), 2674\u20132679 (2008)","journal-title":"IEEE Trans. Autom. Control"},{"key":"120_CR50","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10107-007-0149-x","volume":"120","author":"A Nedic","year":"2009","unstructured":"Nedic, A., Bertsekas, D.: Incremental subgradient methods for nondifferentiable optimization. Math. Program. 120, 221\u2013259 (2009)","journal-title":"Math. Program."},{"key":"120_CR51","volume-title":"Problem Complexity and Method Efficiency in Optimization","author":"A Nemirovski","year":"1983","unstructured":"Nemirovski, A., Yudin, D.: Problem Complexity and Method Efficiency in Optimization. Wiley, New York (1983)"},{"key":"120_CR52","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1137\/S1052623403422285","volume":"16","author":"Y Nesterov","year":"2005","unstructured":"Nesterov, Y.: Excessive gap technique in nonsmooth convex minimization. SIAM J. Optim. 16, 235\u2013249 (2005)","journal-title":"SIAM J. Optim."},{"key":"120_CR53","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"Y Nesterov","year":"2005","unstructured":"Nesterov, Y.: Smooth minimization of non-smooth functions. Math. Program. 103, 127\u2013152 (2005)","journal-title":"Math. Program."},{"key":"120_CR54","doi-asserted-by":"crossref","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 optimization. Math. Program. 120, 221\u2013259 (2009)","journal-title":"Math. Program."},{"key":"120_CR55","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/s10107-014-0790-0","volume":"152","author":"Y Nesterov","year":"2014","unstructured":"Nesterov, Y.: Universal gradient methods for convex optimization problems. Math. Program. 152, 381\u2013404 (2014)","journal-title":"Math. Program."},{"issue":"3","key":"120_CR56","doi-asserted-by":"crossref","first-page":"1547","DOI":"10.1137\/070711712","volume":"20","author":"E Neto","year":"2009","unstructured":"Neto, E., De Pierro, A.: Incremental subgradients for constrained convex optimization: a unified framework and new methods. SIAM J. Optim. 20(3), 1547\u20131572 (2009)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"120_CR57","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s10107-008-0209-x","volume":"119","author":"A Ouorou","year":"2009","unstructured":"Ouorou, A.: A proximal cutting plane method using Chebychev center for nonsmooth convex optimization. Math. Program. 119(2), 239\u2013271 (2009)","journal-title":"Math. Program."},{"issue":"3","key":"120_CR58","first-page":"509","volume":"9","author":"B Polyak","year":"1969","unstructured":"Polyak, B.: Minimization of unsmooth functionals. Zh. Vychisl. Mat. Fiz 9(3), 509\u2013521 (1969)","journal-title":"Zh. Vychisl. Mat. Fiz"},{"key":"120_CR59","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-6377(99)00063-2","volume":"26","author":"B Sherali","year":"2000","unstructured":"Sherali, B., Choi, B., Tuncbilek, C.: A variable target value method for nondifferentiable optimization. Oper. Res. Lett. 26, 1\u20138 (2000)","journal-title":"Oper. Res. Lett."},{"key":"120_CR60","doi-asserted-by":"crossref","first-page":"455462","DOI":"10.1016\/j.orl.2003.12.006","volume":"32","author":"B Sherali","year":"2004","unstructured":"Sherali, B., Lim, C.: On embedding the volume algorithm in a variable target value method. Oper. Res. Lett. 32, 455462 (2004)","journal-title":"Oper. Res. Lett."},{"key":"120_CR61","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-82118-9","volume-title":"Minimization Methods for Nondifferentiable Functions","author":"N Shor","year":"1985","unstructured":"Shor, N.: Minimization Methods for Nondifferentiable Functions. Springer, Berlin (1985)"},{"issue":"3","key":"120_CR62","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1023\/A:1022680114518","volume":"98","author":"M Solodov","year":"1998","unstructured":"Solodov, M., Zavriev, S.: Error stability properties of generalized gradient-type algorithms. J. Optim. Theory Appl. 98(3), 663\u2013680 (1998)","journal-title":"J. Optim. Theory Appl."},{"key":"120_CR63","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/s10107-010-0394-2","volume":"125","author":"P Tseng","year":"2010","unstructured":"Tseng, P.: Conditional gradient sliding for convex optimization. Math. Program. 125, 263\u2013295 (2010)","journal-title":"Math. Program."},{"key":"120_CR64","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BFb0120703","volume-title":"Nondifferentiable Optimization, Mathematical Programming Study","author":"P Wolfe","year":"1975","unstructured":"Wolfe, P.: A method of conjugate subgradients for minimizing nondifferentiable functions. In: Balinski, M., Wolfe, P. (eds.) Nondifferentiable Optimization, Mathematical Programming Study, vol. 3, pp. 145\u2013173. North-Holland, Amsterdam (1975)"}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-017-0120-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-017-0120-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-017-0120-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,23]],"date-time":"2019-09-23T16:56:42Z","timestamp":1569257802000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-017-0120-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,6]]},"references-count":64,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["120"],"URL":"https:\/\/doi.org\/10.1007\/s12532-017-0120-7","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,5,6]]}}}