0
(
ratings
)
1
students
Created by:
![Profile Photo](https://opencoursa.com/wp-content/uploads/avatars/210/5ee67051de6ff-bpfull.png)
Last updated:
Duration:
This course includes:
Unlimited Duration
Badge on Completion
Certificate of completion
Unlimited Duration
Description
6.252J/ 15.084J Nonlinear Programming (Spring 2004, MIT OCW). Instructor: Professor Robert Freund.
This consists of 3 selected video lectures given by Prof. Robert Freund. 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. (from ocw.mit.edu)
Course Curriculum
- Lecture 03 – Newton’s Method Unlimited
- Lecture 18 – Duality Theory I Unlimited
- Lecture 23 – Semidefinite Optimization I Unlimited
About the instructor
Instructor Rating
Reviews
Courses
Students
![Profile Photo](https://opencoursa.com/wp-content/uploads/avatars/210/5ee67051de6ff-bpfull.png)