Global optimization in one-dimensional case using analytically defined derivatives of objective function
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.
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova
1995-11-01
|
Series: | Computer Science Journal of Moldova |
Online Access: | http://www.math.md/nrofdownloads.php?file=/files/csjm/v3-n2/v3-n2-(pp168-184).pdf |