Unconstrained and equality optimization models, constrained problems, optimality conditions for constrained extrema, convex sets and functions, duality in nonlinear convex programming, descent methods, conjugate direction methods and quasi-Newton methods. Students taking this course are expected to have knowledge in advanced calculus.