Lecture 7: Generalized Inequality Constraints

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


It’s a very special case. Everything is affine so it’s equivalent of a linear program basically. A normal optimization problem, if every function is affine you have a linear program because you minimize and affine function, subject to affine functions less than zero because you’re conventionally called linear and inequalities. Affine equality, that’s just conventionally called linear equality constraints. So here, everything is affine. You minimize a linear function. Now this is a very, very interesting inequality. This is affine and this just says that FX + G is less than or equal to zero with respect to this cone. ...

See the whole transcript at Convex Optimization I - Lecture 07

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: