MIT 15.084J / 6.252J Nonlinear Programming - Spring 2004
released under terms of: Creative Commons Attribution Non-Commercial Share Alike (CC-BY-NC-SA)
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.
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:
Reviews and comments:
i want to know about programming logic controller .plz tell me any free course.
why don't you display all the lectures
just 3, 18, 23 only!!!
I strongly suggest to make all the video lectures public!
Information must be for everyone.
if having more lectures...
Dear Professor Freund,
Please share your wonderful lectures! It's very inspiring to see you engage with your talented students.
Lecture notes on "Duality II and Duality III are not available for download. Can they be made available too?
Write your own review or comment: