A powerful method for solving planar eigenvalue problems is the Method of Particular Solutions (MPS), which is also well known under the name "point matching method". In ...
We present a two-phase algorithm for solving large-scale quadratic programs (QPs). In the first phase, gradient-projection iterations approximately minimize an augmented Lagrangian...
Abstract. We present a new derivative-free algorithm, ORBIT, for unconstrained local optimization of computationally expensive functions. A trust-region framework using interpolati...
Stefan M. Wild, Rommel G. Regis, Christine A. Shoe...
Many combinatorial optimization problems in biosequence analysis are solved via dynamic programming. To increase programming productivity and program reliability, a domain specifi...
In this paper, we deal with the problem of synthesizing novel motions of standing-up martial arts such as Kickboxing, Karate, and Taekwondo performed by a pair of humanlike charact...
Taesoo Kwon, Young-Sang Cho, Sang Il Park, Sung Yo...