“凸优化” 是指目标函数为凸函数且由约束条件得到的定义域为凸集的优化问题。文章是MIT的公开课讲义。-"Convex optimization" refers to the objective function is convex function and the constraint conditions are the domain of optimization problem for convex set. Article is MIT public class notes.

权威凸优化学习资料，清华大学研究生课程资料。(Authority convex optimization learning materials, Tsinghua University graduate course materials.)