Econ 536b. Optimization Techniques

Printer-friendly versionPDF version
Course Type: 
Graduate
Course term: 
Not offered
Year: 
2015

Fundamental theory and algorithms of optimization, emphasizing convex optimization. The geometry of convex sets, basic convex analysis, the principle of optimality, duality. Numerical algorithms: steepest descent, Newton’s method, interior point methods, dynamic programming, unimodal search. Applications from engineering and the sciences.

Prerequisites: MATH 120 and 222, or equivalents. May not be taken after AMTH 237.

[Also ECON 413 / AMTH 437 / EENG437]

Semester offered: 
Not offered