Principles of Optimization: Convex Optimization

Course Number: ECE271A     Edit
Focus Area: Optimization and Optimal Control
Units: 4
Faculty Responsible:
Course Co-requisits:
Short Description:
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.