Authors: A. Shpak
Abstract
A number of algorithms with simple theoretical base (accessible even for non- specialists) for a wide class of global one-dimensional optimization problems is described below. Good rate of convergence is demonstrated with a lot of numerical examples.
A. Shpak
Institute of Mathematics,
Academy of Sciences of Moldova,
5 Academiei str.,
Kishinev, 277028, Moldova
Fulltext

–
0.16 Mb