Lecture 2: Guest Lecturer: Jacob Mattingley

author: Jacob Mattingley, Stanford University
published: Aug. 17, 2010,   recorded: January 2008,   views: 5184
released under terms of: Creative Commons Attribution Non-Commercial (CC-BY-NC)
Categories

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.
  Delicious Bibliography

Description

Today, we’re going to be talking about convex sets. I’ll start off by just describing what an affine set is and then a convex set. We’ll go through some examples, then we’ll talk about how you make more complicated convex sets from simpler ones and talk about a few other topics towards the end. This should be review to start off. We can form from any two points – we can parameterize the line going through those two points using a parameter such as Theta. In this example, ? can vary over the whole real line, and it should trace out the whole line. ...

See the whole transcript at Convex Optimization I - Lecture 02

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: