Convex Problems

June 02, 2011, Elings Hall 1605

Stephen Boyd

Stanford University, Electrical Engineering


We describe general convex optimization, as well as named problem classes, such as linear and quadratic programming, the less well-known geometric programming, and the newer classes second-order cone and semidefinite programming.

Speaker's Bio

Stephen P. Boyd is the Samsung Professor of Engineering, and Professor of Electrical Engineering in the Information Systems Laboratory at Stanford University. He also has a courtesy appointment in the Department of Management Science and Engineering, and is member of the Institute for Computational and Mathematical Engineering. His current research focus is on convex optimization applications in control, signal processing, and circuit design.