Material Detail

Lecture 11: Sequential Convex Programming

Lecture 11: Sequential Convex Programming

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


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

More about this material


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