文件名称:Convex-optimization
介绍说明－－下载内容均来自于网络，请自行研究使用
“凸优化” 是指目标函数为凸函数且由约束条件得到的定义域为凸集的优化问题。文章是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.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
MIT开放课：凸分析和最优化
.........................\6253cover.pdf
.........................\lec_1.pdf
.........................\lec_10.pdf
.........................\lec_11.pdf
.........................\lec_12.pdf
.........................\lec_13.pdf
.........................\lec_14.pdf
.........................\lec_15.pdf
.........................\lec_16.pdf
.........................\lec_17.pdf
.........................\lec_18.pdf
.........................\lec_19.pdf
.........................\lec_2.pdf
.........................\lec_20.pdf
.........................\lec_21.pdf
.........................\lec_22.pdf
.........................\lec_23.pdf
.........................\lec_24.pdf
.........................\lec_25.pdf
.........................\lec_26.pdf
.........................\lec_3.pdf
.........................\lec_4.pdf
.........................\lec_5.pdf
.........................\lec_6.pdf
.........................\lec_7.pdf
.........................\lec_8.pdf
.........................\lec_9.pdf
.........................\new_look.pdf