Publication at Faculty of Mathematics and Physics |
2001
Abstract
Nonconvex optimization problems are, after a relaxation, approximated numerically and an efficient multilevel adaptiv maximum-princple-based algorithm is proposed and tested.
Nonconvex optimization problems are, after a relaxation, approximated numerically and an efficient multilevel adaptiv maximum-princple-based algorithm is proposed and tested.