{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T21:59:37Z","timestamp":1775080777035,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,8,5]],"date-time":"2025-08-05T00:00:00Z","timestamp":1754352000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,5]],"date-time":"2025-08-05T00:00:00Z","timestamp":1754352000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"SERB, India","award":["CRG\/2022\/001347"],"award-info":[{"award-number":["CRG\/2022\/001347"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2025,11]]},"DOI":"10.1007\/s10957-025-02726-0","type":"journal-article","created":{"date-parts":[[2025,8,5]],"date-time":"2025-08-05T05:24:22Z","timestamp":1754371462000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Cubic Regularization Technique of the Newton Method for Vector Optimization"],"prefix":"10.1007","volume":"207","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2419-7082","authenticated-orcid":false,"given":"Debdas","family":"Ghosh","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,5]]},"reference":[{"issue":"2","key":"2726_CR1","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/j.ejor.2020.11.016","volume":"292","author":"C Audet","year":"2021","unstructured":"Audet, C., Bigeon, J., Cartier, D., Digabel, S.L., Salomon, L.: Performance indicators in multiobjective optimization. Eur. J. Oper. Res. 292(2), 397\u2013422 (2021)","journal-title":"Eur. J. Oper. Res."},{"issue":"1\u20132","key":"2726_CR2","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)","journal-title":"Math. Program."},{"key":"2726_CR3","unstructured":"Chen, J., Tang, L., Yang, X.: Descent methods for vector optimization problems: A majorization-minimization perspective. (2024) arXiv:2407.13245"},{"issue":"10","key":"2726_CR4","doi-asserted-by":"publisher","first-page":"1811","DOI":"10.1080\/00036811.2011.640629","volume":"91","author":"TD Chuong","year":"2012","unstructured":"Chuong, T.D., Yao, J.C.: Steepest descent methods for critical points in vector optimization problems. Appl. Anal. 91(10), 1811\u20131829 (2012)","journal-title":"Appl. Anal."},{"issue":"4","key":"2726_CR5","doi-asserted-by":"publisher","first-page":"2169","DOI":"10.1137\/120866415","volume":"23","author":"JB Cruz","year":"2013","unstructured":"Cruz, J.B.: A subgradient method for vector optimization problems. SIAM J. Optim. 23(4), 2169\u20132182 (2013)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2726_CR6","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s10957-020-01781-z","volume":"188","author":"AL Cust\u00f3dio","year":"2021","unstructured":"Cust\u00f3dio, A.L., Diouane, Y., Garmanjani, R., Riccietti, E.: Worst-case complexity bounds of directional direct-search methods for multiobjective optimization. J. Optim. Theory Appl. 188(1), 73\u201393 (2021)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"2726_CR7","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/B:COAP.0000018877.86161.8b","volume":"28","author":"LMG Drummond","year":"2004","unstructured":"Drummond, L.M.G., Iusem, A.N.: A projected gradient method for vector optimization problems. Comput. Optim. Appl. 28(1), 5\u201329 (2004)","journal-title":"Comput. Optim. Appl."},{"issue":"5","key":"2726_CR8","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1080\/02331934.2012.693082","volume":"63","author":"LMG Drummond","year":"2014","unstructured":"Drummond, L.M.G., Raupp, F.M.P., Svaiter, B.F.: A quadratically convergent Newton method for vector optimization. Optimization 63(5), 661\u2013677 (2014)","journal-title":"Optimization"},{"issue":"2","key":"2726_CR9","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.cam.2004.06.018","volume":"175","author":"LMG Drummond","year":"2005","unstructured":"Drummond, L.M.G., Svaiter, B.F.: A steepest descent method for vector optimization. J. Comput. Appl. Math. 175(2), 395\u2013414 (2005)","journal-title":"J. Comput. Appl. Math."},{"issue":"2","key":"2726_CR10","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1137\/08071692X","volume":"20","author":"J Fliege","year":"2009","unstructured":"Fliege, J., Drummond, L.M.G., Svaiter, B.F.: Newton\u2019s method for multiobjective optimization. SIAM J. Optim. 20(2), 602\u2013626 (2009)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"2726_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)","journal-title":"Math. Methods Oper. Res."},{"issue":"5","key":"2726_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.F., Vicente, L.N.: Complexity of gradient descent for multiobjective optimization. Optim. Methods Softw. 34(5), 949\u2013959 (2019)","journal-title":"Optim. Methods Softw."},{"issue":"3","key":"2726_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., Drummond, L.M.G.: A survey on multiobjective descent methods. Pesquisa Operacional 34(3), 585\u2013620 (2014)","journal-title":"Pesquisa Operacional"},{"issue":"5","key":"2726_CR14","doi-asserted-by":"publisher","first-page":"1161","DOI":"10.1007\/s11590-022-01932-3","volume":"17","author":"R Garmanjani","year":"2023","unstructured":"Garmanjani, R.: Complexity bound of trust-region methods for convex smooth unconstrained multiobjective optimization. Optim. Lett. 17(5), 1161\u20131179 (2023)","journal-title":"Optim. Lett."},{"issue":"8","key":"2726_CR15","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(8), 514\u2013521 (2014)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"2726_CR16","first-page":"81","volume":"9","author":"D Ghosh","year":"2025","unstructured":"Ghosh, D., Kishor, N., Zhao, X.: A Newton method for uncertain multiobjective optimization problems with finite uncertainty set. J. Nonlinear Var. Anal. 9(1), 81\u2013110 (2025)","journal-title":"J. Nonlinear Var. Anal."},{"issue":"2","key":"2726_CR17","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s10589-022-00414-7","volume":"83","author":"ML Gon\u00e7alves","year":"2022","unstructured":"Gon\u00e7alves, M.L., Lima, F.S., Prudente, L.F.: Globally convergent Newton-type methods for multiobjective optimization. Comput. Optim. Appl. 83(2), 403\u2013434 (2022)","journal-title":"Comput. Optim. Appl."},{"issue":"5","key":"2726_CR18","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(5), 477\u2013506 (2006)","journal-title":"IEEE Trans. Evolut. Comput."},{"issue":"2","key":"2726_CR19","first-page":"291","volume":"5","author":"K Kumar","year":"2023","unstructured":"Kumar, K., Ghosh, D., Upadhayay, A., Yao, J.C., Zhao, X.: Quasi-Newton methods for multiobjective optimization problems: A systematic review. Appl. Set-Valued Anal. Optim. 5(2), 291\u2013321 (2023)","journal-title":"Appl. Set-Valued Anal. Optim."},{"key":"2726_CR20","doi-asserted-by":"publisher","DOI":"10.1080\/02331934.2024.2390116","author":"K Kumar","year":"2024","unstructured":"Kumar, K., Ghosh, D., Yao, J.C., Zhao, X.: Nonlinear conjugate gradient methods for unconstrained set optimization problems whose objective functions have finite cardinality. Optimization (2024). https:\/\/doi.org\/10.1080\/02331934.2024.2390116","journal-title":"Optimization"},{"key":"2726_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2024.107115","volume":"54","author":"M Lapucci","year":"2024","unstructured":"Lapucci, M.: Convergence and complexity guarantees for a wide class of descent algorithms in nonconvex multi-objective optimization. Oper. Res. Lett. 54, 107115 (2024)","journal-title":"Oper. Res. Lett."},{"issue":"8","key":"2726_CR22","doi-asserted-by":"publisher","first-page":"1567","DOI":"10.1080\/00036811.2013.839781","volume":"93","author":"F Lu","year":"2014","unstructured":"Lu, F., Chen, C.R.: Newton-like methods for solving vector optimization problems. Appl. Anal. 93(8), 1567\u20131586 (2014)","journal-title":"Appl. Anal."},{"issue":"1","key":"2726_CR23","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s10589-023-00510-2","volume":"87","author":"A Mohammadi","year":"2014","unstructured":"Mohammadi, A., Cust\u00f3dio, A.L.: A trust-region approach for computing Pareto fronts in multiobjective optimization. Comput. Optim. Appl. 87(1), 149\u2013179 (2014)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"2726_CR24","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s11590-024-02173-2","volume":"19","author":"A Mohammadi","year":"2025","unstructured":"Mohammadi, A., Hajinezhad, D., Garcia, A.: A trust-region approach for computing Pareto fronts in multiobjective derivative-free optimization. Optim. Lett. 19(2), 233\u2013266 (2025)","journal-title":"Optim. Lett."},{"issue":"1","key":"2726_CR25","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s10107-006-0706-8","volume":"108","author":"Y Nesterov","year":"2006","unstructured":"Nesterov, Y., Polyak, B.T.: Cubic regularization of Newton method and its global performance. Math. Program. 108(1), 177\u2013205 (2006)","journal-title":"Math. Program."},{"issue":"3","key":"2726_CR26","doi-asserted-by":"publisher","first-page":"2690","DOI":"10.1137\/17M1126588","volume":"28","author":"LRL P\u00e9rez","year":"2018","unstructured":"P\u00e9rez, L.R.L., Prudente, L.F.: Nonlinear conjugate gradient methods for vector optimization. SIAM J. Optim. 28(3), 2690\u20132720 (2018)","journal-title":"SIAM J. Optim."},{"issue":"5","key":"2726_CR27","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/j.orl.2011.07.008","volume":"39","author":"S Qu","year":"2011","unstructured":"Qu, S., Goh, M., Chan, F.T.S.: Quasi-Newton methods for solving multiobjective optimization. Oper. Res. Lett. 39(5), 397\u2013399 (2011)","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"2726_CR28","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1080\/10556788.2012.660483","volume":"28","author":"S Qu","year":"2013","unstructured":"Qu, S., Goh, M., Liang, B.: Trust region methods for solving multiobjective optimisation. Optim. Methods Softw. 28(4), 796\u2013811 (2013)","journal-title":"Optim. Methods Softw."},{"issue":"3","key":"2726_CR29","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1007\/s10957-013-0392-7","volume":"160","author":"KD Villacorta","year":"2014","unstructured":"Villacorta, K.D., Oliveira, P.R., Soubeyran, A.: A trust-region method for unconstrained multiobjective problems with applications in satisficing processes. J. Optim. Theory Appl. 160(3), 865\u2013889 (2014)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"2726_CR30","doi-asserted-by":"publisher","first-page":"2388","DOI":"10.1137\/18M1191737","volume":"29","author":"J Wang","year":"2019","unstructured":"Wang, J., Hu, Y., Yu, C.K.W., Li, C., Yang, X.: Extended Newton methods for multiobjective optimization: majorizing function technique and convergence analysis. SIAM J. Optim. 29(3), 2388\u20132421 (2019)","journal-title":"SIAM J. Optim."},{"key":"2726_CR31","doi-asserted-by":"crossref","unstructured":"Wang, Z., Liu, S.: The regularized Newton method for multiobjective optimization. In: 2012 Fifth International Joint Conference on Computational Sciences and Optimization, pp. 394\u2013398, IEEE Xplore, (2012)","DOI":"10.1109\/CSO.2012.94"},{"issue":"4","key":"2726_CR32","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s40314-025-03101-5","volume":"44","author":"J Yahaya","year":"2025","unstructured":"Yahaya, J., Kumam, P.: New hybrid conjugate gradient algorithm for vector optimization problems. Comp. Appl. Math. 44(4), 163 (2025)","journal-title":"Comp. Appl. Math."},{"key":"2726_CR33","doi-asserted-by":"crossref","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 33(1), 102\u2013132 (2025)","DOI":"10.1007\/s11750-024-00680-0"},{"key":"2726_CR34","doi-asserted-by":"crossref","unstructured":"Zhao, X., Raushan, R., Ghosh, D., Yao, J.C., Qi, M.: Proximal gradient method for convex multiobjective optimization problems without Lipschitz continuous gradients. Comput. Optim. Appl. 91(1), 27\u201366 (2025)","DOI":"10.1007\/s10589-025-00663-2"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-025-02726-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-025-02726-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-02726-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T16:16:36Z","timestamp":1757348196000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-025-02726-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,5]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,11]]}},"alternative-id":["2726"],"URL":"https:\/\/doi.org\/10.1007\/s10957-025-02726-0","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,5]]},"assertion":[{"value":"13 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 May 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 August 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 author has no conflict of interest, financial or ethical, to declare.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}},{"value":"There are no human\/animal studies related to the work.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}}],"article-number":"39"}}