In this post I give an example of using the previously created BFGS and DFP classes to solve an unconstrained optimization problem. [More]

In this post I develop the BFGS / Broyden Fletcher Goldfarb Shanno class which is a quasi Newton numerical method that can be used for unconstrained optimization problems. [More]

In this post I develop the DFP / Davidon Fletcher Powell class which is a quasi Newton numerical method that can be used for unconstrained optimization problems. [More]

In this post I develop the quasi Newton base class which will be used as the base class for algorithms that implement quasi Newton numerical methods, such as the DFP and BFGS algorithms. [More]

In this post I develop the code for the cubic bracketing class. [More]

In this post I develop the code for the Swann bracketing class. [More]

In this post I develop the code for the bracketing base class. [More]

In this post I develop the code for the cubic region elimination class. [More]

In this post I develop the code for the parabolic region elimination class. [More]

In this post I develop the code for the golden section region elimination class. [More]

In this post I develop the code for the interval halving region elimination class. [More]

In this post I create the base classes used by the region elimination optimization routines. [More]

In this post I will develop a function on the Polynomial class that takes four points, fits a third order polynomial (a cubic) to them, and then attempts to find the minimum value of the polynomial. [More]

In this post I will develop a function on the Polynomial class that takes three points, fits a second order polynomial (a parabola) to them, and then attempts to find the minimum value of the polynomial. [More]