{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T14:24:00Z","timestamp":1776435840642,"version":"3.51.2"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,4,16]],"date-time":"2014-04-16T00:00:00Z","timestamp":1397606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2015,5]]},"DOI":"10.1007\/s10107-014-0772-2","type":"journal-article","created":{"date-parts":[[2014,4,15]],"date-time":"2014-04-15T13:20:46Z","timestamp":1397568046000},"page":"365-390","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":35,"title":["Primal convergence from dual subgradient methods for convex optimization"],"prefix":"10.1007","volume":"150","author":[{"given":"Emil","family":"Gustavsson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Patriksson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ann-Brith","family":"Str\u00f6mberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,4,16]]},"reference":[{"key":"772_CR1","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/s10107-007-0148-y","volume":"120","author":"KM Anstreicher","year":"2009","unstructured":"Anstreicher, K.M., Wolsey, L.A.: Two \u201cwell-known\u201d properties of subgradient optimization. Math. Program. 120, 213\u2013220 (2009)","journal-title":"Math. Program."},{"key":"772_CR2","first-page":"170","volume":"120","author":"F Babonneau","year":"2009","unstructured":"Babonneau, F., Vial, J.-P.: ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems. Math. Program. 120, 170\u2013210 (2009)","journal-title":"Math. Program."},{"key":"772_CR3","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/s10107-007-0191-8","volume":"120","author":"F Babonneau","year":"2009","unstructured":"Babonneau, F., Vial, J.-P.: ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems: a corrigendum. Math. Program. 120, 211\u2013212 (2009)","journal-title":"Math. Program."},{"key":"772_CR4","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, 41\u201369 (2002)","journal-title":"Math. Program."},{"key":"772_CR5","doi-asserted-by":"crossref","first-page":"716","DOI":"10.1287\/opre.37.5.716","volume":"37","author":"A Balakrishnan","year":"1989","unstructured":"Balakrishnan, A., Magnanti, T.L., Wong, R.T.: A dual-ascent procedure for large-scale uncapacitated network design. Oper. Res. 37, 716\u2013740 (1989)","journal-title":"Oper. Res."},{"issue":"4","key":"772_CR6","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1287\/trsc.36.4.398.549","volume":"36","author":"H Bar-Gera","year":"2002","unstructured":"Bar-Gera, H.: Origin-based algorithm for the traffic assignment problem. Transp. Sci. 36(4), 398\u2013417 (2002)","journal-title":"Transp. Sci."},{"key":"772_CR7","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, 385\u2013399 (2000)","journal-title":"Math. Program."},{"key":"772_CR8","volume-title":"Nonlinear Programming Theory and Applications","author":"MS Bazaraa","year":"1993","unstructured":"Bazaraa, M.S., Sherali, H.D., Shetty, C.M.: Nonlinear Programming Theory and Applications, 2nd edn. Wiley, New York (1993)","edition":"2"},{"key":"772_CR9","volume-title":"Constrained Optimization and Lagrange Multiplier Methods","author":"DP Bertsekas","year":"1982","unstructured":"Bertsekas, D.P.: Constrained Optimization and Lagrange Multiplier Methods. Academic Press, San Diego, CA (1982)"},{"key":"772_CR10","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/978-1-4419-0437-9_5","volume-title":"Variational Analysis and Generalized Differentiation in Optimization and Control, Springer Optimization and Its Applications","author":"RS Burachik","year":"2010","unstructured":"Burachik, R.S., Kaya, C.Y.: A deflected subgradient method using a general augmented Lagrangian duality with implications on penalty methods. In: Burachik, R.S., Yao, J.C. (eds.) Variational Analysis and Generalized Differentiation in Optimization and Control, Springer Optimization and Its Applications, vol. 47, pp. 109\u2013132. Springer, New York (2010)"},{"key":"772_CR11","first-page":"215","volume":"81","author":"S Ceria","year":"1998","unstructured":"Ceria, S., Nobili, P., Sassano, A.: A Lagrangian-based heuristic for large-scale set covering problems. Math. Program. 81, 215\u2013228 (1998)","journal-title":"Math. Program."},{"key":"772_CR12","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, 357\u2013386 (2009)","journal-title":"SIAM J. Optim."},{"key":"772_CR13","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1, 269\u2013271 (1959)","journal-title":"Numer. Math."},{"issue":"2","key":"772_CR14","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91(2), 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"772_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01071403","volume":"2","author":"YM Ermol\u2019ev","year":"1966","unstructured":"Ermol\u2019ev, Y.M.: Methods of solution of nonlinear extremal problems. Cybernetics 2, 1\u201314 (1966)","journal-title":"Cybernetics"},{"key":"772_CR16","first-page":"626","volume":"27","author":"ML Fisher","year":"1991","unstructured":"Fisher, M.L.: The Lagrangian relaxation method for solving integer programming problems. Manag. Sci. 27, 626\u2013642 (1991)","journal-title":"Manag. Sci."},{"key":"772_CR17","doi-asserted-by":"crossref","first-page":"1229","DOI":"10.1016\/j.dam.2008.04.022","volume":"157","author":"A Frangioni","year":"2009","unstructured":"Frangioni, A., Gendron, B.: 0-1 reformulations of the multicommodity capacitated network design problem. Discret. Appl. Math. 157, 1229\u20131241 (2009)","journal-title":"Discret. Appl. Math."},{"key":"772_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02288320","volume":"13","author":"G Gallo","year":"1988","unstructured":"Gallo, G., Pallottino, S.: Shortest path algorithms. Ann. Oper. Res. 13, 1\u201379 (1988)","journal-title":"Ann. Oper. Res."},{"key":"772_CR19","first-page":"131","volume":"76","author":"J-L Goffin","year":"1996","unstructured":"Goffin, J.-L., Gondzio, J., Sarkissian, R., Vial, J.-P.: Solving nonlinear multicommodity flow problems by the analytic center cutting plane method. Math. Program. 76, 131\u2013154 (1996)","journal-title":"Math. Program."},{"key":"772_CR20","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF01585731","volume":"46","author":"KC Kiwiel","year":"1990","unstructured":"Kiwiel, K.C.: Proximity control in bundle methods for convex nondifferentiable minimization. Math. Program. 46, 105\u2013122 (1990)","journal-title":"Math. Program."},{"key":"772_CR21","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/s10107-009-0327-0","volume":"130","author":"KC Kiwiel","year":"2011","unstructured":"Kiwiel, K.C.: An alternative linearization bundle method for convex optimization and nonlinear multicommodity flow problems. Math. Program. 130, 59\u201384 (2011)","journal-title":"Math. Program."},{"key":"772_CR22","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1287\/moor.24.1.237","volume":"24","author":"KC Kiwiel","year":"1999","unstructured":"Kiwiel, K.C., Larsson, T., Lindberg, P.O.: The efficiency of ballstep subgradient level methods for convex optimization. Math. Oper. Res. 24, 237\u2013254 (1999)","journal-title":"Math. Oper. Res."},{"key":"772_CR23","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1287\/moor.1070.0261","volume":"32","author":"KC Kiwiel","year":"2007","unstructured":"Kiwiel, K.C., Larsson, T., Lindberg, P.O.: Lagrangian relaxation via ballstep subgradient methods. Math. Oper. Res. 32, 669\u2013686 (2007)","journal-title":"Math. Oper. Res."},{"key":"772_CR24","volume-title":"Communication Nets; Stochastic Message Flow and Delay","author":"L Kleinrock","year":"1972","unstructured":"Kleinrock, L.: Communication Nets; Stochastic Message Flow and Delay. Dover, New York (1972)"},{"key":"772_CR25","volume-title":"Infinite Sequences and Series","author":"K Knopp","year":"1956","unstructured":"Knopp, K.: Infinite Sequences and Series. Dover Publications, New York, NY (1956)"},{"key":"772_CR26","unstructured":"Larsson, T., Liu, Z.: A Primal Convergence Result for Dual Subgradient Optimization with Application to Multi-Commodity Network Flows. Technical Report. Department of Mathematics, Link\u00f6ping Institute of Technology (1989)"},{"key":"772_CR27","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1080\/02331939708844312","volume":"40","author":"T Larsson","year":"1997","unstructured":"Larsson, T., Liu, Z.: A Lagrangean relaxation scheme for structured linear programs with application to multicommodity network flows. Optimization 40, 247\u2013284 (1997)","journal-title":"Optimization"},{"key":"772_CR28","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1080\/02331939708844366","volume":"42","author":"T Larsson","year":"1997","unstructured":"Larsson, T., Liu, Z., Patriksson, M.: A dual scheme for traffic assignment problems. Optimization 42, 323\u2013358 (1997)","journal-title":"Optimization"},{"issue":"6","key":"772_CR29","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1016\/0191-2615(95)00016-7","volume":"29","author":"T Larsson","year":"1995","unstructured":"Larsson, T., Patriksson, M.: An augmented Lagrangean dual algorithm for link capacity side constrained traffic assignment problems. Transp. Res. Part B Methodol. 29(6), 433\u2013455 (1995)","journal-title":"Transp. Res. Part B Methodol."},{"key":"772_CR30","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":"772_CR31","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":"772_CR32","doi-asserted-by":"crossref","first-page":"1757","DOI":"10.1137\/070708111","volume":"19","author":"A Nedi\u0107","year":"2009","unstructured":"Nedi\u0107, A., Ozdaglar, A.: Approximate primal solutions and rate analysis for dual subgradient methods. SIAM J. Optim. 19, 1757\u20131780 (2009)","journal-title":"SIAM J. Optim."},{"key":"772_CR33","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/s10957-009-9522-7","volume":"142","author":"A Nedi\u0107","year":"2009","unstructured":"Nedi\u0107, A., Ozdaglar, A.: Subgradient methods for saddle-point problems. J. Optim. Theory Appl. 142, 205\u2013228 (2009)","journal-title":"J. Optim. Theory Appl."},{"key":"772_CR34","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 problems. Math. Program. Ser. B 120, 221\u2013259 (2009)","journal-title":"Math. Program. Ser. B"},{"key":"772_CR35","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1287\/mnsc.46.1.126.15132","volume":"46","author":"A Ouorou","year":"2000","unstructured":"Ouorou, A., Mahey, P., Vial, J.-P.: A survey of algorithms for convex multicommodity flow problems. Manag. Sci. 46, 126\u2013147 (2000)","journal-title":"Manag. Sci."},{"key":"772_CR36","unstructured":"Patriksson, M.: The Traffic Assignment Problem: Models and Methods. Topics in Transportation series, VSP, Utrecht, The Netherlands (1994)"},{"key":"772_CR37","first-page":"593","volume":"8","author":"BT Polyak","year":"1967","unstructured":"Polyak, B.T.: A general method of solving extremum problems. Sov. Math. Dokl. 8, 593\u2013597 (1967)","journal-title":"Sov. Math. Dokl."},{"key":"772_CR38","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0041-5553(69)90061-5","volume":"9","author":"BT Polyak","year":"1969","unstructured":"Polyak, B.T.: Minimization of unsmooth functionals. Comput. Math. Math. Phys. 9, 14\u201329 (1969)","journal-title":"Comput. Math. Math. Phys."},{"key":"772_CR39","volume-title":"Introduction to Optimization","author":"BT Polyak","year":"1987","unstructured":"Polyak, B.T.: Introduction to Optimization. Optimization Software, Publications Division, NY (1987)"},{"key":"772_CR40","unstructured":"Robinson, S.M.: Bundle-based decomposition: conditions for convergence. In: International Institute for Applied Systems Analysis (1987)"},{"key":"772_CR41","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1287\/moor.1.2.97","volume":"1","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar, R.T.: Augmented Lagrangians and applications of the proximal point algorithm in convex optimization. Math. Oper. Res. 1, 97\u2013116 (1976)","journal-title":"Math. Oper. Res."},{"key":"772_CR42","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0167-6377(96)00019-3","volume":"19","author":"HD Sherali","year":"1996","unstructured":"Sherali, H.D., Choi, G.: Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs. Oper. Res. Lett. 19, 105\u2013113 (1996)","journal-title":"Oper. Res. Lett."},{"key":"772_CR43","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1016\/j.orl.2003.12.006","volume":"32","author":"HD Sherali","year":"2004","unstructured":"Sherali, H.D., Lim, C.: On embedding the volume algorithm in a variable target value method. Oper. Res. Lett. 32, 455\u2013462 (2004)","journal-title":"Oper. Res. Lett."},{"key":"772_CR44","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-82118-9","volume-title":"Minimization Methods for Non-Differentiable Functions","author":"NZ Shor","year":"1985","unstructured":"Shor, N.Z.: Minimization Methods for Non-Differentiable Functions. Springer, Berlin (1985)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-014-0772-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-014-0772-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-014-0772-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T22:52:21Z","timestamp":1553640741000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-014-0772-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,16]]},"references-count":44,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,5]]}},"alternative-id":["772"],"URL":"https:\/\/doi.org\/10.1007\/s10107-014-0772-2","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,4,16]]}}}