RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación
Artículo científico (JournalArticle)
Computing Optimal Distances to Pareto Sets of Multi-Objective Optimization Problems in Asymmetric Normed Lattices
[EN] Given a finite dimensional asymmetric normed lattice, we provide explicit formulae for the optimization of the associated (non-Hausdorff) asymmetric distance among a subset and a point. Our analysis has its roots and finds its applications in the current development of effective algorithms for multi-objective optimization programs. We are interested in providing the fundamental theoretical results for the associated convex analysis, fixing in this way the framework for this new optimization tool. The fact that the associated topology is not Hausdorff forces us to define a new setting and to use a new point of view for this analysis. Existence and uniqueness theorems for this optimization are shown. Our main result is the translation of the original abstract optimal distance problem to a clear optimization scheme. Actually, this justifies the algorithms and shows new aspects of the numerical and computational methods that have been already used in visualization of multi-objective optimization problems., This work was supported by the Ministerio de Economia y Competitividad (Spain) under grants DPI2015-71443-R and MTM2016-77054-C2-1-P.