{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T01:23:52Z","timestamp":1773797032950,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,4,24]],"date-time":"2022-04-24T00:00:00Z","timestamp":1650758400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,4,24]],"date-time":"2022-04-24T00:00:00Z","timestamp":1650758400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001691","name":"japan society for the promotion of science","doi-asserted-by":"publisher","award":["20J21961"],"award-info":[{"award-number":["20J21961"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"japan society for the promotion of science","doi-asserted-by":"publisher","award":["17K00032"],"award-info":[{"award-number":["17K00032"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"japan society for the promotion of science","doi-asserted-by":"publisher","award":["19K11840"],"award-info":[{"award-number":["19K11840"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1007\/s11590-022-01877-7","type":"journal-article","created":{"date-parts":[[2022,4,24]],"date-time":"2022-04-24T08:02:36Z","timestamp":1650787356000},"page":"333-350","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["Convergence rates analysis of a multiobjective proximal gradient method"],"prefix":"10.1007","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0042-9221","authenticated-orcid":false,"given":"Hiroki","family":"Tanabe","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8462-152X","authenticated-orcid":false,"given":"Ellen H.","family":"Fukuda","sequence":"additional","affiliation":[]},{"given":"Nobuo","family":"Yamashita","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,4,24]]},"reference":[{"key":"1877_CR1","doi-asserted-by":"crossref","unstructured":"Beck, A.: First-order methods in optimization. Society for Industrial and Applied Mathematics (2017). https:\/\/doi.org\/10.1137\/1.9781611974997","DOI":"10.1137\/1.9781611974997"},{"issue":"1","key":"1877_CR2","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imag. Sci. 2(1), 183\u2013202 (2009). https:\/\/doi.org\/10.1137\/080716542","journal-title":"SIAM J. Imag. Sci."},{"key":"1877_CR3","doi-asserted-by":"publisher","DOI":"10.1080\/02331934.2020.1800699","author":"Y Bello-Cruz","year":"2020","unstructured":"Bello-Cruz, Y., Melo, J.G., Serra, R.V.: A proximal gradient splitting method for solving convex vector optimization problems. Optimization (2020). https:\/\/doi.org\/10.1080\/02331934.2020.1800699","journal-title":"Optimization"},{"key":"1877_CR4","volume-title":"Nonlinear programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear programming, 2nd edn. Athena Scientific, Belmont, Mass (1999)","edition":"2"},{"issue":"7","key":"1877_CR5","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1080\/02331934.2018.1440553","volume":"67","author":"RI Bo\u0163","year":"2018","unstructured":"Bo\u0163, R.I., Grad, S.M.: Inertial forward-backward methods for solving vector optimization problems. Optimization 67(7), 959\u2013974 (2018). https:\/\/doi.org\/10.1080\/02331934.2018.1440553","journal-title":"Optimization"},{"issue":"4","key":"1877_CR6","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1137\/S1052623403429093","volume":"15","author":"H Bonnel","year":"2005","unstructured":"Bonnel, H., Iusem, A.N., Svaiter, B.F.: Proximal methods in vector optimization. SIAM J. Optim. 15(4), 953\u2013970 (2005). https:\/\/doi.org\/10.1137\/S1052623403429093","journal-title":"SIAM J. Optim."},{"key":"1877_CR7","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2020.1719408","author":"L Calder\u00f3n","year":"2020","unstructured":"Calder\u00f3n, L., Diniz-Ehrhardt, M.A., Mart\u00ednez, J.M.: On high-order model regularization for multiobjective optimization. Optim. Methods. Softw. (2020). https:\/\/doi.org\/10.1080\/10556788.2020.1719408","journal-title":"Optim. Methods. Softw."},{"issue":"1\u20132","key":"1877_CR8","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s10107-015-0962-6","volume":"159","author":"GA Carrizo","year":"2016","unstructured":"Carrizo, G.A., Lotito, P.A., Maciel, M.C.: Trust region globalization strategy for the nonconvex unconstrained multiobjective optimization problem. Math. Program. 159(1\u20132), 339\u2013369 (2016). https:\/\/doi.org\/10.1007\/s10107-015-0962-6","journal-title":"Math. Program."},{"issue":"3","key":"1877_CR9","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1137\/10079731X","volume":"21","author":"AL Cust\u00f3dio","year":"2011","unstructured":"Cust\u00f3dio, A.L., Madeira, J.F., Vaz, A.I., Vicente, L.N.: Direct multisearch for multiobjective optimization. SIAM J. Optim. 21(3), 1109\u20131140 (2011). https:\/\/doi.org\/10.1137\/10079731X","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1877_CR10","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1137\/08071692X","volume":"20","author":"J Fliege","year":"2009","unstructured":"Fliege, J., Gra\u00f1a Drummond, L.M., Svaiter, B.F.: Newton\u2019s method for multiobjective optimization. SIAM J. Optim. 20(2), 602\u2013626 (2009). https:\/\/doi.org\/10.1137\/08071692X","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1877_CR11","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/s001860000043","volume":"51","author":"J Fliege","year":"2000","unstructured":"Fliege, J., Svaiter, B.F.: Steepest descent methods for multicriteria optimization. Math. Methods Oper. Res. 51(3), 479\u2013494 (2000). https:\/\/doi.org\/10.1007\/s001860000043","journal-title":"Math. Methods Oper. Res."},{"issue":"5","key":"1877_CR12","doi-asserted-by":"publisher","first-page":"949","DOI":"10.1080\/10556788.2018.1510928","volume":"34","author":"J Fliege","year":"2019","unstructured":"Fliege, J., Vaz, A.I., Vicente, L.N.: Complexity of gradient descent for multiobjective optimization. Optim. Methods. Softw. 34(5), 949\u2013959 (2019). https:\/\/doi.org\/10.1080\/10556788.2018.1510928","journal-title":"Optim. Methods. Softw."},{"issue":"3","key":"1877_CR13","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1590\/0101-7438.2014.034.03.0585","volume":"34","author":"EH Fukuda","year":"2014","unstructured":"Fukuda, E.H., Gra\u00f1a Drummond, L.M.: A survey on multiobjective descemt methods. Pesquisa Operacional 34(3), 585\u2013620 (2014). https:\/\/doi.org\/10.1590\/0101-7438.2014.034.03.0585","journal-title":"Pesquisa Operacional"},{"issue":"8","key":"1877_CR14","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1080\/00207728108963798","volume":"12","author":"M Fukushima","year":"1981","unstructured":"Fukushima, M., Mine, H.: A generalized proximal point algorithm for certain non-convex minimization problems. Int. J. Syst. Sci. 12(8), 989\u20131000 (1981). https:\/\/doi.org\/10.1080\/00207728108963798","journal-title":"Int. J. Syst. Sci."},{"issue":"1","key":"1877_CR15","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/B:COAP.0000018877.86161.8b","volume":"28","author":"LM Gra\u00f1a Drummond","year":"2004","unstructured":"Gra\u00f1a Drummond, L.M., Iusem, A.N.: A projected gradient method for vector optimization problems. Comput. Optim. Appl. 28(1), 5\u201329 (2004). https:\/\/doi.org\/10.1023\/B:COAP.0000018877.86161.8b","journal-title":"Comput. Optim. Appl."},{"issue":"1\u20132","key":"1877_CR16","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s10107-014-0794-9","volume":"152","author":"GN Grapiglia","year":"2015","unstructured":"Grapiglia, G.N., Yuan, J., Yuan, Y.X.: On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization. Math. Program. 152(1\u20132), 491\u2013520 (2015). https:\/\/doi.org\/10.1007\/s10107-014-0794-9","journal-title":"Math. Program."},{"issue":"4","key":"1877_CR17","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1142\/9789812796936_0018","volume":"49","author":"AJ Hoffman","year":"1952","unstructured":"Hoffman, A.J.: On approximate solutions of systems of linear inequalities. J. Res. Natl. Bur. Stand. 49(4), 263\u2013265 (1952). https:\/\/doi.org\/10.1142\/9789812796936_0018","journal-title":"J. Res. Natl. Bur. Stand."},{"key":"1877_CR18","doi-asserted-by":"publisher","unstructured":"Karimi, H., Nutini, J., Schmidt, M.: Linear convergence of gradient and proximal-gradient methods under the Polyak-\u0141ojasiewicz condition. In: P. Frasconi, N. Landwehr, G. Manco, J. Vreeken (eds.) Machine Learning and Knowledge Discovery in Databases, pp. 795\u2013811. Springer International Publishing, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46128-1_50","DOI":"10.1007\/978-3-319-46128-1_50"},{"issue":"3","key":"1877_CR19","doi-asserted-by":"publisher","first-page":"2690","DOI":"10.1137\/17M1126588","volume":"28","author":"LR Lucambio P\u00e9rez","year":"2018","unstructured":"Lucambio P\u00e9rez, L.R., Prudente, L.F.: Nonlinear conjugate gradient methods for vector optimization. SIAM J. Optim. 28(3), 2690\u20132720 (2018). https:\/\/doi.org\/10.1137\/17M1126588","journal-title":"SIAM J. Optim."},{"key":"1877_CR20","doi-asserted-by":"publisher","unstructured":"Nesterov, Y.: Introductory lectures on convex optimization: A basic course. Kluwer Academic Publishers, Dordrecht (2004). https:\/\/doi.org\/10.1007\/978-1-4419-8853-9","DOI":"10.1007\/978-1-4419-8853-9"},{"issue":"4","key":"1877_CR21","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1016\/0041-5553(63)90382-3","volume":"3","author":"B Polyak","year":"1963","unstructured":"Polyak, B.: Gradient methods for minimizing functionals (in Russian). Zh. Vychisl. Mat. Mat. Fiz. 3(4), 643\u2013653 (1963). https:\/\/doi.org\/10.1016\/0041-5553(63)90382-3","journal-title":"Zh. Vychisl. Mat. Mat. Fiz."},{"issue":"1","key":"1877_CR22","doi-asserted-by":"publisher","first-page":"171","DOI":"10.2140\/pjm.1958.8.171","volume":"8","author":"M Sion","year":"1958","unstructured":"Sion, M.: On general minimax theorems. Pacific J. Math. 8(1), 171\u2013176 (1958). https:\/\/doi.org\/10.2140\/pjm.1958.8.171","journal-title":"Pacific J. Math."},{"issue":"2","key":"1877_CR23","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s10589-018-0043-x","volume":"72","author":"H Tanabe","year":"2019","unstructured":"Tanabe, H., Fukuda, E.H., Yamashita, N.: Proximal gradient methods for multiobjective optimization and their applications. Comput. Optim. Appl. 72(2), 339\u2013361 (2019). https:\/\/doi.org\/10.1007\/s10589-018-0043-x","journal-title":"Comput. Optim. Appl."},{"key":"1877_CR24","doi-asserted-by":"crossref","unstructured":"Tanabe, H., Fukuda, E.H., Yamashita, N.: New merit functions for multiobjective optimization and their properties. arXiv: 2010.09333 (2022)","DOI":"10.1080\/02331934.2023.2232794"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01877-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-022-01877-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01877-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,20]],"date-time":"2023-11-20T13:28:40Z","timestamp":1700486920000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-022-01877-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,24]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["1877"],"URL":"https:\/\/doi.org\/10.1007\/s11590-022-01877-7","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4,24]]},"assertion":[{"value":"3 August 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 March 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 April 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}