ISYE 6663
Nonlinear Optimization
Fundamentals of nonlinear optimization. Topics include optimality conditions; convex programming and duality; unconstrained and constrained methods. Polynomial algorithms and interior point methods. Dual methods. This course is for students seriously considering a PhD.
Topics
- optimality conditions
- convex programming and duality
- unconstrained and constrained methods
Topics explicitly listed in official catalogue description
Sources
- Course catalogue ↗2026-2027