Lecture 19: Interior-Point Methods (Cont.)

author: Stephen P. Boyd, Department of Electrical Engineering, Stanford University
published: Aug. 17, 2010,   recorded: January 2008,   views: 3244
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.


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

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: