Introduction to Optimization Theory

Nima Rezaeian, EECS Undergraduate Student, UC Berkeley

An introduction to the theory of discrete optimization algorithms is given, and some practical applications are explored. Shortest paths, minimum spanning trees, traveling salesman, and max-flow are given as examples of discrete problems. Convex optimization is discussed as a method to solve hard discrete problems. Linear, Quadratic and Conic Programming are discussed. Prior knowledge of calculus would be helpful.

Date: February 4, 2021