Unconstrained optimization: line search methods, steepest descent, Newton and quasi Newton methods, the conjugate gradient method constrained optimization: equality and inequality constraints, linear constraints and duality, linear programming, the simplex method, Lagrange multiplier algorithms, interior point methods, penalty methods, large scale optimization.
For further information see the academic catalog: IAM566 - Numerical Optimization