Interactive Educational Modules in
Scientific Computing
Home
>
Optimization
The following modules demonstrate algorithms for solving optimization problems.
Optimization in One Dimension
Golden Section Search
Successive Parabolic Interpolation
Newton's Method
Unconstrained Optimization in Two Dimensions
Steepest Descent Method
Conjugate Gradient Method
Newton's Method
BFGS Method
Nelder-Mead Method
Energy Minimization
Constrained Optimization in Two Dimensions
Sequential Quadratic Programming Method
Penalty Function Method
Nonlinear Least Squares
Gauss-Newton Method
Levenberg-Marquardt Method