{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T00:47:38Z","timestamp":1780361258763,"version":"3.54.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,4,8]],"date-time":"2014-04-08T00:00:00Z","timestamp":1396915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1007\/s10957-014-0561-3","type":"journal-article","created":{"date-parts":[[2014,4,7]],"date-time":"2014-04-07T22:20:57Z","timestamp":1396909257000},"page":"173-201","source":"Crossref","is-referenced-by-count":125,"title":["Convergence of the Surrogate Lagrangian Relaxation Method"],"prefix":"10.1007","volume":"164","author":[{"given":"Mikhail A.","family":"Bragin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter B.","family":"Luh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joseph H.","family":"Yan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nanpeng","family":"Yu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gary A.","family":"Stern","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,4,8]]},"reference":[{"issue":"4","key":"561_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01071403","volume":"2","author":"YM Ermoliev","year":"1966","unstructured":"Ermoliev, Y.M.: Methods for solving nonlinear extremal problems. Cybernetics 2(4), 1\u201317 (1966)","journal-title":"Cybernetics"},{"key":"561_CR2","first-page":"593","volume":"8","author":"BT Polyak","year":"1967","unstructured":"Polyak, B.T.: A general method of solving extremum problems. Sov. Math. Doklady 8, 593\u2013597 (1967)","journal-title":"Sov. Math. Doklady"},{"issue":"3","key":"561_CR3","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). (in Russian)","journal-title":"USSR Comput. Math. Math. Phys."},{"issue":"3","key":"561_CR4","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF01073933","volume":"4","author":"NZ Shor","year":"1968","unstructured":"Shor, N.Z.: On the rate of convergence of the generalized gradient method. Cybernetics 4(3), 79\u201380 (1968)","journal-title":"Cybernetics"},{"issue":"2","key":"561_CR5","first-page":"337","volume":"12","author":"NZ Shor","year":"1976","unstructured":"Shor, N.Z.: Generalized gradient methods for non-smooth functions and their applications to mathematical programming problems. Econ. Math. Methods 12(2), 337\u2013356 (1976). (in Russian)","journal-title":"Econ. Math. Methods"},{"key":"561_CR6","unstructured":"Goffin, J.-L.: On the finite convergence of the relaxation method for solving systems of inequalities. Operations Research Center Report ORC 71\u201336, University of California at Berkeley, Berkeley (1971)."},{"issue":"1","key":"561_CR7","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/s101070050053","volume":"85","author":"J-L Goffin","year":"1999","unstructured":"Goffin, J.-L., Kiwiel, K.: Convergence of a simple subgradient level method. Math. Program. 85(1), 207\u2013211 (1999)","journal-title":"Math. Program."},{"key":"561_CR8","first-page":"263","volume-title":"Stochastic Optimization: Algorithms and Applications","author":"A Nedic","year":"2000","unstructured":"Nedic, A., Bertsekas, D.P.: Convergence rate of incremental subgradient algorithms. In: Uryasev, S., Pardalos, P.M. (eds.) Stochastic Optimization: Algorithms and Applications, pp. 263\u2013304. Kluwer Academic, New York (2000)"},{"issue":"1","key":"561_CR9","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1137\/S1052623499362111","volume":"56","author":"A Nedic","year":"2001","unstructured":"Nedic, A., Bertsekas, D.: Incremental subgradient methods for nondifferentiable optimization. SIAM J. Optim. 56(1), 109\u2013138 (2001)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"561_CR10","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(1), 127\u2013152 (2005)","journal-title":"Math. Program."},{"key":"561_CR11","unstructured":"Bertsekas, D.P.: Incremental gradient, subgradient, and proximal methods for convex optimization: a survey. LIDS Technical Report no. 2848, MIT, (2010)."},{"key":"561_CR12","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/s10107-011-0472-0","volume":"129","author":"DP Bertsekas","year":"2011","unstructured":"Bertsekas, D.P.: Incremental proximal methods for large scale convex optimization. Math. Program. 129, 163\u2013195 (2011)","journal-title":"Math. Program."},{"key":"561_CR13","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01585555","volume":"69","author":"C Lemarechal","year":"1995","unstructured":"Lemarechal, C., Nemirovskii, A.S., Nesterov, Y.E.: New variants of bundle methods. Math. Program. 69, 111\u2013147 (1995)","journal-title":"Math. Program."},{"issue":"11","key":"561_CR14","first-page":"1085","volume":"30","author":"CA Kaskavelis","year":"1998","unstructured":"Kaskavelis, C.A., Caramanis, M.C.: Efficient Lagrangian relaxation algorithms for industry size job-shop scheduling problems. IIE Trans. 30(11), 1085\u20131097 (1998)","journal-title":"IIE Trans."},{"issue":"3","key":"561_CR15","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1023\/A:1022646725208","volume":"100","author":"X Zhao","year":"1999","unstructured":"Zhao, X., Luh, P.B., Wang, J.: Surrogate gradient algorithm for Lagrangian relaxation. J. Optim. Theory Appl. 100(3), 699\u2013712 (1999)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"561_CR16","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1109\/TPWRS.2006.873104","volume":"21","author":"PB Luh","year":"2006","unstructured":"Luh, P.B., Blankson, W.E., Chen, Y., Yan, J.H., Stern, G.A., Chang, S.C., Zhao, F.: Payment cost minimization auction for the deregulated electricity markets using surrogate optimization. IEEE Trans. Power Syst. 21(2), 568\u2013578 (2006)","journal-title":"IEEE Trans. Power Syst."},{"issue":"3","key":"561_CR17","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/s10957-007-9238-5","volume":"133","author":"T Sun","year":"2007","unstructured":"Sun, T., Zhao, Q.C., Luh, P.B.: On the surrogate gradient algorithm for Lagrangian relaxation. J. Optim. Theory Appl. 133(3), 413\u2013416 (2007)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"561_CR18","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1007\/s10957-007-9349-z","volume":"137","author":"TS Chang","year":"2008","unstructured":"Chang, T.S.: Comments on \u201cSurrogate gradient algorithm for Lagrangian relaxation\u201d. J. Optim. Theory Appl. 137(3), 691\u2013697 (2008)","journal-title":"J. Optim. Theory Appl."},{"key":"561_CR19","doi-asserted-by":"crossref","unstructured":"Bragin, M.A., Han, X., Luh, P.B., Yan, J.H.: Payment cost minimization using Lagrangian relaxation and modified surrogate optimization approach. In: Proceedings of the IEEE Power Engineering Society, General Meeting, Detroit, Michigan (2011)","DOI":"10.1109\/PES.2011.6039191"},{"key":"561_CR20","doi-asserted-by":"crossref","unstructured":"Bragin, M.A., Luh, P.B., Yan, J.H., Yu, N., Han, X., Stern, G.A.: An efficient surrogate subgradient method within Lagrangian relaxation for the payment cost minimization problem. In: Proceedings of the IEEE Power Engineering Society, General Meeting, San Diego (2012)","DOI":"10.1109\/PESGM.2012.6345529"},{"issue":"3","key":"561_CR21","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/BF02591740","volume":"37","author":"E Allen","year":"1987","unstructured":"Allen, E., Nelgason, R., Kennongton, J., Shettym, B.: A generalization of Polyak\u2019s convergence result for subgradient optimization. Math. Program. 37(3), 309\u2013317 (1987)","journal-title":"Math. Program."},{"key":"561_CR22","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"2008","unstructured":"Bertsekas, D.P.: Nonlinear Programming. Athena Scientific, Massachusetts (2008)"},{"issue":"4","key":"561_CR23","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1142\/S0218213004001806","volume":"13","author":"BW Wah","year":"2004","unstructured":"Wah, B.W., Chen, Y.X.: Subgoal partitioning and global search for solving temporal planning problems in mixed space. Int. J. Artif. Intell. Tools 13(4), 767\u2013790 (2004)","journal-title":"Int. J. Artif. Intell. Tools"},{"issue":"1","key":"561_CR24","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/S0305-0548(96)00032-9","volume":"24","author":"PC Chu","year":"1997","unstructured":"Chu, P.C., Beasley, J.E.: A genetic algorithm for the generalized assignment problem. Comput. Oper. Res. 24(1), 17\u201323 (1997)","journal-title":"Comput. Oper. Res."},{"key":"561_CR25","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1080\/10556789808805722","volume":"10","author":"M Yagiura","year":"1998","unstructured":"Yagiura, M., Yamaguchi, T., Ibaraki, T.: A variable depth search algorithm with branching search for the generalized assignment problem. Optim. Methods Softw. 10, 419\u2013441 (1998)","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"561_CR26","doi-asserted-by":"crossref","first-page":"548","DOI":"10.1016\/j.ejor.2004.08.015","volume":"169","author":"M Yagiura","year":"2006","unstructured":"Yagiura, M., Ibaraki, T., Glover, F.: A path relinking approach with ejection chains for the generalized assignment problem. Eur. J. Oper. Res. 169(2), 548\u2013569 (2006)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"561_CR27","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1007\/s10589-008-9183-8","volume":"45","author":"P Avella","year":"2010","unstructured":"Avella, P., Boccia, M., Vasilyev, I.: A computational study of exact knapsack separation for the generalized assignment problem. Comput. Optim. Appl. 45(3), 543\u2013555 (2010)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"561_CR28","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1007\/s10589-011-9432-0","volume":"52","author":"M Posta","year":"2012","unstructured":"Posta, M., Ferland, J.A., Michelon, P.: An exact method with variable fixing for solving the generalized assignment problem. Comput. Optim. Appl. 52(3), 629\u2013644 (2012)","journal-title":"Comput. Optim. Appl."},{"issue":"11","key":"561_CR29","doi-asserted-by":"crossref","first-page":"3782","DOI":"10.1016\/j.amc.2009.11.018","volume":"215","author":"L \u00d6zbakir","year":"2010","unstructured":"\u00d6zbakir, L., Baykasoglu, A., Tapkan, P.: Bees algorithm for generalized assignment problem. Appl. Math. Comput. 215(11), 3782\u20133795 (2010)","journal-title":"Appl. Math. Comput."},{"issue":"2","key":"561_CR30","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1080\/1055678031000107105","volume":"18","author":"Y Asahiro","year":"2003","unstructured":"Asahiro, Y., Ishibashi, M., Yamashita, M.: Independent and cooperative parallel search methods for the generalized assignment problem. Optim. Methods Softw. 18(2), 129\u2013141 (2003)","journal-title":"Optim. Methods Softw."},{"key":"561_CR31","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/0377-2217(93)E0174-V","volume":"82","author":"M Laguna","year":"1995","unstructured":"Laguna, M., Kelly, J.P., Gonzalez-Velarde, J.L., Glover, F.: Tabu search for the multilevel generalized assignment problem. Eur. J. Oper. Res. 82, 176\u2013189 (1995)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"561_CR32","doi-asserted-by":"crossref","first-page":"53","DOI":"10.2307\/1907742","volume":"25","author":"TC Koopmans","year":"1957","unstructured":"Koopmans, T.C., Beckmann, M.J.: Assignment problems and the location of economic activities. Econometrica 25(1), 53\u201376 (1957)","journal-title":"Econometrica"},{"key":"561_CR33","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0041-1647(72)90111-6","volume":"6","author":"JW Dickey","year":"1972","unstructured":"Dickey, J.W., Hopkins, J.W.: Campus building arrangement using TOPAZ. Transp. Res. 6, 59\u201368 (1972)","journal-title":"Transp. Res."},{"key":"561_CR34","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1057\/jors.1977.29","volume":"28","author":"AN Elshafei","year":"1977","unstructured":"Elshafei, A.N.: Hospital layout as a quadratic assignment problem. Oper. Res. Q. 28, 167\u2013179 (1977)","journal-title":"Oper. Res. Q."},{"key":"561_CR35","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1287\/opre.24.4.595","volume":"24","author":"AM Geoffrion","year":"1976","unstructured":"Geoffrion, A.M., Graves, G.W.: Scheduling parallel production lines with changeover costs: practical applications of a quadratic assignment\/LP approach. Oper. Res. 24, 595\u2013610 (1976)","journal-title":"Oper. Res."},{"key":"561_CR36","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BFb0120827","volume":"9","author":"J Krarup","year":"1978","unstructured":"Krarup, J., Pruzan, P.M.: Computer-aided layout design. Math. Program. Study 9, 75\u201394 (1978)","journal-title":"Math. Program. Study"},{"issue":"4","key":"561_CR37","first-page":"121","volume":"21","author":"RE Burkard","year":"1977","unstructured":"Burkard, R.E., Offermann, J.: Entwurf von Schreibmaschinentastaturen mittels quadratischer Zuordnungsprobleme. Zeitschrift fur Oper. Res. 21(4), 121\u2013132 (1977). (in German)","journal-title":"Zeitschrift fur Oper. Res."},{"issue":"5","key":"561_CR38","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1287\/opre.37.5.760","volume":"37","author":"N Christofides","year":"1989","unstructured":"Christofides, N., Benavent, E.: An exact algorithm for the quadratic assignment problem. Oper. Res. 37(5), 760\u2013768 (1989)","journal-title":"Oper. Res."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-014-0561-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-014-0561-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-014-0561-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:58:37Z","timestamp":1559469517000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-014-0561-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,8]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["561"],"URL":"https:\/\/doi.org\/10.1007\/s10957-014-0561-3","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,4,8]]}}}