ORI 391Q.1
Nonlinear Programming
Theory and solution techniques for nonlinear, continuous optimization problems. Topological properties of functions, general convexity, optimality conditions, line search methods, unconstrained techniques, and algorithms for constrained formulations. Lagrangian duality theory and bundle methods for nondifferentiable optimization.
Prerequisites & course information
Theory and solution techniques for nonlinear, continuous optimization problems. Topological properties of functions, general convexity, optimality conditions, line search methods, unconstrained techniques, and algorithms for constrained formulations. Lagrangian duality theory and bundle methods for nondifferentiable optimization.
Sources
- Course catalogue ↗2026-2027