Material Detail

Lecture 12: Recap: 'Difference Of Convex' Programming

Lecture 12: Recap: 'Difference Of Convex' Programming

This video was recorded at Stanford Engineering Everywhere EE364B - Convex Optimization II. 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

Quality

  • User Rating
  • Comments
  • Learning Exercises
  • Bookmark Collections
  • Course ePortfolios
  • Accessibility Info

More about this material

Comments

Log in to participate in the discussions or sign up if you are not already a MERLOT member.