Lecture 6: Addendum: Hit-And-Run CG Algorithm

author: Stephen P. Boyd, Department of Electrical Engineering, Stanford University
published: July 21, 2010,   recorded: April 2008,   views: 2736
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.


There’s got to be an opening paragraph. In fact, we were even thinking of defining a formal XML scheme or whatever for it. But it’s got to be a paragraph that has nothing but English and says kinda what the context of the problem is. So for example, I’m doing air traffic control or I’m blending covariant matrices from disparate sources or something like that. And says a little bit about what the challenges are and what you’ll consider. ...

See the whole transcript at Convex Optimization II - Lecture 06

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: