Material Detail

Lecture 19: Interior-Point Methods (Cont.)

Lecture 19: Interior-Point Methods (Cont.)

This video was recorded at Stanford Engineering Everywhere EE364A - Convex Optimization I. In these methods, a feasibility method or a phase one method, the job is to figure out whether a set of convex inequalities and equalities is feasible or not. So that's – and this is sort of the very traditional way, where you divide it into a phase one and the phase two. ... See the whole transcript at Convex Optimization I - Lecture 19... Show More


  • 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.