{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T21:59:56Z","timestamp":1775080796419,"version":"3.50.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T00:00:00Z","timestamp":1739145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T00:00:00Z","timestamp":1739145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"SERB, India","award":["MTR\/2021\/000696"],"award-info":[{"award-number":["MTR\/2021\/000696"]}]},{"name":"SERB, India","award":["CRG\/2022\/001347"],"award-info":[{"award-number":["CRG\/2022\/001347"]}]},{"name":"Grant MOST","award":["111-2115-M-039-001-MY2"],"award-info":[{"award-number":["111-2115-M-039-001-MY2"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2025,5]]},"DOI":"10.1007\/s10589-025-00663-2","type":"journal-article","created":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T20:16:51Z","timestamp":1739218611000},"page":"27-66","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Proximal gradient method for convex multiobjective optimization problems without Lipschitz continuous gradients"],"prefix":"10.1007","volume":"91","author":[{"given":"Xiaopeng","family":"Zhao","sequence":"first","affiliation":[]},{"given":"Ravi","family":"Raushan","sequence":"additional","affiliation":[]},{"given":"Debdas","family":"Ghosh","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5437-5591","authenticated-orcid":false,"given":"Jen-Chih","family":"Yao","sequence":"additional","affiliation":[]},{"given":"Min","family":"Qi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,10]]},"reference":[{"key":"663_CR1","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1287\/moor.1100.0449","volume":"35","author":"H Attouch","year":"2010","unstructured":"Attouch, H., Bolte, J., Redont, P., Soubeyran, A.: Proximal alternating minimization and projection methods for nonconvex problems: an approach based on the Kurdyka-\u0141ojasiewicz inequality. Math. Oper. Res. 35, 438\u2013457 (2010). https:\/\/doi.org\/10.1287\/moor.1100.0449","journal-title":"Math. Oper. Res."},{"key":"663_CR2","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611974997","volume-title":"First-Order Methods in Optimization. The MOS-SIAM Series on Optimization","author":"A Beck","year":"2017","unstructured":"Beck, A.: First-Order Methods in Optimization. The MOS-SIAM Series on Optimization, vol. 25. SIAM, Philadelphia (2017)"},{"key":"663_CR3","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. Imaging Sci. 2, 183\u2013202 (2009). https:\/\/doi.org\/10.1137\/080716542","journal-title":"SIAM J. Imaging Sci."},{"key":"663_CR4","unstructured":"Bello-Cruz, Y., Melo, J.G., Prudente, L.F., Serra, R.V.G.: A proximal gradient method with an explicit line search for multiobjective optimization. arXiv:2404.10993, (2024)"},{"key":"663_CR5","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1080\/02331934.2020.1800699","volume":"71","author":"Y Bello-Cruz","year":"2022","unstructured":"Bello-Cruz, Y., Melo, J.G., Serra, R.V.G.: A proximal gradient splitting method for solving convex vector optimization problem. Optimization 71, 33\u201353 (2022). https:\/\/doi.org\/10.1080\/02331934.2020.1800699","journal-title":"Optimization"},{"key":"663_CR6","doi-asserted-by":"publisher","first-page":"1209","DOI":"10.1080\/10556788.2016.1214959","volume":"31","author":"JY Bello-Cruz","year":"2016","unstructured":"Bello-Cruz, J.Y., Nghia, T.T.A.: On the convergence of the forward-backward splitting method with linesearches. Optim. Methods Softw. 31, 1209\u20131238 (2016). https:\/\/doi.org\/10.1080\/10556788.2016.1214959","journal-title":"Optim. Methods Softw."},{"key":"663_CR7","doi-asserted-by":"publisher","first-page":"1104","DOI":"10.1137\/16M107534X","volume":"28","author":"GC Bento","year":"2018","unstructured":"Bento, G.C., Cruz Neto, J.X., L\u00f3pez, G., Soubeyran, A., Souza, J.C.O.: The proximal point method for locally Lipschitz functions in multiobjective optimization with application to the compromise problem. SIAM J. Optim. 28, 1104\u20131120 (2018). https:\/\/doi.org\/10.1137\/16M107534X","journal-title":"SIAM J. Optim."},{"key":"663_CR8","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s10107-016-1091-6","volume":"165","author":"J Bolte","year":"2016","unstructured":"Bolte, J., Nguyen, T.P., Peypouquet, J., Suter, B.W.: From error bounds to the complexity of first-order descent methods for convex functions. Math. Program. 165, 471\u2013507 (2016). https:\/\/doi.org\/10.1007\/s10107-016-1091-6","journal-title":"Math. Program."},{"key":"663_CR9","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, 959\u2013974 (2018). https:\/\/doi.org\/10.1080\/02331934.2018.1440553","journal-title":"Optimization."},{"key":"663_CR10","first-page":"809","volume":"20","author":"K Chen","year":"2024","unstructured":"Chen, K., Fukuda, E.H., Yamashita, N.: A proximal gradient method with Bregman distance in multi-objective optimization. Pacific J. Optim. 20, 809\u2013826 (2024)","journal-title":"Pacific J. Optim."},{"key":"663_CR11","unstructured":"Chen, J., Tang, L., Yang, X.: Convergence rates analysis of interior Bregman gradient method for vector optimization problems. arXiv:2206.10070 (2022)"},{"key":"663_CR12","unstructured":"Chen, J., Tang, L., Yang, X.: Barzilai-Borwein proximal gradient methods for multiobjective composite optimization problems with improved linear convergence. arXiv:2306.09797 (2023)"},{"key":"663_CR13","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1109\/JSTSP.2007.910264","volume":"1","author":"PL Combettes","year":"2007","unstructured":"Combettes, P.L., Pesquet, J.-C.: A Douglas\u2013Rachford splitting approach to nonsmooth convex variational signal recovery. IEEE J. Sel. Top. Signal Process. 1, 564\u2013574 (2007). https:\/\/doi.org\/10.1109\/JSTSP.2007.910264","journal-title":"IEEE J. Sel. Top. Signal Process."},{"key":"663_CR14","doi-asserted-by":"publisher","first-page":"1168","DOI":"10.1137\/050626090","volume":"4","author":"PL Combettes","year":"2005","unstructured":"Combettes, P.L., Wajs, V.R.: Signal recovery by proximal forward\u2013backward splitting. Multiscale Model. Simul. 4, 1168\u20131200 (2005). https:\/\/doi.org\/10.1137\/050626090","journal-title":"Multiscale Model. Simul."},{"key":"663_CR15","doi-asserted-by":"publisher","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, 201\u2013213 (2002). https:\/\/doi.org\/10.1007\/s101070100263","journal-title":"Math. Program."},{"key":"663_CR16","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"DL Donoho","year":"2006","unstructured":"Donoho, D.L.: Compressed sensing. IEEE Trans. Inform. Theory 52, 1289\u20131306 (2006). https:\/\/doi.org\/10.1109\/TIT.2006.871582","journal-title":"IEEE Trans. Inform. Theory"},{"key":"663_CR17","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.F., Vicente, L.N.: Complexity of gradient descent for multiobjective optimization. Optim. Methods Softw. 34, 949\u2013959 (2019). https:\/\/doi.org\/10.1080\/10556788.2018.1510928","journal-title":"Optim. Methods Softw."},{"key":"663_CR18","volume-title":"Variational Methods in Partially Ordered Spaces","author":"A G\u00f6pfert","year":"2003","unstructured":"G\u00f6pfert, A., Riahi, H., Tammer, C., Z\u0103linescu, C.: Variational Methods in Partially Ordered Spaces. Springer, Berlin (2003)"},{"key":"663_CR19","volume-title":"Convex Analysis and Minimization Algorithms","author":"J-B Hiriart Urruty","year":"1993","unstructured":"Hiriart Urruty, J.-B., Lemar\u00e8chal, C.: Convex Analysis and Minimization Algorithms. Springer, Berlin (1993)"},{"key":"663_CR20","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1007\/s10898-020-00955-3","volume":"79","author":"YH Hu","year":"2021","unstructured":"Hu, Y.H., Li, C., Meng, K.W., Yang, X.Q.: Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems. J. Global Optim. 79, 853\u2013883 (2021). https:\/\/doi.org\/10.1007\/s10898-020-00955-3","journal-title":"J. Global Optim."},{"key":"663_CR21","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1109\/TEVC.2005.861417","volume":"10","author":"S Huband","year":"2006","unstructured":"Huband, S., Hingston, P., Barone, L., While, L.: A review of multiobjective test problems and a scalable test problem toolkit. IEEE Trans. Evolut. Comput. 10, 477\u2013506 (2006). https:\/\/doi.org\/10.1109\/TEVC.2005.861417","journal-title":"IEEE Trans. Evolut. Comput."},{"key":"663_CR22","volume-title":"Theory of Vector Optimization. Lecture Notes in Economics and Mathematical Systems","author":"DT Luc","year":"1989","unstructured":"Luc, D.T.: Theory of Vector Optimization. Lecture Notes in Economics and Mathematical Systems. Springer, Berlin (1989)"},{"key":"663_CR23","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1137\/140957639","volume":"25","author":"J Mairal","year":"2015","unstructured":"Mairal, J.: Incremental majorization-minimization optimization with application to large-scale machine learning. SIAM J. Optim. 25, 829\u2013855 (2015). https:\/\/doi.org\/10.1137\/140957639","journal-title":"SIAM J. Optim."},{"key":"663_CR24","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s10898-019-00802-0","volume":"75","author":"K Mita","year":"2019","unstructured":"Mita, K., Fukuda, E.H., Yamashita, N.: Nonmonotone line searches for unconstrained multiobjective optimization problems. J. Global Optim. 75, 63\u201390 (2019). https:\/\/doi.org\/10.1007\/s10898-019-00802-0","journal-title":"J. Global Optim."},{"key":"663_CR25","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/s10957-020-01785-9","volume":"188","author":"M El Moudden","year":"2021","unstructured":"El Moudden, M., El Mouatasim, A.: Accelerated diagonal steepest descent method for unconstrained multiobjective optimization. J. Optim. Theory Appl. 188, 220\u2013242 (2021). https:\/\/doi.org\/10.1007\/s10957-020-01785-9","journal-title":"J. Optim. Theory Appl."},{"key":"663_CR26","first-page":"372","volume":"27","author":"Y Nesterov","year":"1983","unstructured":"Nesterov, Y.: A method of solving a convex programming problem with convergence rate O($$1\/k^2$$). Soviet Math. Dokl. 27, 372\u2013376 (1983)","journal-title":"Soviet Math. Dokl."},{"key":"663_CR27","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization","author":"Y Nesterov","year":"2004","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization. Kluwer Academic Publishers, Dordrecht (2004)"},{"key":"663_CR28","doi-asserted-by":"publisher","first-page":"1445","DOI":"10.1007\/s10479-020-03622-8","volume":"316","author":"EA Papa Quiroz","year":"2022","unstructured":"Papa Quiroz, E.A., Cruzado, S.: An inexact scalarization proximal point method for multiobjective quasiconvex minimization. Ann. Oper. Res. 316, 1445\u20131470 (2022). https:\/\/doi.org\/10.1007\/s10479-020-03622-8","journal-title":"Ann. Oper. Res."},{"key":"663_CR29","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Priceton University Press, Priceton (1970)"},{"key":"663_CR30","first-page":"57","volume":"49","author":"D Schott","year":"1995","unstructured":"Schott, D.: Basic properties of Fej\u00e9r monotone sequences. Rostock. Math. Kolloq. 49, 57\u201374 (1995)","journal-title":"Rostock. Math. Kolloq."},{"key":"663_CR31","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, 339\u2013361 (2019). https:\/\/doi.org\/10.1007\/s10589-018-0043-x","journal-title":"Comput. Optim. Appl."},{"key":"663_CR32","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s11590-022-01877-7","volume":"17","author":"H Tanabe","year":"2023","unstructured":"Tanabe, H., Fukuda, E.H., Yamashita, N.: Convergence rates analysis of a multiobjective proximal gradient method. Optim. Lett. 17, 333\u2013350 (2023). https:\/\/doi.org\/10.1007\/s11590-022-01877-7","journal-title":"Optim. Lett."},{"key":"663_CR33","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/s10589-023-00497-w","volume":"86","author":"H Tanabe","year":"2023","unstructured":"Tanabe, H., Fukuda, E.H., Yamashita, N.: An accelerated proximal gradient method for multiobjective optimization. Comput. Optim. Appl. 86, 421\u2013455 (2023). https:\/\/doi.org\/10.1007\/s10589-023-00497-w","journal-title":"Comput. Optim. Appl."},{"key":"663_CR34","doi-asserted-by":"crossref","unstructured":"Tanabe, H., Fukuda, E.H., Yamashita, N.: New merit functions for multiobjective optimization and their properties. Optimization 73, 3821\u20133858 (2024). https:\/\/doi.org\/10.1080\/02331934.2023.2232794","DOI":"10.1080\/02331934.2023.2232794"},{"key":"663_CR35","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"1996","unstructured":"Tibshirani, R.: Regression shrinkage and selection via the Lasso. J. R. Stat. Soc. B. 58, 267\u2013288 (1996). https:\/\/doi.org\/10.1111\/j.2517-6161.1996.tb02080.x","journal-title":"J. R. Stat. Soc. B."},{"key":"663_CR36","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s10107-010-0394-2","volume":"125","author":"P Tseng","year":"2010","unstructured":"Tseng, P.: Approximation accuracy, gradient methods, and error bound for structured convex optimization. Math. Program. 125, 263\u2013295 (2010). https:\/\/doi.org\/10.1007\/s10107-010-0394-2","journal-title":"Math. Program."},{"key":"663_CR37","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/s10957-021-01872-5","volume":"190","author":"XP Zhao","year":"2021","unstructured":"Zhao, X.P., K\u00f6bis, M.A., Yao, Y.H., Yao, J.C.: A projected subgradient method for nondifferentiable quasiconvex multiobjective optimization problems. J. Optim. Theory Appl. 190, 82\u2013107 (2021). https:\/\/doi.org\/10.1007\/s10957-021-01872-5","journal-title":"J. Optim. Theory Appl."},{"key":"663_CR38","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/s10898-021-01084-1","volume":"82","author":"XP Zhao","year":"2022","unstructured":"Zhao, X.P., Yao, J.C.: Linear convergence of a nonmonotone projected gradient method for multiobjective optimization. J. Global Optim. 82, 577\u2013594 (2022). https:\/\/doi.org\/10.1007\/s10898-021-01084-1","journal-title":"J. Global Optim."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-025-00663-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-025-00663-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-025-00663-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:32:37Z","timestamp":1742959957000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-025-00663-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,10]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,5]]}},"alternative-id":["663"],"URL":"https:\/\/doi.org\/10.1007\/s10589-025-00663-2","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,10]]},"assertion":[{"value":"4 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 January 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 February 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}