Optimization: Theory and Algorithms
published: Jan. 15, 2013, recorded: April 2012, views: 12436
Report a problem or upload filesIf 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.
Watch videos: (click on thumbnail to launch)
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.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !