Computing and Optimization Fall 2016, Princeton University (undergraduate course)
(This is the Fall 2016 version of this course. For the Fall 2015 version click here. For the Fall 2014 version click here.)
Useful links
Lectures The lecture notes below summarize most of what I cover on the blackboard during class. Please complement them with your own notes. Some lectures take one class session to cover, some others take two.
 Lecture 1: Let's play two games! (Optimization, P and NP.)
[pdf], [ppt]
 Lecture 2: What you should remember from linear algebra and multivariate calculus.
[pdf]
 Lecture 3: Unconstrained optimization, least squares, optimality conditions.
[pdf]
 Lecture 4: Convex optimization I.
[pdf]
 Lecture 5: Convex optimization II.
[pdf]
 CVX: Basic examples.
[m]
 Lecture 6: Applications in statistics and machine learning: LASSO + Support vector machines (SVMs)
[pdf]
 Lecture 7: Root finding and line search. Bisection, Newton, and secant methods.
[pdf]
 Lecture 8: Gradient descent methods, analysis of steepest descent, convergence and rates of convergence, Lyapunov functions for proving convergence.
[pdf]
 Lecture 9: Multivariate Newton, quadratic convergence, Armijo stepsize rule, nonlinear least squares and the GaussNewton algorithm.
[pdf]
 Lecture 10: Conjugate direction methods, solving linear systems, Leontief economy.
[pdf]
 Lecture 11: Linear programming: applications, geometry, and the simplex algorithm.
[pdf]
 Lecture 12: Duality + robust linear programming (optional lecture)
[pdf]
 Lecture 13: Semidefinite programming + SDP relaxations for nonconvex optimization.
[pdf]
 Lecture 14: A working knowledge of computational complexity theory for an optimizer.
[pdf]  Lecture 15: Discrete optimization at IBM Research, William Pierson Field Lecture, Dr. Sanjeeb Dash (IBM Research).
[pdf]
 Lecture 16: Limits of computation + course recap.
[pdf]
Problem sets and exams Solutions are posted on Blackboard. Exams are also posted on Blackboard.
 Homework 1: A new challenger, perfect numbers, and a review of linear algebra, multivariate calculus, and MATLAB.
[pdf]
 Homework 2: Image compression and SVD, local and global minima, positive semidefinite matrices, convex sets.
[pdf], [turing.jpg]
 Homework 3: Convex and quasiconvex functions, regression under different penalties, minimizers of convex problems.
[pdf]
 Homework 4: Support Vector Machines (SVMs), Hillary or Bernie?
[pdf], [HWSVM.mat], [Hillary_vs_Bernie.mat]
 Practice Midterm (Fall 2014 and Fall 2015)
[pdf], [pdf]
 Midterm
[pdf]
 Homework 5: Halloween in Manhattan, theoryapplication split in a course, Newton fractals, univariate minimization.
[pdf]  Homework 6:

