## MIT 15.084J / 6.252J Nonlinear Programming - Spring 2004

released under terms of: Creative Commons Attribution No Derivatives (CC-BY-ND)

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.

**Course Highlights**

Nonlinear Programming features videos of three key lectures in their entirety. A set of comprehensive lecture notes are also available, which explains concepts with the help of equations and sample exercises.

**Course Homepage:** 15.084J / 6.252J Nonlinear Programming Spring 2004

**Course features at MIT OpenCourseWare page:**

prachit, July 18, 2012 at 3:58 a.m.:i want to know about programming logic controller .plz tell me any free course.

m, December 24, 2013 at 7:53 p.m.:why don't you display all the lectures

just 3, 18, 23 only!!!

Shaw, July 8, 2014 at 3:15 p.m.:I strongly suggest to make all the video lectures public!