Topology of Pareto sets of strongly convex problems

From MaRDI portal
Publication:4971019

DOI10.1137/19M1271439zbMATH Open1454.90054arXiv1904.03615OpenAlexW3090972983MaRDI QIDQ4971019FDOQ4971019


Authors: Naoki Hamada, Kenta Hayano, Shunsuke Ichiki, Yutaro Kabata, Hiroshi Teramoto Edit this on Wikidata


Publication date: 8 October 2020

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Abstract: A multiobjective optimization problem is simplicial if the Pareto set and front are homeomorphic to a simplex and, under the homeomorphisms, each face of the simplex corresponds to the Pareto set and front of a subproblem. In this paper, we show that strongly convex problems are simplicial under a mild assumption on the ranks of the differentials of the objective mappings. We further prove that one can make any strongly convex problem satisfy the assumption by a generic linear perturbation, provided that the dimension of the source is sufficiently larger than that of the target. We demonstrate that the location problems, a biological modeling, and the ridge regression can be reduced to multiobjective strongly convex problems via appropriate transformations preserving the Pareto ordering and the topology.


Full work available at URL: https://arxiv.org/abs/1904.03615




Recommendations




Cites Work


Cited In (5)

Uses Software





This page was built for publication: Topology of Pareto sets of strongly convex problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4971019)