Optimization Theory (2011 Fall)
|Course||Optimization Theory (Lectures in English)|
|Hours||3 hours (MW 9:30-10:45AM)|
|Instructor||Prof. Hyunggon Park|
|Office||Engineering A Bldg. 514|
Concentrates on recognizing and solving linear and convex optimization problems that arise in engineering. Linear programming, duality, simplex method, convex sets, functions, and optimization problems. Optimality conditions, duality theory, theorems of alternative, and applications. Applications to signal processing, control, digital and analog circuit design, computational geometry, statistics, and mechanical engineering.
Texts and References
- S. Boyd and L. Vandenberghe, Convex Optimization, Cambridge University Press. (Not mandatory)
- D. Bertsimas and J. N. Tsitsiklis, Introduction to linear optimization (Athena Scientific).
- D. Bertsekas, Nonlinear Programming, Athena Scientific.
Course Structures and Teaching Methods
Course Requirements and Assignments
Students are required to do their homework.
Evaluation and Grades
- Homework (20%)
- Midterm Exam (30%)
- Final Exam (50%)
Tentative Course Outline
A tentative list of the covered topics:
- Review of basic linear algebra
- Geometry of linear programming problems
- Linear programming problems
- The simplex method
- Convex set, convex functions
- Convex optimization problems
- Numerical linear algebra
- Other related topics