{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T11:16:38Z","timestamp":1775214998105,"version":"3.50.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T00:00:00Z","timestamp":1683849600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T00:00:00Z","timestamp":1683849600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100015968","name":"Universit\u00e0 degli studi di Bergamo","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100015968","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,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Preference-based optimization algorithms are iterative procedures that seek the optimal calibration of a decision vector based only on comparisons between couples of different tunings. At each iteration, a human decision-maker expresses a preference between two calibrations (samples), highlighting which one, if any, is better than the other. The optimization procedure must use the observed preferences to find the tuning of the decision vector that is most preferred by the decision-maker, while also minimizing the number of comparisons. In this work, we formulate the preference-based optimization problem from a utility theory perspective. Then, we propose , an extension of a recent preference-based optimization procedure called . The latter uses a Radial Basis Function surrogate to describe the tastes of the decision-maker. Iteratively,  proposes new samples to compare with the best calibration available by trading off exploitation of the surrogate model and exploration of the decision space. In , we propose a different criterion to use when looking for new candidate samples that is inspired by , a popular procedure in the black-box optimization framework. Compared to ,  is less likely to get stuck on local optima of the preference-based optimization problem. We motivate this claim theoretically, with a proof of global convergence, and empirically, by comparing the performances of  and  on several benchmark optimization problems.<\/jats:p>","DOI":"10.1007\/s10589-023-00491-2","type":"journal-article","created":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T17:03:01Z","timestamp":1683910981000},"page":"383-420","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["GLISp-r: a preference-based optimization algorithm with convergence guarantees"],"prefix":"10.1007","volume":"86","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9868-5196","authenticated-orcid":false,"given":"Davide","family":"Previtali","sequence":"first","affiliation":[]},{"given":"Mirko","family":"Mazzoleni","sequence":"additional","affiliation":[]},{"given":"Antonio","family":"Ferramosca","sequence":"additional","affiliation":[]},{"given":"Fabio","family":"Previdi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,12]]},"reference":[{"key":"491_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-68913-5","volume-title":"Derivative-Free and Blackbox Optimization","author":"C Audet","year":"2017","unstructured":"Audet, C., Hare, W.: Derivative-Free and Blackbox Optimization. Springer, Berlin (2017). (ISBN 9783319886800)"},{"issue":"2","key":"491_CR2","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/s10589-020-00215-w","volume":"77","author":"A Bemporad","year":"2020","unstructured":"Bemporad, A.: Global optimization via inverse distance weighting and radial basis functions. Comput. Optim. Appl. 77(2), 571\u2013595 (2020). https:\/\/doi.org\/10.1007\/s10589-020-00215-w. (ISSN 1573-2894)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"491_CR3","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/s10994-020-05935-y","volume":"110","author":"A Bemporad","year":"2021","unstructured":"Bemporad, A., Piga, D.: Global optimization based on active preference learning with radial basis functions. Mach. Learn. 110(2), 417\u2013448 (2021). https:\/\/doi.org\/10.1007\/s10994-020-05935-y. (ISSN 1573-0565)","journal-title":"Mach. Learn."},{"key":"491_CR4","doi-asserted-by":"publisher","unstructured":"Benavoli, A., Azzimonti, D., Piga, D.: Preferential Bayesian optimisation with skew gaussian processes. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, pp. 1842\u20131850 (2021). https:\/\/doi.org\/10.1145\/3449726.3463128","DOI":"10.1145\/3449726.3463128"},{"key":"491_CR5","volume-title":"Pattern Recognition and Machine Learning","author":"CM Bishop","year":"2006","unstructured":"Bishop, C.M., Nasrabadi, N.M.: Pattern Recognition and Machine Learning. Springer, Berlin (2006)"},{"key":"491_CR6","unstructured":"Brochu, E., De\u00a0Freitas, N., Ghosh, A.: Active preference learning with discrete choice data. In: Advances in Neural Information Processing Systems 20 (NIPS 2007), pp. 409\u2013416 (2007). https:\/\/papers.nips.cc\/paper\/2007\/hash\/b6a1085a27ab7bff7550f8a3bd017df8-Abstract.html"},{"key":"491_CR7","doi-asserted-by":"publisher","unstructured":"Chu, W., Ghahramani, Z.: Preference learning with gaussian processes. In: Proceedings of the 22nd International Conference on Machine Learning, pp. 137\u2013144 (2005). https:\/\/doi.org\/10.1145\/1102351.1102369","DOI":"10.1145\/1102351.1102369"},{"key":"491_CR8","unstructured":"Debreu, G.: Theory of value: An Axiomatic Analysis of Economic Equilibrium, Vol.\u00a017. Yale University Press (1971) (ISBN 0300015593)"},{"key":"491_CR9","doi-asserted-by":"crossref","DOI":"10.1142\/6437","volume-title":"Meshfree Approximation Methods with MATLAB","author":"GE Fasshauer","year":"2007","unstructured":"Fasshauer, G.E.: Meshfree Approximation Methods with MATLAB, vol. 6. World Scientific, Singapore (2007). (ISBN 9789812706348)"},{"key":"491_CR10","unstructured":"Feldman, A.\u00a0M., Serrano, R.: Welfare Economics and Social Choice Theory. Springer Science & Business Media (2006). (ISBN 9780387293677)"},{"key":"491_CR11","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974041","volume-title":"A Primer on Radial Basis Functions with Applications to the Geosciences","author":"B Fornberg","year":"2015","unstructured":"Fornberg, B., Flyer, N.: A Primer on Radial Basis Functions with Applications to the Geosciences. SIAM, Philadelphia (2015). (ISBN 9781611974027)"},{"key":"491_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14125-6_4","volume-title":"Preference Learning and Ranking by Pairwise Comparison","author":"J F\u00fcrnkranz","year":"2010","unstructured":"F\u00fcrnkranz, J., H\u00fcllermeier, E.: Preference Learning and Ranking by Pairwise Comparison. Springer, Berlin (2010). (ISBN 9783642141249)"},{"key":"491_CR13","unstructured":"Gonz\u00e1lez, J., Dai, Z., Damianou, A., Lawrence, N.\u00a0D.: Preferential Bayesian optimization. In: International Conference on Machine Learning, pp. 1282\u20131291 (2017). https:\/\/assets.amazon.science\/da\/1e\/24ad7c354431bd0c2f64a6049269\/preferential-bayesian-optimization.pdf"},{"issue":"3","key":"491_CR14","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1007\/s11222-010-9224-x","volume":"22","author":"RB Gramacy","year":"2012","unstructured":"Gramacy, R.B., Lee, H.K.H.: Cases for the nugget in modeling computer experiments. Stat. Comput. 22(3), 713\u2013722 (2012). https:\/\/doi.org\/10.1007\/s11222-010-9224-x","journal-title":"Stat. Comput."},{"issue":"3","key":"491_CR15","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1023\/A:1011255519438","volume":"19","author":"H-M Gutmann","year":"2001","unstructured":"Gutmann, H.-M.: A radial basis function method for global optimization. J. Glob. Optim. 19(3), 201\u2013227 (2001). https:\/\/doi.org\/10.1023\/A:1011255519438","journal-title":"J. Glob. Optim."},{"key":"491_CR16","volume-title":"Data Mining: Concepts and Techniques","author":"J Han","year":"2011","unstructured":"Han, J., Pei, J., Kamber, M.: Data Mining: Concepts and Techniques. Elsevier, Amsterdam (2011). (ISBN 9789380931913)"},{"key":"491_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-84858-7","volume-title":"The Elements of Statistical Learning: Data Mining, Inference, and Prediction","author":"T Hastie","year":"2009","unstructured":"Hastie, T., Tibshirani, R., Friedman, J.H.: The Elements of Statistical Learning: Data Mining, Inference, and Prediction, vol. 2. Springer, Berlin (2009). (ISBN 9780387848570)"},{"issue":"2","key":"491_CR18","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1504\/IJMMNO.2013.055204","volume":"4","author":"M Jamil","year":"2013","unstructured":"Jamil, M., Yang, X.-S.: A literature survey of benchmark functions for global optimisation problems. Int. J. Math. Modell. Numer. Optim. 4(2), 150\u2013194 (2013). https:\/\/doi.org\/10.1504\/IJMMNO.2013.055204","journal-title":"Int. J. Math. Modell. Numer. Optim."},{"issue":"4","key":"491_CR19","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1023\/A:1012771025575","volume":"21","author":"DR Jones","year":"2001","unstructured":"Jones, D.R.: A taxonomy of global optimization methods based on response surfaces. J. Glob. Optim. 21(4), 345\u2013383 (2001). https:\/\/doi.org\/10.1023\/A:1012771025575","journal-title":"J. Glob. Optim."},{"issue":"1","key":"491_CR20","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/s11750-011-0193-9","volume":"20","author":"HA Le","year":"2012","unstructured":"Le, H.A., Thi, A.I., Vaz, F., Vicente, L.N.: Optimizing radial basis functions by DC programming and its use in direct search for global derivative-free optimization. TOP 20(1), 190\u2013214 (2012). https:\/\/doi.org\/10.1007\/s11750-011-0193-9","journal-title":"TOP"},{"key":"491_CR21","volume-title":"Multiobjective Optimisation and Control","author":"GP Liu","year":"2002","unstructured":"Liu, G.P., Yang, J.B., Whidborn, J.F.: Multiobjective Optimisation and Control. Research Studies Press Ltd, Baldock (2002). (ISBN 9780863802645)"},{"issue":"2","key":"491_CR22","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"S Lloyd","year":"1982","unstructured":"Lloyd, S.: Least squares quantization in PCM. IEEE Trans. Inf. Theory 28(2), 129\u2013137 (1982). https:\/\/doi.org\/10.1109\/TIT.1982.1056489","journal-title":"IEEE Trans. Inf. Theory"},{"key":"491_CR23","doi-asserted-by":"publisher","unstructured":"Mart\u00ed, R., Lozano, J.\u00a0A., Mendiburu, A., Hernando, L.: Multi-start methods. In: Handbook of Heuristics, pp. 155\u2013175 (2018). https:\/\/doi.org\/10.1007\/0-306-48056-5_12","DOI":"10.1007\/0-306-48056-5_12"},{"issue":"1","key":"491_CR24","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1080\/00401706.2000.10485979","volume":"42","author":"MD McKay","year":"2000","unstructured":"McKay, M.D., Beckman, R.J., Conover, W.J.: A comparison of three methods for selecting values of input variables in the analysis of output from a computer code. Technometrics 42(1), 55\u201361 (2000). https:\/\/doi.org\/10.1080\/00401706.2000.10485979","journal-title":"Technometrics"},{"key":"491_CR25","doi-asserted-by":"crossref","unstructured":"Mishra, S.\u00a0K.: Some new test functions for global optimization and performance of repulsive particle swarm method. Available at SSRN 926132. https:\/\/papers.ssrn.com\/sol3\/papers.cfm?abstract_id=926132 (2006)","DOI":"10.2139\/ssrn.926132"},{"key":"491_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/b98874","volume-title":"Numerical Optimization","author":"J Nocedal","year":"1999","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Springer, Berlin (1999). (ISBN 0387987932)"},{"key":"491_CR27","doi-asserted-by":"publisher","DOI":"10.2307\/j.ctvcm4hv9","volume-title":"Real Analysis with Economic Applications","author":"EA Ok","year":"2011","unstructured":"Ok, E.A.: Real Analysis with Economic Applications. Princeton University Press, Princeton (2011). (ISBN 9780691117683)"},{"issue":"1","key":"491_CR28","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s10898-004-0570-0","volume":"31","author":"RG Regis","year":"2005","unstructured":"Regis, R.G., Shoemaker, C.A.: Constrained global optimization of expensive black box functions using radial basis functions. J. Glob. Optim. 31(1), 153\u2013171 (2005). https:\/\/doi.org\/10.1007\/s10898-004-0570-0","journal-title":"J. Glob. Optim."},{"issue":"4","key":"491_CR29","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1287\/ijoc.1060.0182","volume":"19","author":"RG Regis","year":"2007","unstructured":"Regis, R.G., Shoemaker, C.A.: A stochastic radial basis function method for the global optimization of expensive functions. INFORMS J. Comput. 19(4), 497\u2013509 (2007). https:\/\/doi.org\/10.1287\/ijoc.1060.0182","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"491_CR30","doi-asserted-by":"publisher","first-page":"6632","DOI":"10.1109\/LRA.2021.3094479","volume":"6","author":"L Roveda","year":"2021","unstructured":"Roveda, L., Maggioni, B., Marescotti, E., Shahid, A.A., Zanchettin, A.M., Bemporad, A., Piga, D.: Pairwise preferences-based optimization of a path-based velocity planner in robotic sealing tasks. IEEE Robot. Autom. Lett. 6(4), 6632\u20136639 (2021). https:\/\/doi.org\/10.1109\/LRA.2021.3094479","journal-title":"IEEE Robot. Autom. Lett."},{"key":"491_CR31","doi-asserted-by":"publisher","unstructured":"Shepard, D.: A two-dimensional interpolation function for irregularly-spaced data. In Proceedings of the 1968 23rd ACM National Conference, pp. 517\u2013524 (1968). https:\/\/doi.org\/10.1145\/800186.810616","DOI":"10.1145\/800186.810616"},{"issue":"4","key":"491_CR32","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/BF01748225","volume":"2","author":"PB Thanedar","year":"1990","unstructured":"Thanedar, P.B., Arora, J.S., Li, G.Y., Lin, T.C.: Robustness, generality and efficiency of optimization algorithms for practical applications. Struct. Optim. 2(4), 203\u2013212 (1990). https:\/\/doi.org\/10.1007\/BF01748225","journal-title":"Struct. Optim."},{"key":"491_CR33","doi-asserted-by":"crossref","unstructured":"Torn, A., Zilinskas, A.: Global optimization. In: Lecture Notes in Computer Science (1989). (ISBN 9783540508717)","DOI":"10.1007\/3-540-50871-6"},{"issue":"2","key":"491_CR34","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s10898-007-9133-5","volume":"39","author":"AIF Vaz","year":"2007","unstructured":"Vaz, A.I.F., Vicente, L.N.: A particle swarm pattern search method for bound constrained global optimization. J. Glob. Optim. 39(2), 197\u2013219 (2007). https:\/\/doi.org\/10.1007\/s10898-007-9133-5","journal-title":"J. Glob. Optim."},{"issue":"4\u20135","key":"491_CR35","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1080\/10556780902909948","volume":"24","author":"AIF Vaz","year":"2009","unstructured":"Vaz, A.I.F., Vicente, L.N.: PSwarm: a hybrid solver for linearly constrained global derivative-free optimization. Optim. Methods Softw. 24(4\u20135), 669\u2013685 (2009). https:\/\/doi.org\/10.1080\/10556780902909948","journal-title":"Optim. Methods Softw."},{"issue":"3","key":"491_CR36","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1111\/itor.12292","volume":"24","author":"KK Vu","year":"2017","unstructured":"Vu, K.K., d\u2019Ambrosio, C., Hamadi, Y., Liberti, L.: Surrogate-based methods for black-box optimization. Int. Trans. Oper. Res. 24(3), 393\u2013424 (2017). https:\/\/doi.org\/10.1111\/itor.12292","journal-title":"Int. Trans. Oper. Res."},{"key":"491_CR37","doi-asserted-by":"publisher","unstructured":"Wang, Y., Shoemaker, C.\u00a0A.: A general stochastic algorithmic framework for minimizing expensive black box objective functions based on surrogate models and sensitivity analysis. arXiv:1410.6271 (2014). https:\/\/doi.org\/10.48550\/arXiv.1410.6271","DOI":"10.48550\/arXiv.1410.6271"},{"key":"491_CR38","volume-title":"Gaussian Processes for Machine Learning","author":"CK Williams","year":"2005","unstructured":"Williams, C.K., Rasmussen, C.E.: Gaussian Processes for Machine Learning. MIT Press, Cambridge (2005)"},{"key":"491_CR39","doi-asserted-by":"publisher","unstructured":"Zhu, M., Bemporad, A., Piga, D.: Preference-based MPC calibration. arXiv:2003.11294 (2020). https:\/\/doi.org\/10.48550\/arXiv.2003.11294","DOI":"10.48550\/arXiv.2003.11294"},{"key":"491_CR40","doi-asserted-by":"publisher","DOI":"10.1109\/TCST.2021.3136711","author":"M Zhu","year":"2021","unstructured":"Zhu, M., Piga, D., Bemporad, A.: C-GLISp: Preference-based global optimization under unknown constraints with applications to controller calibration. IEEE Trans. Control Syst. Technol. (2021). https:\/\/doi.org\/10.1109\/TCST.2021.3136711","journal-title":"IEEE Trans. Control Syst. Technol."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00491-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-023-00491-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-00491-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,25]],"date-time":"2023-07-25T11:15:31Z","timestamp":1690283731000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-023-00491-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,12]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["491"],"URL":"https:\/\/doi.org\/10.1007\/s10589-023-00491-2","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,12]]},"assertion":[{"value":"29 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 April 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 May 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":"All the authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}