Lecture 11: Sequential Convex Programming
author: Stephen P. Boyd,
Department of Electrical Engineering, Stanford University
published: July 21, 2010, recorded: April 2008, views: 3581
released under terms of: Creative Commons Attribution Non-Commercial (CC-BY-NC)
published: July 21, 2010, recorded: April 2008, views: 3581
released under terms of: Creative Commons Attribution Non-Commercial (CC-BY-NC)
Related content
Report a problem or upload files
If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Description
The good news is that we can actually pull this off, I think, in one day. So we’re going to come back later. There’ll be several other lectures on problems that are not convex and various methods. There’s going to be a problem on reluxations. We’re going to have a whole study of L1 type methods for sparse solutions. Those will come later. But this is really our first foray outside of convex optimization. ...
See the whole transcript at Convex Optimization II - Lecture 11
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !
Write your own review or comment: