Zobrazeno 1 - 10
of 351
pro vyhledávání: '"Hamada, Naoki"'
The purpose of this paper is to understand generic behavior of constraint functions in optimization problems relying on singularity theory of smooth mappings. To this end, we will focus on the subgroup $\mathcal{K}[G]$ of the Mather's group $\mathcal
Externí odkaz:
http://arxiv.org/abs/2407.12333
In this paper, we propose a strategy to construct a multi-objective optimization algorithm from a single-objective optimization algorithm by using the B\'ezier simplex model. Also, we extend the stability of optimization algorithms in the sense of Pr
Externí odkaz:
http://arxiv.org/abs/2205.11099
Autor:
Tanabe, Ryoji, Akimoto, Youhei, Kobayashi, Ken, Umeki, Hiroshi, Shirakawa, Shinichi, Hamada, Naoki
This paper proposes a two-phase framework with a B\'{e}zier simplex-based interpolation method (TPB) for computationally expensive multi-objective optimization. The first phase in TPB aims to approximate a few Pareto optimal solutions by optimizing a
Externí odkaz:
http://arxiv.org/abs/2203.15292
Autor:
Takada, Atsushi, Yamazaki, Daichi, Liu, Likun, Yoshida, Yudai, Ganbat, Nyamkhuu, Shimotomai, Takayuki, Yamamoto, Taiga, Sakurai, Daisuke, Hamada, Naoki
This article presents our generative model for rhythm action games together with applications in business operations. Rhythm action games are video games in which the player is challenged to issue commands at the right timings during a music session.
Externí odkaz:
http://arxiv.org/abs/2202.12823
Autor:
Ota, Ryosuke, Hagiwara, Reiya, Hamada, Naoki, Liu, Likun, Yamamoto, Takahiro, Sakurai, Daisuke
In multi-objective optimization, designing good benchmark problems is an important issue for improving solvers. Controlling the global location of Pareto optima in existing benchmark problems has been problematic, and it is even more difficult when t
Externí odkaz:
http://arxiv.org/abs/2110.03196
A multi-objective optimization problem is $C^r$ weakly simplicial if there exists a $C^r$ surjection from a simplex onto the Pareto set/front such that the image of each subsimplex is the Pareto set/front of a subproblem, where $0\leq r\leq \infty$.
Externí odkaz:
http://arxiv.org/abs/2106.12704
B\'ezier simplex fitting algorithms have been recently proposed to approximate the Pareto set/front of multi-objective continuous optimization problems. These new methods have shown to be successful at approximating various shapes of Pareto sets/fron
Externí odkaz:
http://arxiv.org/abs/2104.04679
In this paper, the ranges of bilinear pseudo-differential operators of $S_{0,0}$-type on $L^2 \times L^2$ are determined in the framework of Besov spaces. Our result improves the $L^2 \times L^2 \to L^1$ boundedness of those operators with symbols in
Externí odkaz:
http://arxiv.org/abs/2010.13280
Autor:
Hamada, Naoki, Ichiki, Shunsuke
A multiobjective optimization problem is $C^r$ simplicial if the Pareto set and the Pareto front are $C^r$ diffeomorphic to a simplex and, under the $C^r$ diffeomorphisms, each face of the simplex corresponds to the Pareto set and the Pareto front of
Externí odkaz:
http://arxiv.org/abs/1912.09328
Autor:
Hamada, Naoki, Ichiki, Shunsuke
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 original problem. Thus, it is crucial to understand what problem ensures t
Externí odkaz:
http://arxiv.org/abs/1910.02867