MIT15.084JS04
MIT OpenCourseWare
EducationScience
Clips are not offered for this film yet: it is in several files, and clips are cut from a film in one.
Low resolution (320×240): this is the archive's own copy.
Parts
About
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.
- Archive
- Internet Archive, in MIT OpenCourseWare
- Licence or status
- CC BY-NC-SA 3.0, as the Internet Archive states it.
- Credit
- MIT OpenCourseWare
- Who can watch
- The archive gives no rating. Invisible Network shows it to Tweens profiles and older, judged from its collection and subjects. How films are placed