The Optimization Algorithms

Finding solutions to complex optimization problems can be a difficult task. In general there is no optimization algorithm that works in all cases. Kallistos comes with several efficient algorithms based on recent advances in mathematical optimization with complementing strengths:

• Efficient local descent routines. Ideal for large, computationally intensive structures, which can find an optimum within relatively few iterations.

• Deterministic and stochastic global optimization techniques. These converge more slowly than the above, but are more likely, if not guaranteed, to find a global optimum.

<<< The function parser         The monitoring interface >>>