Optimization: Theory and Algorithms

author: Robert Vanderbei, Department of Operations Research and Financial Engineering, Princeton University
published: Jan. 15, 2013,   recorded: April 2012,   views: 12447


Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.
  Delicious Bibliography

 Watch videos:   (click on thumbnail to launch)

Watch Part 1
Part 1 1:02:10
Watch Part 2
Part 2 45:22
Watch Part 3
Part 3 1:06:24
Watch Part 4
Part 4 39:54
Watch Part 5
Part 5 55:55
Watch Part 6
Part 6 42:03


The course will cover linear, convex, and parametric optimization. In each of these areas, the role of duality will be emphasized as it informs the design of efficient algorithms and provides a rigorous basis for determining optimality. Various versions of the Simplex Method for linear programming will be presented. The dangers of degeneracy and ways to avoid it will be explained. Also, both the worst-case and average-case efficiency of the algorithms will be described. Finally, an efficient algorithm for parametrically solving multi-objective optimization problems will be presented, analyzed, and proposed as a new algorithm for sparse regression.

See Also:

Download slides icon Download slides: mlss2012_vanderbei_theory_algorithms.pdf (8.7┬áMB)

Help icon Streaming Video Help

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: