{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T23:15:25Z","timestamp":1771024525572,"version":"3.50.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:00:00Z","timestamp":1750291200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:00:00Z","timestamp":1750291200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"National Key Research and Development Project of China","award":["2022YFB4300502"],"award-info":[{"award-number":["2022YFB4300502"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s10957-025-02750-0","type":"journal-article","created":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T08:08:09Z","timestamp":1750320489000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Accelerating Level-Value Adjustment for the Polyak Stepsize"],"prefix":"10.1007","volume":"206","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5827-4368","authenticated-orcid":false,"given":"Anbang","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikhail A.","family":"Bragin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xi","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaohong","family":"Guan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,19]]},"reference":[{"issue":"11","key":"2750_CR1","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"JE Beasley","year":"1990","unstructured":"Beasley, J.E.: OR-library: distributing test problems by electronic mail. J. Oper. Res. Soc. 41(11), 1069\u20131072 (1990). https:\/\/doi.org\/10.1057\/jors.1990.166","journal-title":"J. Oper. Res. Soc."},{"key":"2750_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"SP Boyd","year":"2004","unstructured":"Boyd, S.P., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004). https:\/\/doi.org\/10.1017\/CBO9780511804441"},{"issue":"1","key":"2750_CR3","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s10957-014-0561-3","volume":"164","author":"MA Bragin","year":"2015","unstructured":"Bragin, M.A., Luh, P.B., Yan, J.H., Yu, N., Stern, G.A.: Convergence of the surrogate Lagrangian relaxation method. J. Optim. Theory Appl. 164(1), 173\u2013201 (2015). https:\/\/doi.org\/10.1007\/s10957-014-0561-3","journal-title":"J. Optim. Theory Appl."},{"key":"2750_CR4","doi-asserted-by":"publisher","first-page":"22417","DOI":"10.1038\/s41598-022-26264-1","volume":"12","author":"MA Bragin","year":"2022","unstructured":"Bragin, M.A., Tucker, E.L.: Surrogate \u201clevel-based\u2019\u2019 Lagrangian relaxation for mixed-integer linear programming. Sci. Rep. 12, 22417 (2022). https:\/\/doi.org\/10.1038\/s41598-022-26264-1","journal-title":"Sci. Rep."},{"key":"2750_CR5","doi-asserted-by":"publisher","unstructured":"Caruana, R., Niculescu-Mizil, A.: An empirical comparison of supervised learning algorithms. In: 23rd International Conference on Machine Learning (ICML), pp. 161\u2013168 (2006). https:\/\/doi.org\/10.1145\/1143844.1143865","DOI":"10.1145\/1143844.1143865"},{"issue":"3","key":"2750_CR6","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/0377-2217(92)90077-M","volume":"60","author":"DG Cattrysse","year":"1992","unstructured":"Cattrysse, D.G., Van Wassenhove, L.N.: A survey of algorithms for the generalized assignment problem. Eur. J. Oper. Res. 60(3), 260\u2013272 (1992). https:\/\/doi.org\/10.1016\/0377-2217(92)90077-M","journal-title":"Eur. J. Oper. Res."},{"issue":"8","key":"2750_CR7","doi-asserted-by":"publisher","first-page":"2143","DOI":"10.1080\/00207540600818286","volume":"46","author":"L Deroussi","year":"2008","unstructured":"Deroussi, L., Gourgand, M., Tchernev, N.: A simple metaheuristic approach to the simultaneous scheduling of machines and automated guided vehicles. Int. J. Prod. Res. 46(8), 2143\u20132164 (2008). https:\/\/doi.org\/10.1080\/00207540600818286","journal-title":"Int. J. Prod. Res."},{"key":"2750_CR8","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/BF01584346","volume":"13","author":"JL Goffin","year":"1977","unstructured":"Goffin, J.L.: On convergence rates of subgradient optimization methods. Math. Program. 13, 329\u2013347 (1977). https:\/\/doi.org\/10.1007\/BF01584346","journal-title":"Math. Program."},{"key":"2750_CR9","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s101070050053","volume":"85","author":"JL Goffin","year":"1999","unstructured":"Goffin, J.L., Kiwiel, K.C.: Convergence of a simple subgradient level method. Math. Program. 85, 207\u2013211 (1999). https:\/\/doi.org\/10.1007\/s101070050053","journal-title":"Math. Program."},{"issue":"2","key":"2750_CR10","doi-asserted-by":"publisher","first-page":"3130","DOI":"10.1109\/TPWRS.2023.3287199","volume":"39","author":"J Hou","year":"2023","unstructured":"Hou, J., Zhai, Q., Zhou, Y., Guan, X.: A fast solution method for large-scale unit commitment based on Lagrangian relaxation and dynamic programming. IEEE Trans. Power Syst. 39(2), 3130\u20133140 (2023). https:\/\/doi.org\/10.1109\/TPWRS.2023.3287199","journal-title":"IEEE Trans. Power Syst."},{"issue":"2","key":"2750_CR11","doi-asserted-by":"publisher","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-theory and applications. Eur. J. Oper. Res. 88(2), 382\u2013403 (1996). https:\/\/doi.org\/10.1016\/0377-2217(94)00200-2","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"2750_CR12","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1287\/opre.1110.1007","volume":"60","author":"E Lim","year":"2012","unstructured":"Lim, E., Glynn, P.W.: Consistency of multidimensional convex regression. Oper. Res. 60(1), 196\u2013208 (2012). https:\/\/doi.org\/10.1287\/opre.1110.1007","journal-title":"Oper. Res."},{"issue":"4","key":"2750_CR13","doi-asserted-by":"publisher","first-page":"5051","DOI":"10.1109\/LRA.2020.3005125","volume":"5","author":"A Liu","year":"2020","unstructured":"Liu, A., Luh, P.B., Bragin, M.A., Yan, B.: Ordinal-optimization concept enabled decomposition and coordination of mixed-integer linear programming problems. IEEE Robot. Autom. Lett. 5(4), 5051\u20135058 (2020). https:\/\/doi.org\/10.1109\/LRA.2020.3005125","journal-title":"IEEE Robot. Autom. Lett."},{"issue":"3","key":"2750_CR14","doi-asserted-by":"publisher","first-page":"4829","DOI":"10.1109\/TASE.2023.3303175","volume":"21","author":"A Liu","year":"2024","unstructured":"Liu, A., Luh, P.B., Sun, K., Bragin, M.A., Yan, B.: Integrating machine learning and mathematical optimization for job shop scheduling. IEEE Trans. Autom. Sci. Eng. 21(3), 4829\u20134850 (2024). https:\/\/doi.org\/10.1109\/TASE.2023.3303175","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"issue":"6","key":"2750_CR15","doi-asserted-by":"publisher","first-page":"1291","DOI":"10.1109\/TAC.2010.2091295","volume":"56","author":"I Lobel","year":"2010","unstructured":"Lobel, I., Ozdaglar, A.: Distributed subgradient methods for convex optimization over random networks. IEEE Trans. Autom. Control 56(6), 1291\u20131306 (2010). https:\/\/doi.org\/10.1109\/TAC.2010.2091295","journal-title":"IEEE Trans. Autom. Control"},{"issue":"1","key":"2750_CR16","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1137\/S1052623499362111","volume":"12","author":"A Nedic","year":"2001","unstructured":"Nedic, A., Bertsekas, D.P.: Incremental subgradient methods for nondifferentiable optimization. SIAM J. Optim. 12(1), 109\u2013138 (2001). https:\/\/doi.org\/10.1137\/S1052623499362111","journal-title":"SIAM J. Optim."},{"key":"2750_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91578-4","volume-title":"Lectures on Convex Optimization","author":"Y Nesterov","year":"2018","unstructured":"Nesterov, Y.: Lectures on Convex Optimization. Springer, Berlin (2018). https:\/\/doi.org\/10.1007\/978-3-319-91578-4"},{"issue":"18","key":"2750_CR18","doi-asserted-by":"publisher","first-page":"3920","DOI":"10.1049\/iet-gtd.2020.0410","volume":"14","author":"P Nikolaidis","year":"2020","unstructured":"Nikolaidis, P., Poullikkas, A.: Enhanced Lagrange relaxation for the optimal unit commitment of identical generating units. IET Gener. Transm. Distrib. 14(18), 3920\u20133928 (2020). https:\/\/doi.org\/10.1049\/iet-gtd.2020.0410","journal-title":"IET Gener. Transm. Distrib."},{"key":"2750_CR19","unstructured":"Orvieto, A., Lacoste-Julien, S., Loizou, N.: Dynamics of SGD with stochastic Polyak stepsizes: truly adaptive variants and convergence to exact solution. In: 36th International Conference on Neural Information Processing Systems (2022)"},{"issue":"2","key":"2750_CR20","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1080\/10618600.2000.10474883","volume":"9","author":"MR Osborne","year":"2000","unstructured":"Osborne, M.R., Presnell, B., Turlach, B.A.: On the lasso and its dual. J. Comput. Graph. Stat. 9(2), 319\u2013337 (2000). https:\/\/doi.org\/10.1080\/10618600.2000.10474883","journal-title":"J. Comput. Graph. Stat."},{"key":"2750_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-05921-6","volume-title":"Scheduling","author":"ML Pinedo","year":"2022","unstructured":"Pinedo, M.L.: Scheduling. Springer, New York (2022). https:\/\/doi.org\/10.1007\/978-3-031-05921-6"},{"key":"2750_CR22","doi-asserted-by":"publisher","unstructured":"Pisner, D.A., Schnyer, D.M.: Support vector machine. In: Machine Learning, pp. 101\u2013121, Academic Press (2020). https:\/\/doi.org\/10.1016\/B978-0-12-815739-8.00006-7","DOI":"10.1016\/B978-0-12-815739-8.00006-7"},{"issue":"3","key":"2750_CR23","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1016\/0041-5553(69)90061-5","journal-title":"USSR Comput. Math. & Math. Phys."},{"key":"2750_CR24","unstructured":"Polyak, B.T.: Subgradient methods: a survey of Soviet research. In: Nonsmooth Optimization (Proc. IIASA Workshop, Laxenburg, 1977), IIASA Proc. Ser., vol. 3, pp. 5\u201329. Pergamon, Oxford (1978)"},{"issue":"2","key":"2750_CR25","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1137\/080726380","volume":"20","author":"SS Ram","year":"2009","unstructured":"Ram, S.S., Nedi\u0107, A., Veeravalli, V.V.: Incremental stochastic subgradient algorithms for convex optimization. SIAM J. Optim. 20(2), 691\u2013717 (2009). https:\/\/doi.org\/10.1137\/080726380","journal-title":"SIAM J. Optim."},{"key":"2750_CR26","unstructured":"Razaviyayn, M., Hong, M., Luo, Z.Q., Pang, J.S.: Parallel successive convex approximation for nonsmooth nonconvex optimization. In: 28th International Conference on Neural Information Processing Systems (2014)"},{"issue":"3","key":"2750_CR27","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/s10957-007-9238-5","volume":"133","author":"T Sun","year":"2007","unstructured":"Sun, T., Zhao, Q., Luh, P.: On the surrogate gradient algorithm for Lagrangian relaxation. J. Optim. Theory Appl 133(3), 413\u2013416 (2007). https:\/\/doi.org\/10.1007\/s10957-007-9238-5","journal-title":"J. Optim. Theory Appl"},{"issue":"7","key":"2750_CR28","doi-asserted-by":"publisher","first-page":"1713","DOI":"10.1016\/j.cor.2011.10.007","volume":"39","author":"Q Zhang","year":"2012","unstructured":"Zhang, Q., Manier, H., Manier, M.A.: A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times. Comput. Oper. Res. 39(7), 1713\u20131723 (2012). https:\/\/doi.org\/10.1016\/j.cor.2011.10.007","journal-title":"Comput. Oper. Res."},{"issue":"6","key":"2750_CR29","doi-asserted-by":"publisher","first-page":"3830","DOI":"10.1109\/TAC.2022.3201026","volume":"68","author":"Z Zhang","year":"2023","unstructured":"Zhang, Z., Zhao, Q., Dai, F.A.: A warm-start strategy in interior point methods for shrinking horizon model predictive control with variable discretization step. IEEE Trans. Autom. Control 68(6), 3830\u20133837 (2023). https:\/\/doi.org\/10.1109\/TAC.2022.3201026","journal-title":"IEEE Trans. Autom. Control"},{"issue":"3","key":"2750_CR30","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1023\/A:1022646725208","journal-title":"J. Optim. Theory Appl"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-025-02750-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-025-02750-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-025-02750-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,18]],"date-time":"2025-07-18T08:56:15Z","timestamp":1752828975000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-025-02750-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,19]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["2750"],"URL":"https:\/\/doi.org\/10.1007\/s10957-025-02750-0","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,19]]},"assertion":[{"value":"22 November 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 June 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 June 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"71"}}