MATH 663 - Nonlinear Programming

Three hours.
3 Credits

The course will explore the fundamentals of nonlinear programming, both unconstrained and constrained optimization. The theoretical aspect of the course will focus on convexity, duality and optimality conditions. The algorithmic aspect of the course will develop various methodologies for unconstrained optimization and constrained optimization methods. The application aspect of the course will help students recognize and develop nonlinear programming models for problems in science and engineering.

Prerequisite(s) Departmental permission
Co-Requisite(s) None
Offered FALL OR SPRING