- Spons. Awards
- CCDC Online
- Visitor's Info.
Principles of Optimization: Convex Optimization
Course Number: ECE271A Edit
Focus Area: Optimization and Optimal Control
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.
|Course Number||Course Name||Faculty||Quarter|
|ECE271A||Principles of Optimization: Convex Optimization||Khammash||2015b Spring|
|ECE271A||Principles of Optimization: Convex Optimization||Khammash||2014b Spring|
|ECE271A||Principles of Optimization: Convex Optimization||Khammash||2011b Spring|
|ECE271A||Principles of Optimization: Convex Optimization||Khammash||2008d Fall|
|ECE271A||Principles of Optimization: Convex Optimization||Khammash||2006b Spring|