Nonlinear Programming's Full Profile
This course introduces students to the fundamentals of nonlinear optimization theory and methods. Topics include unconstrained and constrained optimization, linear and quadratic programming, Lagrange and conic duality theory, interior-point algorithms and theory, Lagrangian relaxation, generalized programming, and semi-definite programming. Algorithmic methods used in the class include steepest descent, Newton's method, conditional gradient and subgradient optimization, interior-point methods and penalty and barrier methods.
Feb 01, 2004
to May 25, 2004
Days of the Week:
Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday
- Level of Difficulty: Beginner
- Size: Massive Open Online Course
- Instructor: Prof. Robert Freund
- Cost: Free
- Institution: MIT OCW
About MIT OCW:
MIT OpenCourseWare (OCW) is a web-based publication of virtually all MIT course content. OCW is open and available to the world and is a permanent MIT activity.
Questions about Nonlinear Programming
Want more info about Nonlinear Programming?
Get free advice from education experts and Noodle community members.
MIT OpenCourseWare (MIT OCW) is an initiative of the Massachusetts Institute of Technology (MIT) to put all of the educational materials from its undergraduate- and graduate-level courses online, partly free and openly available to anyone, anywhere.