Simple Problems: The Simplicial Gluing Structure of Pareto Sets and Pareto Fronts

04/18/2017
by   Naoki Hamada, et al.
0

Quite a few studies on real-world applications of multi-objective optimization reported that their Pareto sets and Pareto fronts form a topological simplex. Such a class of problems was recently named the simple problems, and their Pareto set and Pareto front were observed to have a gluing structure similar to the faces of a simplex. This paper gives a theoretical justification for that observation by proving the gluing structure of the Pareto sets/fronts of subproblems of a simple problem. The simplicity of standard benchmark problems is studied.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/19/2018

Data-Driven Analysis of Pareto Set Topology

When and why can evolutionary multi-objective optimization (EMO) algorit...
research
03/05/2019

Visualisation of Pareto Front Approximation: A Short Survey and Empirical Comparisons

Visualisation is an effective way to facilitate the analysis and underst...
research
03/05/2018

Costs and Rewards in Priced Timed Automata

We consider Pareto analysis of reachable states of multi-priced timed au...
research
06/24/2021

All unconstrained strongly convex problems are weakly simplicial

A multi-objective optimization problem is C^r weakly simplicial if there...
research
02/01/2017

Dominance Move: A Measure of Comparing Solution Sets in Multiobjective Optimization

One of the most common approaches for multiobjective optimization is to ...
research
07/10/2019

The stochastic multi-gradient algorithm for multi-objective optimization and its application to supervised machine learning

Optimization of conflicting functions is of paramount importance in deci...
research
04/05/2022

Pareto-optimal clustering with the primal deterministic information bottleneck

At the heart of both lossy compression and clustering is a trade-off bet...

Please sign up or login with your details

Forgot password? Click here to reset