{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T19:20:05Z","timestamp":1775503205001,"version":"3.50.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T00:00:00Z","timestamp":1606089600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T00:00:00Z","timestamp":1606089600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"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"],"award-info":[{"award-number":["PTDC\/MAT-APL\/28400\/2017"]}],"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\/00297\/2020"],"award-info":[{"award-number":["UIDB\/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":["PTDC\/MAT-APL\/28400\/2017"],"award-info":[{"award-number":["PTDC\/MAT-APL\/28400\/2017"]}],"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\/00297\/2020"],"award-info":[{"award-number":["UIDB\/00297\/2020"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007185","name":"Total","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100007185","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2021,1]]},"DOI":"10.1007\/s10957-020-01781-z","type":"journal-article","created":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T14:03:43Z","timestamp":1606140223000},"page":"73-93","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Worst-Case Complexity Bounds of Directional Direct-Search Methods for Multiobjective Optimization"],"prefix":"10.1007","volume":"188","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0890-7398","authenticated-orcid":false,"given":"Ana Lu\u00edsa","family":"Cust\u00f3dio","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6609-7330","authenticated-orcid":false,"given":"Youssef","family":"Diouane","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6597-9123","authenticated-orcid":false,"given":"Rohollah","family":"Garmanjani","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0864-6116","authenticated-orcid":false,"given":"Elisa","family":"Riccietti","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,11,23]]},"reference":[{"key":"1781_CR1","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s00158-003-0368-6","volume":"26","author":"RT Marler","year":"2004","unstructured":"Marler, R.T., Arora, J.S.: Survey of multi-objective optimization methods for engineering. Struct. Multidiscip. Optim. 26, 369\u2013395 (2004)","journal-title":"Struct. Multidiscip. Optim."},{"key":"1781_CR2","volume-title":"Multicriteria Optimization","author":"M Ehrgott","year":"2005","unstructured":"Ehrgott, M.: Multicriteria Optimization. Springer, Heidelberg (2005)"},{"key":"1781_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4203\/ctr.5.1","volume":"5","author":"AL Cust\u00f3dio","year":"2012","unstructured":"Cust\u00f3dio, A.L., Emmerich, M., Madeira, J.F.A.: Recent developments in derivative-free multiobjective optimization. Comput. Technol. Rev. 5, 1\u201330 (2012)","journal-title":"Comput. Technol. Rev."},{"key":"1781_CR4","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1137\/S003614450242889","volume":"45","author":"TG Kolda","year":"2003","unstructured":"Kolda, T.G., Lewis, R.M., Torczon, V.: Optimization by direct search: new perspectives on some classical and modern methods. SIAM Rev. 45, 385\u2013482 (2003)","journal-title":"SIAM Rev."},{"key":"1781_CR5","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718768","volume-title":"Introduction to Derivative-Free Optimization. MPS-SIAM Series on Optimization","author":"AR Conn","year":"2009","unstructured":"Conn, A.R., Scheinberg, K., Vicente, L.N.: Introduction to Derivative-Free Optimization. MPS-SIAM Series on Optimization. SIAM, Philadelphia (2009)"},{"key":"1781_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-68913-5","volume-title":"Derivative-Free and Blackbox Optimization. Springer Series in Operations Research and Financial Engineering","author":"C Audet","year":"2017","unstructured":"Audet, C., Hare, W.: Derivative-Free and Blackbox Optimization. Springer Series in Operations Research and Financial Engineering. Springer, Cham (2017)"},{"key":"1781_CR7","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.A., Vaz, A.I.F., Vicente, L.N.: Direct multisearch for multiobjective optimization. SIAM J. Optim. 21, 1109\u20131140 (2011)","journal-title":"SIAM J. Optim."},{"key":"1781_CR8","unstructured":"Cartis, C., Gould, N.I.M., Toint, Ph.L.: On the oracle complexity of first-order and derivative-free algorithms for smooth nonconvex minimization. SIAM J. Optim. 22, 66\u201386 (2012)"},{"key":"1781_CR9","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s10107-014-0847-0","volume":"155","author":"M Dodangeh","year":"2016","unstructured":"Dodangeh, M., Vicente, L.N.: Worst case complexity of direct search under convexity. Math. Program. 155, 307\u2013332 (2016)","journal-title":"Math. Program."},{"key":"1781_CR10","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)","journal-title":"Optim. Methods Softw."},{"key":"1781_CR11","doi-asserted-by":"publisher","first-page":"1008","DOI":"10.1093\/imanum\/drs027","volume":"33","author":"R Garmanjani","year":"2013","unstructured":"Garmanjani, R., Vicente, L.N.: Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization. IMA J. Numer. Anal. 33, 1008\u20131028 (2013)","journal-title":"IMA J. Numer. Anal."},{"key":"1781_CR12","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":"1781_CR13","doi-asserted-by":"publisher","first-page":"1515","DOI":"10.1137\/140961602","volume":"25","author":"S Gratton","year":"2015","unstructured":"Gratton, S., Royer, C.W., Vicente, L.N., Zhang, Z.: Direct search based on probabilistic descent. SIAM J. Optim. 25, 1515\u20131541 (2015)","journal-title":"SIAM J. Optim."},{"key":"1781_CR14","unstructured":"Kone\u010dn\u00fd, J., Richt\u00e1rik, P.: Simple Complexity Analysis of Simplified Direct Search. Technical reports, arXiv:1410.0390 (2014)"},{"key":"1781_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization. Applied Optimization","author":"Y Nesterov","year":"2004","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization. Applied Optimization. Kluwer Academic Publishers, Boston (2004)"},{"key":"1781_CR16","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s13675-012-0003-7","volume":"1","author":"LN Vicente","year":"2013","unstructured":"Vicente, L.N.: Worst case complexity of direct search. EURO J. Comput. Optim. 1, 143\u2013153 (2013)","journal-title":"EURO J. Comput. Optim."},{"key":"1781_CR17","unstructured":"Gratton, S., Sartenaer, A., Toint, Ph.L.: Recursive trust-region methods for multiscale nonlinear optimization. SIAM J. Optim. 19, 414\u2013444 (2008)"},{"key":"1781_CR18","doi-asserted-by":"crossref","unstructured":"Cartis, C., Sampaio, Ph.R., Toint, Ph.L.: Worst-case evaluation complexity of non-monotone gradient-related algorithms for unconstrained optimization. Optimization 64, 1349\u20131361 (2015)","DOI":"10.1080\/02331934.2013.869809"},{"key":"1781_CR19","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, 177\u2013205 (2006)","journal-title":"Math. Program."},{"key":"1781_CR20","doi-asserted-by":"crossref","unstructured":"Cartis, C., Gould, N.I.M., Toint, Ph.L.: Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function- and derivative-evaluation complexity. Math. Program. 130, 295\u2013319 (2011)","DOI":"10.1007\/s10107-009-0337-y"},{"key":"1781_CR21","doi-asserted-by":"publisher","first-page":"2726","DOI":"10.1137\/19M1244378","volume":"30","author":"EH Bergou","year":"2020","unstructured":"Bergou, E.H., Gorbunov, E., Richt\u00e1rik, P.: Stochastic three points method for unconstrained smooth optimization. SIAM J. Optim. 30, 2726\u20132749 (2020)","journal-title":"SIAM J. Optim."},{"key":"1781_CR22","doi-asserted-by":"publisher","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","DOI":"10.1080\/10556788.2020.1719408"},{"key":"1781_CR23","doi-asserted-by":"publisher","first-page":"1921","DOI":"10.1007\/s11590-012-0547-8","volume":"7","author":"A \u017dilinskas","year":"2013","unstructured":"\u017dilinskas, A.: On the worst-case optimal multi-objective global optimization. Optim. Lett. 7, 1921\u20131928 (2013)","journal-title":"Optim. Lett."},{"key":"1781_CR24","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s11590-019-01471-4","volume":"14","author":"JM Calvin","year":"2020","unstructured":"Calvin, J.M., \u017dilinskas, A.: On efficiency of a single variable bi-objective optimization algorithm. Optim. Lett. 14, 259\u2013267 (2020)","journal-title":"Optim. Lett."},{"key":"1781_CR25","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, 865\u2013889 (2014)","journal-title":"J. Optim. Theory Appl."},{"key":"1781_CR26","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":"1781_CR27","unstructured":"Zitzler, E.: Evolutionary Algorithms for Multiobjective Optimization: Methods and Applications. Ph.D. Thesis, Swiss Federal Institute of Technology Zurich, Switzerland (1999)"},{"key":"1781_CR28","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."},{"key":"1781_CR29","first-page":"116","volume-title":"New Computing Environments: Microcomputers in Large-Scale Computing","author":"JE Dennis Jr","year":"1987","unstructured":"Dennis Jr., J.E., Woods, D.J.: Optimization on microcomputers: the Nelder\u2013Mead simplex algorithm. In: Wouk, A. (ed.) New Computing Environments: Microcomputers in Large-Scale Computing, pp. 116\u2013122. SIAM, Philadelphia (1987)"},{"key":"1781_CR30","doi-asserted-by":"publisher","first-page":"2744","DOI":"10.1137\/15M1037810","volume":"26","author":"G Liuzzi","year":"2016","unstructured":"Liuzzi, G., Lucidi, S., Rinaldi, F.: A derivative-free approach to constrained multiobjective nonsmooth optimization. SIAM J. Optim. 26, 2744\u20132774 (2016)","journal-title":"SIAM J. Optim."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-020-01781-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-020-01781-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-020-01781-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,16]],"date-time":"2021-01-16T07:10:17Z","timestamp":1610781017000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-020-01781-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,23]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["1781"],"URL":"https:\/\/doi.org\/10.1007\/s10957-020-01781-z","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,11,23]]},"assertion":[{"value":"12 September 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 November 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 November 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}