Lecture 18: Announcements

author: Stephen P. Boyd, Department of Electrical Engineering, Stanford University
published: July 21, 2010,   recorded: April 2008,   views: 2583
released under terms of: Creative Commons Attribution Non-Commercial (CC-BY-NC)

Related Open Educational Resources

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.
Lecture popularity: You need to login to cast your vote.


But you’re not gonna give up globalness – globality? You’re gonna give up neither globalness nor globality but you are gonna give up speed. So what’s gonna happen is these are gonna be methods that are slow but they don’t lie. They will produce a – at any point you can stop them and exactly like a convex optimization method they will have a lower bound and they will have an upper bound. ...

See the whole transcript at Convex Optimization II - Lecture 18

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:

make sure you have javascript enabled or clear this field: