Note: This content is accessible to all versions of every browser. However, this browser does not seem to support current Web standards, preventing the display of our site's design details.

  

Short course on Convex Optimization and Applications, 21, 22, 23, 27 March
Lecture 3: Code Generation for Embedded Convex Optimization

Back
Abstract:
Optimization is typically used for problems that can be solved in a few minutes or seconds; often, with a human in the loop. However, using automatic code generation and specially modified algorithms, we can generate solvers can reliably find solutions in milliseconds or microseconds. Such solvers have potential application in many fields, including signal processing, automatic control, machine learning and finance. In this talk, we first describe the special requirements for and opportunities in embedded convex optimization. We describe CVXGEN, a convenient tool for generating library-free, flat C code ready for compilation into a high-speed solver. CVXGEN is just as simple to use as conventional parser-solvers like CVX or YALMIP, but creates solvers that are thousands of times faster, and suitable for embedding. The primary focus of the talk will be on the techniques used to make the solvers extremely reliable and fast.
Based on joint work by: Jacob Mattingley, Stephen Boyd.

Published recordings: On-demand video.

http://control.ee.ethz.ch/~valice/Boyd_Lec3_Mar2012.pdf
Type of Seminar:
IfA Seminar
Speaker:
Prof. Stephen Boyd
Electrical Engineering, Information Systems Laboratory, Stanford University
Date/Time:
Mar 23, 2012   16:15
Location:

ETF E 1, Sternwartstr. 7
Contact Person:

John Lygeros
File Download:

Request a copy of this publication.
Biographical Sketch:
See Lecture 1