{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,10]],"date-time":"2025-05-10T04:01:43Z","timestamp":1746849703851,"version":"3.40.5"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,4,16]],"date-time":"2025-04-16T00:00:00Z","timestamp":1744761600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,4,16]],"date-time":"2025-04-16T00:00:00Z","timestamp":1744761600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12271071, 11991024"],"award-info":[{"award-number":["12271071, 11991024"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Basic and Advanced Research Project of Chongqing","award":["cstc2021jcyj-msxmX0300"],"award-info":[{"award-number":["cstc2021jcyj-msxmX0300"]}]},{"name":"Team Project of Innovation Leading Talent in Chongqing","award":["CQYC20210309536"],"award-info":[{"award-number":["CQYC20210309536"]}]},{"name":"Chongqing Talent Plan contract system project","award":["cstc2022ycjh-bgzxm0147"],"award-info":[{"award-number":["cstc2022ycjh-bgzxm0147"]}]},{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["12071379, 12471299"],"award-info":[{"award-number":["12071379, 12471299"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2025,6]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>In this paper, we introduce proximal gradient methods with non-monotone Armijo line search rule of both kinds, max-type and average-type, to solve composite multiobjective optimization problems (CMOP). Moreover, the convergence analysis is given, and we show that all accumulation points of a sequence generated by both of the two kinds of nonmonotone proximal gradient methods are Pareto stationary points of (CMOP). Finally, we present numerical experiments illustrating the practical performance of these methods<\/jats:p>","DOI":"10.1007\/s10957-025-02667-8","type":"journal-article","created":{"date-parts":[[2025,4,16]],"date-time":"2025-04-16T14:20:12Z","timestamp":1744813212000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Nonmonotone Proximal Gradient Method for Composite Multiobjective Optimization Problems"],"prefix":"10.1007","volume":"205","author":[{"given":"Jian-Wen","family":"Peng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hua","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3842-4522","authenticated-orcid":false,"given":"Elisabeth","family":"K\u00f6bis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,4,16]]},"reference":[{"key":"2667_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/10556788.2022.2157000","volume":"38","author":"MAT Ansary","year":"2023","unstructured":"Ansary, M.A.T.: A Newton-type proximal gradient method for nonlinear multi-objective optimization problems. Optim. Methods Softw. 38, 1\u201321 (2023)","journal-title":"Optim. Methods Softw."},{"key":"2667_CR2","doi-asserted-by":"publisher","first-page":"2289","DOI":"10.1080\/02331934.2014.947500","volume":"64","author":"MAT Ansary","year":"2015","unstructured":"Ansary, M.A.T., Panda, G.: A modified quasi-Newton method for vector optimization problem. Optimization 64, 2289\u20132306 (2015)","journal-title":"Optimization"},{"key":"2667_CR3","first-page":"625","volume":"8","author":"Y Bai","year":"2024","unstructured":"Bai, Y., Chen, J., Tang, L., Zhang, T.: Convergence of a new nonmonotone memory gradient method for unconstrained multiobjective optimization via robust approach. J. Nonlinear Var. Anal. 8, 625\u2013639 (2024)","journal-title":"J. Nonlinear Var. Anal."},{"key":"2667_CR4","volume-title":"Convex Analysis and Optimization","author":"DP Bertsekas","year":"2009","unstructured":"Bertsekas, D.P.: Convex Analysis and Optimization. Athena Scientific, Belmont, Massachusetts (2009)"},{"key":"2667_CR5","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, 953\u2013970 (2005)","journal-title":"SIAM J. Optim."},{"key":"2667_CR6","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)","journal-title":"Optimization"},{"key":"2667_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0120945","volume":"16","author":"R Chamberlain","year":"1982","unstructured":"Chamberlain, R., Powell, M., Lemarechal, C., Pedersen, H.: The watchdog technique for forcing convergence in algorithms for constrained optimization. Algorithms for constrained minimization of smooth nonlinear functions 16, 1\u201317 (1982)","journal-title":"Algorithms for constrained minimization of smooth nonlinear functions"},{"key":"2667_CR8","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1137\/0803026","volume":"3","author":"G Chen","year":"1993","unstructured":"Chen, G., Teboulle, M.: Convergence analysis of a proximal-like minimization algorithm using Bregman functions. SIAM J. Optim. 3, 538\u2013543 (1993)","journal-title":"SIAM J. Optim."},{"key":"2667_CR9","doi-asserted-by":"publisher","first-page":"5268","DOI":"10.1016\/j.na.2011.04.067","volume":"74","author":"JB Cruz","year":"2011","unstructured":"Cruz, J.B., P\u00e9rez, L.L., Melo, J.: Convergence of the projected gradient method for quasiconvex multiobjective optimization. Nonlinear Anal. Theory Methods Appl. 74, 5268\u20135273 (2011)","journal-title":"Nonlinear Anal. Theory Methods Appl."},{"key":"2667_CR10","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s10589-012-9494-7","volume":"54","author":"JX Da Cruz Neto","year":"2013","unstructured":"Da Cruz Neto, J.X., Da Silva, G.J.P., Ferreira, O.P., Lopes, J.O.: A subgradient method for multiobjective optimization. Comput. Optim. Appl. 54, 461\u2013472 (2013)","journal-title":"Comput. Optim. Appl."},{"key":"2667_CR11","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)","journal-title":"Math. Program."},{"key":"2667_CR12","volume-title":"Multicriteria Optimization","author":"M Ehrgott","year":"2005","unstructured":"Ehrgott, M.: Multicriteria Optimization. Springer, Cham (2005)"},{"key":"2667_CR13","doi-asserted-by":"crossref","unstructured":"Eichfelder, G.: An adaptive scalarization method in multiobjective optimization. SIAM J. Optim. 19 1694-1718 (2009)","DOI":"10.1137\/060672029"},{"key":"2667_CR14","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1137\/08071692X","volume":"20","author":"J Fliege","year":"2009","unstructured":"Fliege, J., Drummond, L.G., Svaiter, B.F.: Newton\u2019s method for multiobjective optimization. SIAM J. Optim. 20, 602\u2013626 (2009)","journal-title":"SIAM J. Optim."},{"key":"2667_CR15","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, 479\u2013494 (2000)","journal-title":"Math. Methods Oper. Res."},{"key":"2667_CR16","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., Drummond, L.M.G.: A survey on multiobjective descent methods. Pesq. Oper. 34, 585\u2013620 (2014)","journal-title":"Pesq. Oper."},{"key":"2667_CR17","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1016\/j.orl.2014.08.011","volume":"42","author":"D Ghosh","year":"2014","unstructured":"Ghosh, D., Chakraborty, D.: A new Pareto set generating method for multi-criteria optimization problems. Oper. Res. Lett. 42, 514\u2013521 (2014)","journal-title":"Oper. Res. Lett."},{"key":"2667_CR18","doi-asserted-by":"publisher","first-page":"106236","DOI":"10.1016\/j.cor.2023.106236","volume":"155","author":"D Ghosh","year":"2023","unstructured":"Ghosh, D., Ansari, Q.H., Ehrgott, M., Upadhayay, A.: An infeasible interior-point technique to generate the nondominated set for multiobjective optimization problems. Comput. Op. Res. 155, 106236 (2023)","journal-title":"Comput. Op. Res."},{"key":"2667_CR19","first-page":"707","volume":"23","author":"L Grippo","year":"1986","unstructured":"Grippo, L., Lampariello, F., Lucidi, S.: A nonmonotone line search technique for Newton\u2019s method. SIAM J. Optim. 23, 707\u2013716 (1986)","journal-title":"SIAM J. Optim."},{"key":"2667_CR20","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1023\/A:1017536311488","volume":"110","author":"C Hillermeier","year":"2001","unstructured":"Hillermeier, C.: Generalized homotopy approach to multiobjective optimization. J. Optim. Theory Appl. 110, 557\u2013583 (2001)","journal-title":"J. Optim. Theory Appl."},{"key":"2667_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. Evol. 10, 477\u2013506 (2006)","journal-title":"IEEE Trans. Evol."},{"key":"2667_CR22","unstructured":"Jin, Y., Olhofer, M., Sendhoff, B.: Dynamic weighted aggregation for evolutionary multi-objective optimization: Why does it work and how. GECCO. 1042\u20131049 (2001)"},{"key":"2667_CR23","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1137\/100784746","volume":"21","author":"A Lovison","year":"2011","unstructured":"Lovison, A.: Singular continuation: generating piecewise linear approximations to Pareto sets via global analysis. SIAM J. Optim. 21, 463\u2013490 (2011)","journal-title":"SIAM J. Optim."},{"key":"2667_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3342104","volume":"45","author":"LR Lucambio P\u00e9rez","year":"2019","unstructured":"Lucambio P\u00e9rez, L.R., Prudente, L.F.: A Wolfe line search algorithm for vector optimization. ACM Trans. Math. Softw. 45, 1\u201323 (2019)","journal-title":"ACM Trans. Math. Softw."},{"key":"2667_CR25","doi-asserted-by":"publisher","first-page":"1223","DOI":"10.1080\/10556788.2020.1737691","volume":"35","author":"N. Salehi Mahdavi-Amiri","year":"2020","unstructured":"Mahdavi-Amiri, N. Salehi., Sadaghiani, F.: A superlinearly convergent nonmonotone quasi-Newton method for unconstrained multiobjective optimization. Optim Methods Softw. 35, 1223\u20131247 (2020)","journal-title":"Optim Methods Softw."},{"key":"2667_CR26","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)","journal-title":"J. Global Optim."},{"key":"2667_CR27","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/355934.355936","volume":"7","author":"JJ Mor\u00e9","year":"1981","unstructured":"Mor\u00e9, J.J., Garbow, B.S., Hillstrom, K.E.: Testing unconstrained optimization software. ACM Trans Math Softw. 7, 17\u201341 (1981)","journal-title":"ACM Trans Math Softw."},{"key":"2667_CR28","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s10288-017-0363-1","volume":"16","author":"V Morovati","year":"2018","unstructured":"Morovati, V., Basirzadeh, H., Pourkarimi, L.: Quasi-Newton methods for multiobjective optimization problems. 4OR 16, 261\u2013294 (2018)","journal-title":"4OR"},{"key":"2667_CR29","doi-asserted-by":"crossref","unstructured":"Nakayama, H., Yun, Y., Yoon, M.: Sequential approximate multiobjective optimization using computational intelligence. Springer (2009)","DOI":"10.1007\/978-3-540-88910-6_5"},{"key":"2667_CR30","first-page":"207","volume":"25","author":"JW Peng","year":"2024","unstructured":"Peng, J.W., Ren, J., Yao, J.C.: Proximal quasi-Newton methods for multiobjective optimization problems. J. Nonlinear Convex A. 25, 207\u2013221 (2024)","journal-title":"J. Nonlinear Convex A."},{"key":"2667_CR31","first-page":"2557","volume":"25","author":"JW Peng","year":"2025","unstructured":"Peng, J.W., Zhang, X.Q., Zhang, T.: The quasi-Newton method for the composite multiobjective optimization problems. J. Nonlinear Convex A. 25, 2557\u20132569 (2025)","journal-title":"J. Nonlinear Convex A."},{"key":"2667_CR32","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1016\/j.cam.2013.06.045","volume":"255","author":"\u017d Povalej","year":"2014","unstructured":"Povalej, \u017d: Quasi-Newton\u2019s method for multiobjective optimization. J. Comput. Appl. Math. 255, 765\u2013777 (2014)","journal-title":"J. Comput. Appl. Math."},{"key":"2667_CR33","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1016\/j.ejor.2017.05.027","volume":"263","author":"S Qu","year":"2017","unstructured":"Qu, S., Ji, Y., Jiang, J., Zhang, Q.: Nonmonotone gradient methods for vector optimization with a portfolio optimization application. Eur. J. Oper. Res. 263, 356\u2013366 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"2667_CR34","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1997","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton, , New Jersey (1997)"},{"key":"2667_CR35","doi-asserted-by":"publisher","first-page":"20326","DOI":"10.1038\/s41598-021-99617-x","volume":"11","author":"MR Sharifi","year":"2021","unstructured":"Sharifi, M.R., Akbarifard, S., Qaderi, K., et al.: A new optimization algorithm to solve multi-objective problems. Sci. Rep. 11, 20326 (2021)","journal-title":"Sci. Rep."},{"key":"2667_CR36","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)","journal-title":"Comput. Optim. Appl."},{"key":"2667_CR37","doi-asserted-by":"crossref","unstructured":"Upadhayay, A., Ghosh, D., Ansari, Q.H., Jauny,: Augmented Lagrangian cone method for multiobjective optimization problems with an application to an optimal control problem. Optimization and Engineering 24, 1633\u20131665 (2023)","DOI":"10.1007\/s11081-022-09747-y"},{"key":"2667_CR38","doi-asserted-by":"publisher","first-page":"9609","DOI":"10.1007\/s00500-024-09806-9","volume":"28","author":"A Upadhayay","year":"2024","unstructured":"Upadhayay, A., Ghosh, D., Jauny, J., Yao, J.C., Zhao, X.: A nonmonotone conditional gradient method for multiobjective optimization problems. Soft Comput. 28, 9609\u20139630 (2024)","journal-title":"Soft Comput."},{"key":"2667_CR39","doi-asserted-by":"publisher","first-page":"1043","DOI":"10.1137\/S1052623403428208","volume":"14","author":"H Zhang","year":"2004","unstructured":"Zhang, H., Hager, W.W.: A nonmonotone line search technique and its application to unconstrained optimization. SIAM J. Optim. 14, 1043\u20131056 (2004)","journal-title":"SIAM J. Optim."},{"key":"2667_CR40","doi-asserted-by":"publisher","DOI":"10.1007\/s11750-024-00680-0","author":"X Zhao","year":"2024","unstructured":"Zhao, X., Ghosh, D., Qin, X., Tammer, C., Yao, J.C.: On the convergence analysis of a proximal gradient method for multiobjective optimization. TOP (2024). https:\/\/doi.org\/10.1007\/s11750-024-00680-0","journal-title":"TOP"},{"key":"2667_CR41","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s11117-024-01057-0","volume":"28","author":"X Zhao","year":"2024","unstructured":"Zhao, X., Ji, H., Ghosh, D., Yao, J.C.: An inexact proximal point method with quasi-distance for quasi-convex multiobjective optimization. Positivity 28, 43 (2024)","journal-title":"Positivity"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-025-02667-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-025-02667-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-025-02667-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,9]],"date-time":"2025-05-09T06:02:29Z","timestamp":1746770549000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-025-02667-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,16]]},"references-count":41,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["2667"],"URL":"https:\/\/doi.org\/10.1007\/s10957-025-02667-8","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"type":"print","value":"0022-3239"},{"type":"electronic","value":"1573-2878"}],"subject":[],"published":{"date-parts":[[2025,4,16]]},"assertion":[{"value":"7 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 March 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 April 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"48"}}