MAT 537 - Nonlinear Programming

Credits: 3

Prerequisite: Advanced calculus and MAT 535. Theory and applications for constrained and unconstrained nonlinear optimization. Theory of convex sets, convex and concave functions, Kuhn–Tucker conditions, duality, algorithm convergence; computational methods including penalty and barrier functions, gradient projection, and quadratic programming.