抄録
We propose a new dynamics for solving optimization problems constrained in the internal space of a simplex, whose discretization generates chaos. The efficiency of the optimization method which anneals the chaotic trajectories is shown with numerical simulations.
