Course

ECE271A - Principles of Optimization: Convex Optimization

Units: 4

Co-requisits: Matrix Analysis and Computation

Instructor(s): Chandrasekaran

Syllabus:

Linear programming: simplex and revised simplex method, duality theory, primal-dual algorithms, Karmarkar's algorithm. Network flow problems: max-flow/min-cut theorem, Ford-Fulkerson algorithm, shortest path algorithms. Complexity and NP-completeness theory: the classes of P and NP, reductions between NP-complete problems, pseudopolynomial and approximation algorithms.