Stanford Engineering Everywhere EE364A - Convex Optimization I

Concentrates on recognizing and solving convex optimization problems that arise in engineering. Convex sets, functions, and optimization problems. Basics of convex analysis. Least-squares, linear and quadratic programs, semidefinite programming, minimax, extremal volume, and other problems. Optimality conditions, duality theory, theorems of alternative, and applications. Interiorpoint methods. Applications to signal processing, control, digital and analog circuit design, computational geometry, statistics, and mechanical engineering.

Prerequisites: *Good knowledge of linear algebra. *Exposure to numerical computing, optimization, and application fields helpful but not required; the engineering applications will be kept basic and simple.

Course Homepage: [[http://see.stanford.edu/see/courseinfo.aspx?coll=2db7ced4-39d1-4fdb-90e8-364129597c87]]

Course features at Stanford Engineering Everywhere page: *Convex Optimization I *Lectures *Syllabus *Handouts *Assignments *Exams *Software