Date
Thu, 21 Jan 2021
14:00
Location
Virtual
Speaker
Stephen Boyd
Organisation
Stanford University

Specialized languages for describing convex optimization problems, and associated parsers that automatically transform them to canonical form, have greatly increased the use of convex optimization in applications. These systems allow users to rapidly prototype applications based on solving convex optimization problems, as well as generate code suitable for embedded applications. In this talk I will describe the general methods used in such systems.

 

--

A link for this talk will be sent to our mailing list a day or two in advance.  If you are not on the list and wish to be sent a link, please contact @email.

Please contact us with feedback and comments about this page. Last updated on 03 Apr 2022 01:32.