# Nonlinear Programming

Photo of the course textbook cover, written by the course instruction, Prof. Dimitri Bertsekas. (Image courtesy of Dimitri Bertsekas and Athena Scientific.)

### Instructor(s)

Prof. Dimitri Bertsekas

### MIT Course Number

6.252J / 15.084J

### As Taught In

Spring 2003

### Level

Graduate

###

Some Description
Instructor(s) | Prof.
As Taught In | Spring 2002
Course Number | 2.24
Level | Undergraduate/Graduate
Features | Lecture Notes, Student Work

## Course Description

## Course Features

- Lecture notes

## Course Description

6.252J is a course in the department's "Communication, Control, and Signal Processing" concentration. This course provides a unified analytical and computational approach to nonlinear optimization problems. The topics covered in this course include: unconstrained optimization methods, constrained optimization methods, convex analysis, Lagrangian relaxation, nondifferentiable optimization, and applications in integer programming. There is also a comprehensive treatment of optimality conditions, Lagrange multiplier theory, and duality theory. Throughout the course, applications are drawn from control, communications, power systems, and resource allocation problems.

## Other Versions

## Other OCW Versions

OCW has published multiple versions of this subject.

- 15.084J Nonlinear Programming (Spring 2004)

## Related Content

## Course Collections

See related courses in the following collections:

### Find Courses by Topic

- Computer Science > Theory of Computation
- Systems Engineering
- Systems Engineering > Systems Optimization

Dimitri Bertsekas. 6.252J Nonlinear Programming. Spring 2003. Massachusetts Institute of Technology: MIT OpenCourseWare, https://ocw.mit.edu. License: Creative Commons BY-NC-SA.

For more information about using these materials and the Creative Commons license, see our Terms of Use.