{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,31]],"date-time":"2025-08-31T23:29:44Z","timestamp":1756682984790,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,10,5]],"date-time":"2022-10-05T00:00:00Z","timestamp":1664928000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,10,5]],"date-time":"2022-10-05T00:00:00Z","timestamp":1664928000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001871","name":"funda\u00e7\u00e3o para a ci\u00eancia e a tecnologia","doi-asserted-by":"publisher","award":["PTDC\/MAT-APL\/28400\/2017","UIDP\/MAT\/00297\/2020"],"award-info":[{"award-number":["PTDC\/MAT-APL\/28400\/2017","UIDP\/MAT\/00297\/2020"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001871","name":"funda\u00e7\u00e3o para a ci\u00eancia e a tecnologia","doi-asserted-by":"publisher","award":["UIDB\/MAT\/00297\/2020"],"award-info":[{"award-number":["UIDB\/MAT\/00297\/2020"]}],"id":[{"id":"10.13039\/501100001871","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,6]]},"DOI":"10.1007\/s11590-022-01932-3","type":"journal-article","created":{"date-parts":[[2022,10,5]],"date-time":"2022-10-05T12:05:43Z","timestamp":1664971543000},"page":"1161-1179","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Complexity bound of trust-region methods for convex smooth unconstrained multiobjective optimization"],"prefix":"10.1007","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6597-9123","authenticated-orcid":false,"given":"R.","family":"Garmanjani","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,5]]},"reference":[{"key":"1932_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-79159-1","volume-title":"Adaptive Scalarization Methods in Multiobjective Optimization","author":"G Eichfelder","year":"2008","unstructured":"Eichfelder, G.: Adaptive Scalarization Methods in Multiobjective Optimization. Springer-Verlag, Berlin Heidelberg (2008)"},{"key":"1932_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17005-8","volume-title":"Vector Optimization","author":"J Jahn","year":"2011","unstructured":"Jahn, J.: Vector Optimization: Theory, Applications, and Extensions. Springer, New York (2011)"},{"key":"1932_CR3","volume-title":"Nonlinear Multiobjective Optimization","author":"K Miettinen","year":"1999","unstructured":"Miettinen, K.: Nonlinear Multiobjective Optimization, vol. 12.  Kluwer Academic, Boston (1999)"},{"key":"1932_CR4","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."},{"issue":"2","key":"1932_CR5","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)","journal-title":"SIAM J. Optim."},{"key":"1932_CR6","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, 339\u2013369 (2016)","journal-title":"Math. Program."},{"issue":"4","key":"1932_CR7","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."},{"key":"1932_CR8","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1137\/18M1173277","volume":"29","author":"J Thomann","year":"2019","unstructured":"Thomann, J., Eichfelder, G.: A trust-region algorithm for heteregeneous multiobjective optimization. SIAM J. Optim. 29, 1017\u20131047 (2019)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1932_CR9","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1007\/s10957-013-0392-7","volume":"160","author":"KDV Villacorta","year":"2014","unstructured":"Villacorta, K.D.V., 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":"1932_CR10","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 descent methods. Pesqui. Oper. 34(3), 585\u2013620 (2014)","journal-title":"Pesqui. Oper."},{"key":"1932_CR11","doi-asserted-by":"publisher","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":"1932_CR12","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1137\/050623012","volume":"19","author":"S Gratton","year":"2008","unstructured":"Gratton, S., Sartenaer, A., Toint, Ph.L.: Recursive trust-region methods for multiscale nonlinear optimization. SIAM J. Optim. 19, 414\u2013444 (2008)","journal-title":"SIAM J. Optim."},{"key":"1932_CR13","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s10107-009-0337-y","volume":"130","author":"C Cartis","year":"2011","unstructured":"Cartis, C., Gould, N.I.M., Toint, Ph.L.: Adaptive cubic regularisation methods for unconstrained optimization part II: worst-case function-evaluation complexity. Math. Program. 130, 295\u2013319 (2011)","journal-title":"Math. Program."},{"key":"1932_CR14","doi-asserted-by":"publisher","first-page":"1987","DOI":"10.1137\/151005683","volume":"26","author":"R Garmanjani","year":"2016","unstructured":"Garmanjani, R., J\u00fadice, D., Vicente, L.N.: Trust-region methods without using derivatives: worst case complexity and the non-smooth case. SIAM J. Optim. 26, 1987\u20132011 (2016)","journal-title":"SIAM J. Optim."},{"key":"1932_CR15","doi-asserted-by":"publisher","first-page":"1709","DOI":"10.1080\/02331934.2020.1830088","volume":"71","author":"R Garmanjani","year":"2022","unstructured":"Garmanjani, R.: A note on the worst-case complexity of nonlinear stepsize control methods for convex smooth unconstrained optimization. Optimization 71, 1709\u20131719 (2022)","journal-title":"Optimization"},{"key":"1932_CR16","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1080\/10556788.2011.610458","volume":"28","author":"PhL Toint","year":"2013","unstructured":"Toint, Ph.L.: Nonlinear stepsize control, trust regions and regularizations for unconstrained optimization. Optim. Methods Softw. 28, 82\u201395 (2013)","journal-title":"Optim. Methods Softw."},{"key":"1932_CR17","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1080\/10556788.2015.1130129","volume":"31","author":"GN Grapiglia","year":"2016","unstructured":"Grapiglia, G.N., Yuan, J., Yuan, Y.: On the worst-case complexity of nonlinear stepsize control algorithms for convex unconstrained optimization. Optim. Methods Softw. 31, 591\u2013604 (2016)","journal-title":"Optim. Methods Softw."},{"issue":"5","key":"1932_CR18","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."},{"key":"1932_CR19","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/s10957-019-01615-7","volume":"184","author":"OP Ferreira","year":"2020","unstructured":"Ferreira, O.P., Louzeiro, M.S., Prudente, L.F.: Iteration-complexity and asymptotic analysis of steepest decent method for multiobjective optimization on riemannian manifolds. J. Optim. Theory Appl. 184, 507\u2013533 (2020)","journal-title":"J. Optim. Theory Appl."},{"key":"1932_CR20","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1080\/10556788.2020.1719408","volume":"37","author":"L Calder\u00f3n","year":"2022","unstructured":"Calder\u00f3n, L., Diniz-Ehrhardt, M.A., Mart\u00ednez, J.M.: On high-order model regularization for multiobjective optimization. Optim. Methods Softw. 37, 175\u2013191 (2022)","journal-title":"Optim. Methods Softw"},{"key":"1932_CR21","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, 73\u201393 (2021)","journal-title":"J. Optim. Theory Appl"},{"key":"1932_CR22","doi-asserted-by":"crossref","unstructured":"Liu, S., Vicente, L.N.: The stochastic multi-gradient algorithm for multi-objective optimization and its application to supervised machine learning. Ann. Oper. Res. (2021)","DOI":"10.1007\/s10479-021-04033-z"},{"key":"1932_CR23","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.: On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization. Math. Program. 152, 491\u2013520 (2015)","journal-title":"Math. Program."},{"key":"1932_CR24","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10589-020-00204-z","volume":"77","author":"G Cocchi","year":"2020","unstructured":"Cocchi, G., Lapucci, M.: An augmented Lagrangian algorithm for multi-objective optimization. Comput. Optim. Appl. 77, 29\u201356 (2020)","journal-title":"Comput. Optim. Appl."},{"key":"1932_CR25","doi-asserted-by":"crossref","unstructured":"Conn, A.R., Gould, N.I.M., Toint, P.L.: Trust-Region Methods. MPS-SIAM Series on Optimization. SIAM, Philadelphia (2000)","DOI":"10.1137\/1.9780898719857"},{"key":"1932_CR26","first-page":"10","volume":"88","author":"Y Nesterov","year":"2012","unstructured":"Nesterov, Y.: How to make the gradients small. Optima 88, 10\u201311 (2012)","journal-title":"Optima"},{"key":"1932_CR27","doi-asserted-by":"crossref","unstructured":"Calafiore, G.C., El Ghaoui, L.: Optimization Models. Control systems and optimization series. Cambridge University Press (2014)","DOI":"10.1017\/CBO9781107279667"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01932-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-022-01932-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01932-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,8]],"date-time":"2023-05-08T10:34:07Z","timestamp":1683542047000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-022-01932-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,5]]},"references-count":27,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["1932"],"URL":"https:\/\/doi.org\/10.1007\/s11590-022-01932-3","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2022,10,5]]},"assertion":[{"value":"26 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 September 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 October 2022","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 declares no conflict of interest related to this work.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}