{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T21:17:23Z","timestamp":1776287843679,"version":"3.50.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T00:00:00Z","timestamp":1677715200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T00:00:00Z","timestamp":1677715200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004434","name":"Universit\u00e0 degli Studi di Firenze","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100004434","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2023,5]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this paper, we deal with the class of unconstrained multi-objective optimization problems. In this setting we introduce, for the first time in the literature, a Limited Memory Quasi-Newton type method, which is well suited especially in large scale scenarios. The proposed algorithm approximates, through a suitable positive definite matrix, the convex combination of the Hessian matrices of the objectives; the update formula for the approximation matrix can be seen as an extension of the one used in the popular L-BFGS method for scalar optimization. Equipped with a Wolfe type line search, the considered method is proved to be well defined even in the nonconvex case. Furthermore, for twice continuously differentiable strongly convex problems, we state global and R-linear convergence to Pareto optimality of the sequence of generated points. The performance of the new algorithm is empirically assessed by a thorough computational comparison with state-of-the-art Newton and Quasi-Newton approaches from the multi-objective optimization literature. The results of the experiments highlight that the proposed approach is generally efficient and effective, outperforming the competitors in most settings. Moreover, the use of the limited memory method results to be beneficial within a global optimization framework for Pareto front approximation.<\/jats:p>","DOI":"10.1007\/s10589-023-00454-7","type":"journal-article","created":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T17:02:53Z","timestamp":1677776573000},"page":"33-73","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":30,"title":["A limited memory Quasi-Newton approach for multi-objective optimization"],"prefix":"10.1007","volume":"85","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2488-5486","authenticated-orcid":false,"given":"Matteo","family":"Lapucci","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1394-0937","authenticated-orcid":false,"given":"Pierluigi","family":"Mansueto","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,3,2]]},"reference":[{"issue":"2","key":"454_CR1","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1023\/A:1022614029984","volume":"96","author":"E Carrizosa","year":"1998","unstructured":"Carrizosa, E., Frenk, J.B.G.: Dominating sets for convex functions with some applications. J. Optim. Theory Appl. 96(2), 281\u2013295 (1998). https:\/\/doi.org\/10.1023\/A:1022614029984","journal-title":"J. Optim. Theory Appl."},{"issue":"5","key":"454_CR2","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1115\/DETC2004-57194","volume":"127","author":"S Shan","year":"2005","unstructured":"Shan, S., Wang, G.G.: An efficient Pareto set identification approach for multiobjective optimization on black-box functions. J. Mech. Des. 127(5), 866\u2013874 (2005). https:\/\/doi.org\/10.1115\/DETC2004-57194","journal-title":"J. Mech. Des."},{"issue":"3","key":"454_CR3","doi-asserted-by":"publisher","first-page":"1261","DOI":"10.1109\/TMAG.2003.810193","volume":"39","author":"G Liuzzi","year":"2003","unstructured":"Liuzzi, G., Lucidi, S., Parasiliti, F., Villani, M.: Multiobjective optimization techniques for the design of induction motors. IEEE Trans. Magn. 39(3), 1261\u20131264 (2003). https:\/\/doi.org\/10.1109\/TMAG.2003.810193","journal-title":"IEEE Trans. Magn."},{"issue":"1","key":"454_CR4","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s10589-017-9955-0","volume":"71","author":"EF Campana","year":"2018","unstructured":"Campana, E.F., Diez, M., Liuzzi, G., Lucidi, S., Pellegrini, R., Piccialli, V., Rinaldi, F., Serani, A.: A multi-objective direct algorithm for ship hull optimization. Comput. Optim. Appl. 71(1), 53\u201372 (2018). https:\/\/doi.org\/10.1007\/s10589-017-9955-0","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"454_CR5","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/S0377-2217(97)00056-8","volume":"105","author":"D White","year":"1998","unstructured":"White, D.: Epsilon-dominating solutions in mean-variance portfolio analysis. Eur. J. Oper. Res. 105(3), 457\u2013466 (1998). https:\/\/doi.org\/10.1016\/S0377-2217(97)00056-8","journal-title":"Eur. J. Oper. Res."},{"issue":"7","key":"454_CR6","doi-asserted-by":"publisher","first-page":"1147","DOI":"10.1016\/S0305-0548(03)00074-1","volume":"31","author":"M Tavana","year":"2004","unstructured":"Tavana, M.: A subjective assessment of alternative mission architectures for the human exploration of Mars at NASA using multicriteria decision making. Comput. Oper. Res. 31(7), 1147\u20131164 (2004). https:\/\/doi.org\/10.1016\/S0305-0548(03)00074-1","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"454_CR7","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). https:\/\/doi.org\/10.1007\/s001860000043","journal-title":"Math. Methods Oper. Res."},{"issue":"2","key":"454_CR8","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(2), 602\u2013626 (2009). https:\/\/doi.org\/10.1137\/08071692X","journal-title":"SIAM J. Optim."},{"issue":"2","key":"454_CR9","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s10589-022-00414-7","volume":"83","author":"MLN Gon\u00e7alves","year":"2022","unstructured":"Gon\u00e7alves, M.L.N., Lima, F.S., Prudente, L.F.: Globally convergent newton-type methods for multiobjective optimization. Comput. Optim. Appl. 83(2), 403\u2013434 (2022). https:\/\/doi.org\/10.1007\/s10589-022-00414-7","journal-title":"Comput. Optim. Appl."},{"key":"454_CR10","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1016\/j.cam.2013.06.045","volume":"255","author":"Z Povalej","year":"2014","unstructured":"Povalej, Z.: Quasi-Newton\u2019s method for multiobjective optimization. J. Comput. Appl. Math. 255, 765\u2013777 (2014). https:\/\/doi.org\/10.1016\/j.cam.2013.06.045","journal-title":"J. Comput. Appl. Math."},{"issue":"1","key":"454_CR11","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(1), 29\u201356 (2020). https:\/\/doi.org\/10.1007\/s10589-020-00204-z","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"454_CR12","doi-asserted-by":"publisher","first-page":"2690","DOI":"10.1137\/17M1126588","volume":"28","author":"LR Lucambio P\u00e9rez","year":"2018","unstructured":"Lucambio P\u00e9rez, L.R., Prudente, L.F.: Nonlinear conjugate gradient methods for vector optimization. SIAM J. Optim. 28(3), 2690\u20132720 (2018). https:\/\/doi.org\/10.1137\/17M1126588","journal-title":"SIAM J. Optim."},{"issue":"4","key":"454_CR13","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/BF00934564","volume":"42","author":"A Pascoletti","year":"1984","unstructured":"Pascoletti, A., Serafini, P.: Scalarizing vector optimization problems. J. Optim. Theory Appl. 42(4), 499\u2013524 (1984). https:\/\/doi.org\/10.1007\/BF00934564","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"454_CR14","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 Trans. Evol. Comput. 6(2), 182\u2013197 (2002). https:\/\/doi.org\/10.1109\/4235.996017","journal-title":"IEEE Trans. Evol. Comput."},{"key":"454_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-020-00192-0","author":"G Cocchi","year":"2020","unstructured":"Cocchi, G., Liuzzi, G., Lucidi, S., Sciandrone, M.: On the convergence of steepest descent methods for multiobjective optimization. Comput. Optim. Appl. (2020). https:\/\/doi.org\/10.1007\/s10589-020-00192-0","journal-title":"Comput. Optim. Appl."},{"key":"454_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejco.2021.100008","author":"G Cocchi","year":"2021","unstructured":"Cocchi, G., Lapucci, M., Mansueto, P.: Pareto front approximation through a multi-objective augmented Lagrangian method. EURO J. Comput. Optim. (2021). https:\/\/doi.org\/10.1016\/j.ejco.2021.100008","journal-title":"EURO J. Comput. Optim."},{"issue":"3","key":"454_CR17","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.A., Vaz, A.I.F., Vicente, L.N.: Direct multisearch for multiobjective optimization. SIAM J. Optim. 21(3), 1109\u20131140 (2011). https:\/\/doi.org\/10.1137\/10079731X","journal-title":"SIAM J. Optim."},{"issue":"2","key":"454_CR18","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s10589-017-9953-2","volume":"69","author":"G Cocchi","year":"2018","unstructured":"Cocchi, G., Liuzzi, G., Papini, A., Sciandrone, M.: An implicit filtering algorithm for derivative-free multiobjective optimization with box constraints. Comput. Optim. Appl. 69(2), 267\u2013296 (2018). https:\/\/doi.org\/10.1007\/s10589-017-9953-2","journal-title":"Comput. Optim. Appl."},{"key":"454_CR19","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.cor.2013.09.010","volume":"43","author":"M Locatelli","year":"2014","unstructured":"Locatelli, M., Maischberger, M., Schoen, F.: Differential evolution methods based on local searches. Comput. Oper. Res. 43, 169\u2013180 (2014). https:\/\/doi.org\/10.1016\/j.cor.2013.09.010","journal-title":"Comput. Oper. Res."},{"key":"454_CR20","doi-asserted-by":"publisher","first-page":"107849","DOI":"10.1016\/j.patcog.2021.107849","volume":"114","author":"P Mansueto","year":"2021","unstructured":"Mansueto, P., Schoen, F.: Memetic differential evolution methods for clustering problems. Pattern Recogn. 114, 107849 (2021). https:\/\/doi.org\/10.1016\/j.patcog.2021.107849","journal-title":"Pattern Recogn."},{"key":"454_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-022-00231-3","author":"M Lapucci","year":"2022","unstructured":"Lapucci, M., Mansueto, P., Schoen, F.: A memetic procedure for global multi-objective optimization. Math. Program. Comput. (2022). https:\/\/doi.org\/10.1007\/s12532-022-00231-3","journal-title":"Math. Program. Comput."},{"key":"454_CR22","volume-title":"Nonlinear Programming","author":"D Bertsekas","year":"2016","unstructured":"Bertsekas, D.: Nonlinear Programming, vol. 4, 2nd edn. Athena Scientific, Belmont, Massachusetts (2016)","edition":"2"},{"issue":"11","key":"454_CR23","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(11), 2289\u20132306 (2015). https:\/\/doi.org\/10.1080\/02331934.2014.947500","journal-title":"Optimization"},{"issue":"3","key":"454_CR24","doi-asserted-by":"publisher","first-page":"1107","DOI":"10.1007\/s10957-022-02072-5","volume":"194","author":"LF Prudente","year":"2022","unstructured":"Prudente, L.F., Souza, D.R.: A Quasi-Newton method with Wolfe line searches for multiobjective optimization. J. Optim. Theory Appl. 194(3), 1107\u20131140 (2022). https:\/\/doi.org\/10.1007\/s10957-022-02072-5","journal-title":"J. Optim. Theory Appl."},{"issue":"5","key":"454_CR25","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). https:\/\/doi.org\/10.1016\/j.orl.2011.07.008","journal-title":"Oper. Res. Lett."},{"issue":"151","key":"454_CR26","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1090\/S0025-5718-1980-0572855-7","volume":"35","author":"J Nocedal","year":"1980","unstructured":"Nocedal, J.: Updating quasi-Newton matrices with limited storage. Math. Comput. 35(151), 773\u2013782 (1980). https:\/\/doi.org\/10.1090\/S0025-5718-1980-0572855-7","journal-title":"Math. Comput."},{"issue":"2","key":"454_CR27","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.cam.2004.06.018","volume":"175","author":"LM Gra\u00f1a Drummond","year":"2005","unstructured":"Gra\u00f1a Drummond, L.M., Svaiter, B.F.: A steepest descent method for vector optimization. J. Comput. Appl. Math. 175(2), 395\u2013414 (2005). https:\/\/doi.org\/10.1016\/j.cam.2004.06.018","journal-title":"J. Comput. Appl. Math."},{"key":"454_CR28","doi-asserted-by":"publisher","unstructured":"Nocedal, J., Wright, S.J.: Quasi-Newton Methods. In: Numerical Optimization, pp. 135\u2013163. Springer, New York, NY (2006). https:\/\/doi.org\/10.1007\/978-0-387-40065-5_6","DOI":"10.1007\/978-0-387-40065-5_6"},{"key":"454_CR29","doi-asserted-by":"publisher","DOI":"10.1145\/3342104","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. (2019). https:\/\/doi.org\/10.1145\/3342104","journal-title":"ACM Trans. Math. Softw."},{"issue":"1","key":"454_CR30","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/BF01589116","volume":"45","author":"DC Liu","year":"1989","unstructured":"Liu, D.C., Nocedal, J.: On the limited memory BFGS method for large scale optimization. Math. Program. 45(1), 503\u2013528 (1989). https:\/\/doi.org\/10.1007\/BF01589116","journal-title":"Math. Program."},{"key":"454_CR31","unstructured":"Jin, Y., Olhofer, M., Sendhoff, B.: Dynamic weighted aggregation for evolutionary multi-objective optimization: Why does it work and how? In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 1042\u20131049 (2001)"},{"key":"454_CR32","unstructured":"Sch\u00fctze, O., Lara, A., Coello, C.C.: The directed search method for unconstrained multi-objective optimization problems. In: Proceedings of the EVOLVE\u2013A Bridge Between Probability, Set Oriented Numerics, and Evolutionary Computation, 1\u20134 (2011)"},{"issue":"5","key":"454_CR33","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. Comput. 10(5), 477\u2013506 (2006). https:\/\/doi.org\/10.1109\/TEVC.2005.861417","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"454_CR34","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1016\/j.ejor.2007.05.015","volume":"188","author":"E Miglierina","year":"2008","unstructured":"Miglierina, E., Molho, E., Recchioni, M.C.: Box-constrained multi-objective optimization: a gradient-like method without \u201ca priori\u2019\u2019 scalarization. Eur. J. Oper. Res. 188(3), 662\u2013682 (2008). https:\/\/doi.org\/10.1016\/j.ejor.2007.05.015","journal-title":"Eur. J. Oper. Res."},{"key":"454_CR35","first-page":"1","volume":"264","author":"Q Zhang","year":"2008","unstructured":"Zhang, Q., Zhou, A., Zhao, S., Suganthan, P.N., Liu, W., Tiwari, S., et al.: Multiobjective optimization test instances for the CEC 2009 special session and competition. Univ. Essex, Colch., UK Nanyang Tech. Univ., Singap., Spec. Sess. Perform. Assess. Multi-Object. Optim. Algorithms, Tech. Rep. 264, 1\u201330 (2008)","journal-title":"Univ. Essex, Colch., UK Nanyang Tech. Univ., Singap., Spec. Sess. Perform. Assess. Multi-Object. Optim. Algorithms, Tech. Rep."},{"issue":"2","key":"454_CR36","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(2), 201\u2013213 (2002). https:\/\/doi.org\/10.1007\/s101070100263","journal-title":"Math. Program."},{"key":"454_CR37","doi-asserted-by":"publisher","unstructured":"Mansueto, P.: LM-Q-NWT: a limited memory Quasi-Newton approach for multi-objective optimization (2023). https:\/\/doi.org\/10.5281\/zenodo.7533784","DOI":"10.5281\/zenodo.7533784"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00454-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-023-00454-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00454-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,3]],"date-time":"2024-10-03T07:04:37Z","timestamp":1727939077000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-023-00454-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,2]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["454"],"URL":"https:\/\/doi.org\/10.1007\/s10589-023-00454-7","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,2]]},"assertion":[{"value":"31 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 January 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 March 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 October 2024","order":4,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Update","order":5,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"In article PDF, the source line has been corrected.","order":6,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"The full code of the experiments can be found at  (DOI: 10.5281\/zenodo.7533784).","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability statement"}}]}}