{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T19:20:15Z","timestamp":1775503215147,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,8,20]],"date-time":"2023-08-20T00:00:00Z","timestamp":1692489600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,8,20]],"date-time":"2023-08-20T00:00:00Z","timestamp":1692489600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"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":["2020.08249.BD"],"award-info":[{"award-number":["2020.08249.BD"]}],"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":["UIDP\/00297\/2020"],"award-info":[{"award-number":["UIDP\/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\/00297\/2020"],"award-info":[{"award-number":["UIDB\/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":["Comput Optim Appl"],"published-print":{"date-parts":[[2024,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Multiobjective optimization is a challenging scientific area, where the conflicting nature of the different objectives to be optimized changes the concept of problem solution, which is no longer a single point but a set of points, namely the Pareto front. In a posteriori preferences approach, when the decision maker is unable to rank objectives before the optimization, it is important to develop algorithms that generate approximations to the complete Pareto front of a multiobjective optimization problem, making clear the trade-offs between the different objectives. In this work, an algorithm based on a trust-region approach is proposed to approximate the set of Pareto critical points of a multiobjective optimization problem. Derivatives are assumed to be known, allowing the computation of Taylor models for the different objective function components, which will be minimized in two main steps: the extreme point step and the scalarization step. The goal of the extreme point step is to expand the approximation to the Pareto front, by moving towards the extreme points of it, corresponding to the individual minimization of each objective function component. The scalarization step attempts to reduce the gaps on the Pareto front, by solving adequate scalarization problems. The convergence of the method is analyzed and numerical experiments are reported, indicating the relevance of each feature included in the algorithmic structure and its competitiveness, by comparison against a state-of-art multiobjective optimization algorithm.<\/jats:p>","DOI":"10.1007\/s10589-023-00510-2","type":"journal-article","created":{"date-parts":[[2023,8,20]],"date-time":"2023-08-20T06:01:15Z","timestamp":1692511275000},"page":"149-179","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["A trust-region approach for computing Pareto fronts in multiobjective optimization"],"prefix":"10.1007","volume":"87","author":[{"given":"A.","family":"Mohammadi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0890-7398","authenticated-orcid":false,"given":"A. L.","family":"Cust\u00f3dio","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,20]]},"reference":[{"key":"510_CR1","doi-asserted-by":"publisher","first-page":"105631","DOI":"10.1016\/j.asoc.2019.105631","volume":"83","author":"H Afshari","year":"2019","unstructured":"Afshari, H., Hare, W., Tesfamariam, S.: Constrained multi-objective optimization algorithms: review and comparison with application in reinforced concrete structures. Appl. Soft Comput. 83, 105631 (2019)","journal-title":"Appl. Soft Comput."},{"key":"510_CR2","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s10287-009-0113-8","volume":"8","author":"K Anagnostopoulos","year":"2011","unstructured":"Anagnostopoulos, K., Mamanis, G.: Multiobjective evolutionary algorithms for complex portfolio optimization problems. Comput. Manag. Sci. 8, 259\u2013279 (2011)","journal-title":"Comput. Manag. Sci."},{"key":"510_CR3","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1137\/18M1182152","volume":"31","author":"MAT Ansary","year":"2021","unstructured":"Ansary, M.A.T., Panda, G.: A globally convergent SQCQP method for multiobjective optimization problems. SIAM J. Optim. 31, 91\u2013113 (2021)","journal-title":"SIAM J. Optim."},{"key":"510_CR4","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."},{"key":"510_CR5","doi-asserted-by":"crossref","unstructured":"Conn, A.R., Gould, N., Toint, Ph.: Trust-Region Methods. MOS-SIAM Ser. Optim. SIAM, Philadelphia (2000)","DOI":"10.1137\/1.9780898719857"},{"key":"510_CR6","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":"510_CR7","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/BF01197559","volume":"14","author":"I Das","year":"1997","unstructured":"Das, I., Dennis, J.E.: A closer look at drawbacks of minimizing weighted sums of objectives for Pareto set generation in multicriteria optimization problems. Struct. Multidiscip. Optim. 14, 63\u201369 (1997)","journal-title":"Struct. Multidiscip. Optim."},{"key":"510_CR8","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1137\/S1052623496307510","volume":"8","author":"I Das","year":"1998","unstructured":"Das, I., Dennis, J.E.: Normal-boundary intersection: a new method for generating the Pareto surface in nonlinear multicriteria optimization problems. SIAM J. Optim. 8, 631\u2013657 (1998)","journal-title":"SIAM J. Optim."},{"key":"510_CR9","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE T. Evolut. Comput. 6, 182\u2013197 (2002)","journal-title":"IEEE T. Evolut. Comput."},{"key":"510_CR10","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":"510_CR11","doi-asserted-by":"crossref","unstructured":"Eichfelder, G.: Adaptive Scalarization Methods in Multiobjective Optimization. Vector Optimization, Springer, Heidelberg (2008)","DOI":"10.1007\/978-3-540-79159-1"},{"key":"510_CR12","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/s11047-018-9685-y","volume":"17","author":"MTM Emmerich","year":"2018","unstructured":"Emmerich, M.T.M., Deutz, A.H.: A tutorial on multiobjective optimization: fundamentals and evolutionary methods. Nat. Comput. 17, 585\u2013609 (2018)","journal-title":"Nat. Comput."},{"key":"510_CR13","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, 602\u2013626 (2009)","journal-title":"SIAM J. Optim."},{"key":"510_CR14","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":"510_CR15","doi-asserted-by":"publisher","first-page":"2091","DOI":"10.1137\/15M1016424","volume":"26","author":"J Fliege","year":"2016","unstructured":"Fliege, J., Vaz, A.I.F.: A method for constrained multiobjective optimization based on SQP techniques. SIAM J. Optim. 26, 2091\u20132119 (2016)","journal-title":"SIAM J. Optim."},{"key":"510_CR16","doi-asserted-by":"crossref","unstructured":"Fonseca, C.M., Paquete, L., L\u00f3pez-Ib\u00e1nez, M.: An improved dimension-sweep algorithm for the hypervolume indicator. In: Proceedings of the 2006 Congress on Evolutionary Computation (CEC\u201906), pp. 1157\u20131163. IEEE (2006)","DOI":"10.1109\/CEC.2006.1688440"},{"key":"510_CR17","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":"510_CR18","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898717730","volume-title":"Linear and Nonlinear Optimization","author":"I Griva","year":"2009","unstructured":"Griva, I., Nash, S.G., Sofer, A.: Linear and Nonlinear Optimization, 2nd edn. SIAM, Philadelphia (2009)","edition":"2"},{"key":"510_CR19","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."},{"key":"510_CR20","doi-asserted-by":"publisher","first-page":"987","DOI":"10.1137\/040603097","volume":"15","author":"DT Luc","year":"2005","unstructured":"Luc, D.T., Phong, T.Q., Volle, M.: Scalarizing functions for generating the weakly efficient solution set in convex multiobjective problems. SIAM J. Optim. 15, 987\u20131001 (2005)","journal-title":"SIAM J. Optim."},{"key":"510_CR21","doi-asserted-by":"crossref","unstructured":"Miettinen, K.: Nonlinear Multiobjective Optimization. International Series in Operations Research & Management Science, Springer US, New York (1998)","DOI":"10.1007\/978-1-4615-5563-6"},{"key":"510_CR22","doi-asserted-by":"crossref","unstructured":"Mor\u00e9, J.J.: Recent developments in algorithms and software for trust region methods. In: Mathematical Programming The State of the Art: Bonn 1982, pp. 258\u2013287. Springer, Berlin, Heidelberg (1983)","DOI":"10.1007\/978-3-642-68874-4_11"},{"key":"510_CR23","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":"510_CR24","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization, 2nd edn. Springer (2006)","edition":"2"},{"key":"510_CR25","doi-asserted-by":"publisher","first-page":"5228","DOI":"10.1088\/1361-6560\/aa7298","volume":"62","author":"PS Potrebko","year":"2017","unstructured":"Potrebko, P.S., Fiege, J., Biagioli, M., Poleszczuk, J.: Investigating multi-objective fluence and beam orientation IMRT optimization. Phys. Med. Biol. 62, 5228\u20135244 (2017)","journal-title":"Phys. Med. Biol."},{"key":"510_CR26","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, 796\u2013811 (2013)","journal-title":"Optim. Methods Softw."},{"key":"510_CR27","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1007\/s10589-021-00346-8","volume":"81","author":"VA Ramirez","year":"2022","unstructured":"Ramirez, V.A., Sottosanto, G.N.: Nonmonotone trust region algorithm for solving the unconstrained multiobjective optimization problems. Comput. Optim. Appl. 81, 769\u2013788 (2022)","journal-title":"Comput. Optim. Appl."},{"key":"510_CR28","doi-asserted-by":"crossref","unstructured":"Roy, P.C., Blank, J., Hussein, R., Deb, K.: Trust-region based algorithms with low budget for multi-objective optimization. In: GECCO18: Proceedings of the Genetic and Evolutionary Computation Conference Companion, pp. 195\u2013196 (2018)","DOI":"10.1145\/3205651.3205727"},{"key":"510_CR29","doi-asserted-by":"crossref","unstructured":"Tapia, M.G.C., Coello, C.A.C.: Applications of multi-objective evolutionary algorithms in economics and finance: a survey. In: 2007 IEEE congress on evolutionary computation, pp. 532\u2013539 (2007)","DOI":"10.1109\/CEC.2007.4424516"},{"key":"510_CR30","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 heterogeneous multiobjective optimization. SIAM J. Optim. 29, 1017\u20131047 (2019)","journal-title":"SIAM J. Optim."},{"key":"510_CR31","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":"510_CR32","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TEVC.2003.810758","volume":"7","author":"E Zitzler","year":"2003","unstructured":"Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C.M., Grunert da Fonseca, V.: Performance assessment of multiobjective optimizers: an analysis and review. IEEE T. Evolut. Comput. 7, 117\u2013132 (2003)","journal-title":"IEEE T. Evolut. Comput."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00510-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-023-00510-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00510-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,26]],"date-time":"2024-10-26T12:21:59Z","timestamp":1729945319000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-023-00510-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,20]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["510"],"URL":"https:\/\/doi.org\/10.1007\/s10589-023-00510-2","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,20]]},"assertion":[{"value":"25 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 July 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 August 2023","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 have no conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}