Advanced Non-Linear Programming

1 Course Unit

Convex sets and functions. Tangent cones. Polar cones. Optimality conditions and duality theory. Methods for unconstrained and constrained optimization. Interior and exterior penalty methods. Lagrangean and augmented Lagrangean methods. Not Offered Every Year Prerequisite: OIDD 9100 1 Course Unit