{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T14:16:54Z","timestamp":1761401814562,"version":"3.41.0"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2016,7,28]],"date-time":"2016-07-28T00:00:00Z","timestamp":1469664000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100002835","name":"Chalmers University of Technology","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100002835","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.1007\/s10107-016-1055-x","type":"journal-article","created":{"date-parts":[[2016,7,28]],"date-time":"2016-07-28T04:46:13Z","timestamp":1469681173000},"page":"57-84","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Ergodic, primal convergence in dual subgradient schemes for convex programming, II: the case of inconsistent primal problems"],"prefix":"10.1007","volume":"163","author":[{"given":"Magnus","family":"\u00d6nnheim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emil","family":"Gustavsson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1962-7279","authenticated-orcid":false,"given":"Ann-Brith","family":"Str\u00f6mberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Patriksson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Torbj\u00f6rn","family":"Larsson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,28]]},"reference":[{"issue":"1","key":"1055_CR1","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/s10107-007-0148-y","volume":"120","author":"KA Anstreicher","year":"2009","unstructured":"Anstreicher, K.A., Wolsey, L.A.: Two \u201cwell-known\u201d properties of subgradient optimization. Math. Program. 120(1), 213\u2013220 (2009)","journal-title":"Math. Program."},{"key":"1055_CR2","doi-asserted-by":"crossref","DOI":"10.1002\/0471787779","volume-title":"Nonlinear Programming: Theory and Algorithms","author":"MS Bazaraa","year":"2006","unstructured":"Bazaraa, M.S., Sherali, H.D., Shetty, C.M.: Nonlinear Programming: Theory and Algorithms, 3rd edn. Wiley, New York (2006)","edition":"3"},{"key":"1055_CR3","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Programming, 2nd edn. Athena Scientific, Belmont (1999)","edition":"2"},{"issue":"2","key":"1055_CR4","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1080\/10556780701394169","volume":"23","author":"RH Byrd","year":"2008","unstructured":"Byrd, R.H., Nocedal, J., Waltz, R.A.: Steering exact penalty methods for nonlinear programming. Optim. Methods Soft. 23(2), 197\u2013213 (2008)","journal-title":"Optim. Methods Soft."},{"key":"1055_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-005-0701-5","volume":"108","author":"L Chen","year":"2006","unstructured":"Chen, L., Goldfarb, D.: Interior-point $$\\ell _2$$ \u2113 2 -penalty methods for nonlinear programming with strong global convergence properties. Math. Program. A 108, 1\u201336 (2006)","journal-title":"Math. Program. A"},{"key":"1055_CR6","unstructured":"Chiche, A., Gilbert, J.C.: How the augmented Lagrangian algorithm can deal with an infeasible convex quadratic optimization problem. J. Convex Anal. 23(2), 425\u2013459 (2016)"},{"issue":"3","key":"1055_CR7","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1023\/A:1015370617219","volume":"2","author":"A Dax","year":"2001","unstructured":"Dax, A.: The smallest correction of an inconsistent system of linear inequalities. Optim. Eng. 2(3), 349\u2013359 (2001)","journal-title":"Optim. Eng."},{"issue":"5","key":"1055_CR8","first-page":"1181","volume":"19","author":"VF Dem\u2019janov","year":"1978","unstructured":"Dem\u2019janov, V.F., \u0160omesova, V.K.: Conditional subdifferentials of convex functions. Sov. Math. Dokl. 19(5), 1181\u20131185 (1978)","journal-title":"Sov. Math. Dokl."},{"key":"1055_CR9","doi-asserted-by":"crossref","unstructured":"Ermol\u2019ev, Yu.M.: Methods for solving nonlinear extremal problems. Cybernetics 2(4), 1\u201314 (1966)","DOI":"10.1007\/BF01071403"},{"issue":"1","key":"1055_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","volume":"27","author":"ML Fisher","year":"1981","unstructured":"Fisher, M.L.: The Lagrangian relaxation method for solving integer programming problems. Manag. Sci. 27(1), 1\u201318 (1981)","journal-title":"Manag. Sci."},{"issue":"2","key":"1055_CR11","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1287\/inte.15.2.10","volume":"15","author":"ML Fisher","year":"1985","unstructured":"Fisher, M.L.: An applications oriented guide to Lagrangian relaxation. Interfaces 15(2), 10\u201321 (1985)","journal-title":"Interfaces"},{"issue":"1","key":"1055_CR12","first-page":"2","volume":"18","author":"R Fletcher","year":"2007","unstructured":"Fletcher, R., Leyffer, S., Toint, P.: A brief history of filter methods. SIAG\/OPT Views News 18(1), 2\u201312 (2007)","journal-title":"SIAG\/OPT Views News"},{"key":"1055_CR13","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BFb0120690","volume":"2","author":"AM Geoffrion","year":"1974","unstructured":"Geoffrion, A.M.: Lagrangian relaxation for integer programming. Math. Program. Study 2, 82\u2013114 (1974)","journal-title":"Math. Program. Study"},{"issue":"2","key":"1055_CR14","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/s10107-014-0772-2","volume":"150","author":"E Gustavsson","year":"2015","unstructured":"Gustavsson, E., Patriksson, M., Str\u00f6mberg, A.-B.: Primal convergence from dual subgradient methods for convex optimization. Math. Program. 150(2), 365\u2013390 (2015)","journal-title":"Math. Program."},{"issue":"6","key":"1055_CR15","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.M.: The traveling-salesman problem and minimum spanning trees. Oper. Res. 18(6), 1138\u20131162 (1970)","journal-title":"Oper. Res."},{"issue":"1","key":"1055_CR16","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/BF01584070","volume":"1","author":"M Held","year":"1971","unstructured":"Held, M., Karp, R.M.: The traveling-salesman problem and minimum spanning trees: Part II. Math. Program. 1(1), 6\u201325 (1971)","journal-title":"Math. Program."},{"key":"1055_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02796-7","volume-title":"Convex Analysis and Minimization Algorithms I","author":"J-B Hiriart-Urruty","year":"1993","unstructured":"Hiriart-Urruty, J.-B., Lemar\u00e9chal, C.: Convex Analysis and Minimization Algorithms I. Springer, Berlin (1993)"},{"key":"1055_CR18","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/s10107-007-0123-7","volume":"116","author":"E Karas","year":"2009","unstructured":"Karas, E., Ribeiro, A., Sagastiz\u00e1bal, C., Solodov, M.: A bundle-filter method for nonsmooth convex constrained optimization. Math. Program. B 116, 297\u2013320 (2009)","journal-title":"Math. Program. B"},{"issue":"3","key":"1055_CR19","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1007\/BF02191984","volume":"84","author":"KC Kiwiel","year":"1995","unstructured":"Kiwiel, K.C.: Approximations in proximal bundle methods and decomposition of convex programs. J. Optim. Theory Appl. 84(3), 529\u2013548 (1995)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"1055_CR20","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(3), 669\u2013686 (2007)","journal-title":"Math. Oper. Res."},{"key":"1055_CR21","volume-title":"Infinite Sequences and Series","author":"K Knopp","year":"1956","unstructured":"Knopp, K.: Infinite Sequences and Series. Dover Publications, New York (1956)"},{"issue":"3","key":"1055_CR22","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1287\/opre.1060.0292","volume":"54","author":"T Larsson","year":"2006","unstructured":"Larsson, T., Patriksson, M.: Global optimality conditions for discrete and nonconvex optimization\u2014with applications to Lagrangian heuristics and column generation. Oper. Res. 54(3), 436\u2013453 (2006)","journal-title":"Oper. Res."},{"issue":"2","key":"1055_CR23","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."},{"issue":"1\u20133","key":"1055_CR24","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1080\/10556789808805688","volume":"9","author":"T Larsson","year":"1998","unstructured":"Larsson, T., Patriksson, M., Str\u00f6mberg, A.-B.: Ergodic convergence in subgradient optimization. Optim. Methods Softw. 9(1\u20133), 93\u2013120 (1998)","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"1055_CR25","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(2), 283\u2013312 (1999)","journal-title":"Math. Program."},{"issue":"3","key":"1055_CR26","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1016\/S0377-2217(02)00629-X","volume":"151","author":"T Larsson","year":"2003","unstructured":"Larsson, T., Patriksson, M., Str\u00f6mberg, A.-B.: On the convergence of conditional $$\\varepsilon $$ \u03b5 -subgradient methods for convex programs and convex-concave saddle-point problems. Eur. J. Oper. Res. 151(3), 461\u2013473 (2003)","journal-title":"Eur. J. Oper. Res."},{"key":"1055_CR27","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1090\/conm\/568\/11282","volume":"568","author":"T Larsson","year":"2012","unstructured":"Larsson, T., Patriksson, M., Str\u00f6mberg, A.-B.: Ergodic convergence in subgradient optimization\u2014with application to simplicial decomposition of convex programs. Contemp. Math. 568, 159\u2013189 (2012)","journal-title":"Contemp. Math."},{"key":"1055_CR28","unstructured":"Lasdon, L.S.: Optimization Theory for Large Systems. MacMillan Series for Operations Research. MacMillan Publishing Co., Inc., New York (1970). Reprinted by Dover Publications, Mineola (2002)"},{"key":"1055_CR29","doi-asserted-by":"crossref","unstructured":"Lemar\u00e9chal, C.: Lagrangian relaxation. In: J\u00fcnger, M., Naddef, D. (eds.) Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions, no. 2241 in Lecture Notes in Computer Science, pp. 112\u2013156. Springer, Berlin (2001)","DOI":"10.1007\/3-540-45586-8_4"},{"key":"1055_CR30","doi-asserted-by":"crossref","unstructured":"Lemar\u00e9chal, C., Nemirovski, A., Nesterov, Yu.: New variants of bundle methods. Math. Program. 69(1\u20133), 111\u2013147 (1995)","DOI":"10.1007\/BF01585555"},{"issue":"4","key":"1055_CR31","doi-asserted-by":"crossref","first-page":"1163","DOI":"10.1137\/S1052623402400641","volume":"14","author":"X Liu","year":"2004","unstructured":"Liu, X., Sun, J.: A robust primal-dual interior-point algorithm for nonlinear programs. SIAM J. Optim. 14(4), 1163\u20131186 (2004)","journal-title":"SIAM J. Optim."},{"key":"1055_CR32","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization. Wiley-Interscience Series in Discrete Mathematics and Optimization","author":"GL Nemhauser","year":"1988","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley, New York (1988)"},{"issue":"1","key":"1055_CR33","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10107-007-0149-x","volume":"120","author":"Yu Nesterov","year":"2009","unstructured":"Nesterov, Yu.: Primal-dual subgradient methods for convex programs. Math. Program. Ser. B 120(1), 221\u2013259 (2009)","journal-title":"Math. Program. Ser. B"},{"key":"1055_CR34","first-page":"119","volume":"208","author":"Y Peng","year":"2009","unstructured":"Peng, Y., Feng, H., Li, Q.: A filter-variable-metric method for nonsmooth convex constrained optimization. Appl. Math. Comput. 208, 119\u2013128 (2009)","journal-title":"Appl. Math. Comput."},{"issue":"3","key":"1055_CR35","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(3), 593\u2013597 (1967)","journal-title":"Sov. Math. Dokl."},{"issue":"3","key":"1055_CR36","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. USSR Comput. Math. Math. Phys. 9(3), 14\u201329 (1969)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"1055_CR37","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"issue":"2","key":"1055_CR38","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(2), 97\u2013116 (1976)","journal-title":"Math. Oper. Res."},{"key":"1055_CR39","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":"1055_CR40","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-016-1055-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-016-1055-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-1055-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-1055-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T06:47:07Z","timestamp":1749019627000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-016-1055-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,28]]},"references-count":40,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2017,5]]}},"alternative-id":["1055"],"URL":"https:\/\/doi.org\/10.1007\/s10107-016-1055-x","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2016,7,28]]}}}