3 citations · 9 across the 8 of their papers we have counts for
8 papers · 1 filter
Bézier Flow: a Surface-wise Gradient Descent Method for Multi-objective Optimization
Akiyoshi Sannai, Yasunari Hikima, Ken Kobayashi +2
In this paper, we propose a strategy to construct a multi-objective optimization algorithm from a single-objective optimization algorithm by using the Bézier simplex model. Also, w…
A Two-phase Framework with a Bézier Simplex-based Interpolation Method for Computationally Expensive Multi-objective Optimization
Ryoji Tanabe, Youhei Akimoto, Ken Kobayashi +3
This paper proposes a two-phase framework with a Bézier simplex-based interpolation method (TPB) for computationally expensive multi-objective optimization. The first phase in TPB…
All unconstrained strongly convex problems are weakly simplicial
Yusuke Mizota, Naoki Hamada, Shunsuke Ichiki
A multi-objective optimization problem is weakly simplicial if there exists a surjection from a simplex onto the Pareto set/front such that the image of each subsimplex…
Simpliciality of strongly convex problems
Naoki Hamada, Shunsuke Ichiki
A multiobjective optimization problem is simplicial if the Pareto set and the Pareto front are diffeomorphic to a simplex and, under the diffeomorphisms, each fac…
Characterization of the equality of weak efficiency and efficiency on convex free disposal hulls
Naoki Hamada, Shunsuke Ichiki
In solving a multi-objective optimization problem by scalarization techniques, solutions to a scalarized problem are, in general, weakly efficient rather than efficient to the orig…
Topology of Pareto sets of strongly convex problems
Naoki Hamada, Kenta Hayano, Shunsuke Ichiki +2
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…