The pre-requisites listed in this catalog are those approved by the Curriculum Committee.
For pre-requisite information specific to an individual instance of a course, please see the schedule of classes. Click the Schedule Type to find available offerings of the course on the Schedule of Classes. |
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.
3.000 Credit hours 3.000 Lecture hours Grade Basis: ALP All Sections for this Course Sch/Industrial & Systems Engr Department |