Stanford EE364A Convex Optimization I Stephen Boyd I 2023 I Lecture 2 

I wish you great health for the coming decades Stephen

Thanks for making these lectures available.

I appreciate the lecture! I have some questions about generalized inequalities: 1) when it comes to generalized inequalities, do we need to pick two elements from a given proper cone? or any two elements from the space that contains the proper cone? or no restrictions? 2) Why the interior of positive semidefinite cone is the set of positive definite? 3) any example that shows a set of "minimal" points? The example in the book shows the unique point which is the intersection of the set of elements that are comparable to X2 and a convex set that contains X2.

I would like to do the homework. Could anyone share the problems?

Oh man this is great!

I think the P inverse is to make it an analogue to the r radius from the ball definition

Can anyone refer me to a material that gets me ready for this ? in maths i mean

❤

2:46 What's the title of the book?

i dont understand when he says a cone cant contain a line?

Optimisation theory class of NIT KKR😢