# MIT15.084JS04

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.

- Kind: Talk
- By: MIT OpenCourseWare
- Genres: Education, Science
- Archive: [Internet Archive](https://archive.org/details/MIT15.084JS04)
- Licence or status: [CC BY-NC-SA 3.0](http://creativecommons.org/licenses/by-nc-sa/3.0/) (as the archive states it)
- Who can watch: Tweens profiles and older (the archive gives no rating; placed by Invisible Network from its collection and subjects)

Not offered: its uploader states a Creative Commons licence, but that it is the rights holder's is not shown: its record does not date the work from 2002, when the licences were first published, or the work is another's (an older work under a later date, or a video set to another's song), and nothing else the site holds shows where it is free. Unclear is not offered.