Lecture 12: Recap: 'Difference Of Convex' Programming
author: Stephen P. Boyd,
Department of Electrical Engineering, Stanford University
published: July 21, 2010, recorded: April 2008, views: 3847
released under terms of: Creative Commons Attribution Non-Commercial (CC-BY-NC)
published: July 21, 2010, recorded: April 2008, views: 3847
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
Let's see, a couple of other things. Oh, you should watch for email, and maybe the web site, because we may tape ahead next -Tuesday's lecture tomorrow some time. So – and we would. You'll hear about that. Okay. So, I can't think of any other administrative things. I guess we posted a new homework, but I guess most of you know that. Any questions about last time? Because if not, what we're gonna do is we're gonna finish up this topic of Heuristics based on convex optimization for solving the non-convex problem. ...
See the whole transcript at Convex Optimization II - Lecture 12
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: