Lecture 4: Vector Composition
published: Aug. 17, 2010, recorded: January 2008, views: 3630
released under terms of: Creative Commons Attribution Non-Commercial (CC-BY-NC)
Report a problem or upload filesIf 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.
And here you want to know about the operations that preserve convexity, and we look at sort of the really obvious simple ones, you know, nonnegative weighted sum, that’s kind of obvious. Composition if an affine function, that’s also very easy to show. Pointwise maximum supremum, we looked at examples too, and by the time you get to sort of supremum, you can actually start showing convexity of some things that at first glance look pretty complicated. ...
See the whole transcript at Convex Optimization I - Lecture 04
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !