Performs an optimization of some hard-coded functions of arbitrary dimensions in a rectangular area.
- Fletcher–Reeves nonlinear conjugate gradient method
- Stohastic method (with user-specified parameters)
Optimization process starts in a user-given point of the user-specified rectangular area.
- Number of iterations exceeds some n
- The absolute value difference of the function in two last different points is less than some epsilon
- The relation of value difference of the function in two last different points to the absolute value of the function in the starting point is less than some epsilon Criteria 2 & 3 also check for criterion 1.
TODO:
- Graphical interface
- More functions (probably)