|
FIVE LECTURES
ON
MODERN CONVEX OPTIMIZATION
From
Linear to Conic Programming
Conic
Quadratic Programming
Semidefinite
Programming
Polynomial
Time Interior Point Algorithms for LP, CQP and SDP
Simple
Methods for Extremely Large-Scale Problems
All lectures are
files.
|