摘要：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.
