{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:57:15Z","timestamp":1761897435848,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,12,8]],"date-time":"2020-12-08T00:00:00Z","timestamp":1607385600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,12,8]],"date-time":"2020-12-08T00:00:00Z","timestamp":1607385600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100007826","name":"Technische Universit\u00e4t Ilmenau","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100007826","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2021,5]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>An important aspect of optimization algorithms, for instance evolutionary algorithms, are termination criteria that measure the proximity of the found solution to the optimal solution set. A frequently used approach is the numerical verification of necessary optimality conditions such as the Karush\u2013Kuhn\u2013Tucker (KKT) conditions. In this paper, we present a proximity measure which characterizes the violation of the KKT conditions. It can be computed easily and is continuous in every efficient solution. Hence, it can be used as an indicator for the proximity of a certain point to the set of efficient (Edgeworth-Pareto-minimal) solutions and is well suited for algorithmic use due to its continuity properties. This is especially useful within evolutionary algorithms for candidate selection and termination, which we also illustrate numerically for some test problems.<\/jats:p>","DOI":"10.1007\/s10898-020-00971-3","type":"journal-article","created":{"date-parts":[[2020,12,8]],"date-time":"2020-12-08T07:03:38Z","timestamp":1607411018000},"page":"63-86","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Proximity measures based on KKT points for constrained multi-objective optimization"],"prefix":"10.1007","volume":"80","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1938-6316","authenticated-orcid":false,"given":"Gabriele","family":"Eichfelder","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2177-8466","authenticated-orcid":false,"given":"Leo","family":"Warnow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,12,8]]},"reference":[{"key":"971_CR1","doi-asserted-by":"crossref","unstructured":"Abouhawwash, M., Jameel, M.A.: Evolutionary multi-objective optimization using Benson\u2019s Karush\u2013Kuhn\u2013Tucker proximity measure. In: Lecture Notes in Computer Science, Vol. 11411, pp. 27\u201338. Springer (2019)","DOI":"10.1007\/978-3-030-12598-1_3"},{"key":"971_CR2","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.cor.2016.04.026","volume":"79","author":"M Abouhawwash","year":"2017","unstructured":"Abouhawwash, M., Seada, H., Deb, K.: Towards faster convergence of evolutionary multi-criterion optimization algorithms using Karush Kuhn Tucker optimality based local search. Comput. Oper. Res. 79, 331\u2013346 (2017)","journal-title":"Comput. Oper. Res."},{"issue":"5","key":"971_CR3","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1080\/02331930903578700","volume":"60","author":"R Andreani","year":"2011","unstructured":"Andreani, R., Haeser, G., Mart\u00ednez, J.M.: On sequential optimality conditions for smooth constrained optimization. Optimization 60(5), 627\u2013641 (2011)","journal-title":"Optimization"},{"key":"971_CR4","unstructured":"Clarke, F.H.: Optimization and Nonsmooth Analysis, Classics in applied mathematics, Vol.\u00a05. Society for Industrial and Applied Mathematics (1990)"},{"issue":"3","key":"971_CR5","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(3), 1109\u20131140 (2011)","journal-title":"SIAM J. Optim."},{"key":"971_CR6","unstructured":"Deb, K.: Multi-objective Optimization Using Evolutionary Algorithms. John Wiley & Sons (2001)"},{"key":"971_CR7","doi-asserted-by":"crossref","unstructured":"Deb, K., Abouhawwash, M., Dutta, J.: An optimality theory based proximity measure for evolutionary multi-objective and many-objective optimization. In: Lecture Notes in Computer Science, Vol. 9019. Springer (2015)","DOI":"10.1007\/978-3-319-15892-1_2"},{"key":"971_CR8","doi-asserted-by":"crossref","unstructured":"Deb, K., Pratap, A., Meyarivan, T.: Constrained test problems for multi-objective evolutionary optimization. In: Lecture Notes in Computer Science, pp. 284\u2013298. Springer Berlin Heidelberg (2001)","DOI":"10.1007\/3-540-44719-9_20"},{"key":"971_CR9","unstructured":"Durea, M., Dutta, J., Tammer, C.: Stability properties of KKT points in vector optimization. Report No. 18, Martin-Luther-Universit\u00e4t Halle-Wittenberg (2009)"},{"issue":"4","key":"971_CR10","doi-asserted-by":"publisher","first-page":"1463","DOI":"10.1007\/s10898-012-9920-5","volume":"56","author":"J Dutta","year":"2012","unstructured":"Dutta, J., Deb, K., Tulshyan, R., Arora, R.: Approximate KKT points and a proximity measure for termination. J. Glob. Optim. 56(4), 1463\u20131499 (2012)","journal-title":"J. Glob. Optim."},{"key":"971_CR11","volume-title":"Multicriteria Optimization","author":"M Ehrgott","year":"2005","unstructured":"Ehrgott, M.: Multicriteria Optimization. Springer, Berlin New York (2005)"},{"issue":"3","key":"971_CR12","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/s11750-018-0491-6","volume":"26","author":"M Feng","year":"2018","unstructured":"Feng, M., Li, S.: An approximate strong KKT condition for multiobjective optimization. TOP 26(3), 489\u2013509 (2018)","journal-title":"TOP"},{"key":"971_CR13","doi-asserted-by":"crossref","unstructured":"Gebken, B., Peitz, S., Dellnitz, M.: A descent method for equality and inequality constrained multiobjective optimization problems. In: Numerical and Evolutionary Optimization \u2013 NEO 2017, pp. 29\u201361. Springer International Publishing (2018)","DOI":"10.1007\/978-3-319-96104-0_2"},{"issue":"1","key":"971_CR14","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/s10957-016-0986-y","volume":"171","author":"G Giorgi","year":"2016","unstructured":"Giorgi, G., Jim\u00e9nez, B., Novo, V.: Approximate Karush\u2013Kuhn\u2014Tucker condition in multiobjective optimization. J. Optim. Theory Appl. 171(1), 70\u201389 (2016)","journal-title":"J. Optim. Theory Appl."},{"key":"971_CR15","doi-asserted-by":"crossref","unstructured":"Gleixner, A.M., Steffy, D.E., Wolter, K.: Improving the accuracy of linear programming solvers with iterative refinement. In: Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation - ISSAC \u201912. ACM Press (2012)","DOI":"10.1145\/2442829.2442858"},{"key":"971_CR16","unstructured":"G\u00f6pfert, A., Nehse, R.: Vektoroptimierung: Theorie, Verfahren und Anwendungen. Teubner (1990)"},{"key":"971_CR17","doi-asserted-by":"crossref","unstructured":"Jahn, J.: Vector Optimization. Springer, (2004)","DOI":"10.1007\/978-3-540-24828-6"},{"key":"971_CR18","unstructured":"Kesarwani, P., Shukla, P.K., Dutta, J., Deb, K.: Approximations for Pareto and proper Pareto solutions and their KKT conditions. http:\/\/www.optimization-online.org\/DB_HTML\/2018\/10\/6845.html (2019)"},{"key":"971_CR19","doi-asserted-by":"crossref","unstructured":"Miettinen, K.: Nonlinear Multiobjective Optimization. Springer, (1998)","DOI":"10.1007\/978-1-4615-5563-6"},{"issue":"2","key":"971_CR20","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/BF01743536","volume":"10","author":"A Osyczka","year":"1995","unstructured":"Osyczka, A., Kundu, S.: A new method to solve generalized multicriteria optimization problems using the simple genetic algorithm. Struct. Optim. 10(2), 94\u201399 (1995)","journal-title":"Struct. Optim."},{"key":"971_CR21","volume-title":"Theory of Multiobjective Optimization","author":"Y Sawaragi","year":"1985","unstructured":"Sawaragi, Y.: Theory of Multiobjective Optimization. Academic Press, Orlando (1985)"},{"issue":"3","key":"971_CR22","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1162\/evco.1994.2.3.221","volume":"2","author":"N Srinivas","year":"1994","unstructured":"Srinivas, N., Deb, K.: Multiobjective optimization using nondominated sorting in genetic algorithms. Evol. Comput. 2(3), 221\u2013248 (1994)","journal-title":"Evol. Comput."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-020-00971-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-020-00971-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-020-00971-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,18]],"date-time":"2021-05-18T06:14:14Z","timestamp":1621318454000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-020-00971-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,8]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,5]]}},"alternative-id":["971"],"URL":"https:\/\/doi.org\/10.1007\/s10898-020-00971-3","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2020,12,8]]},"assertion":[{"value":"16 December 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 November 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 December 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}