0


6.253凸分析与优化(麻省理工)

6.253 Convex Analysis and Optimization (MIT)
课程网址: http://ocw.mit.edu/courses/electrical-engineering-and-computer-sc...  
主讲教师: Prof. Dimitri Bertsekas
开课单位: 麻省理工学院
开课时间: 2012-03-15
课程语种: 英语
中文简介:
本课程将重点介绍凸性,对偶性和凸优化算法的基础主题。目的是利用一些易于可视化和易于理解的统一原则,开发连续优化,二元性和鞍点理论的核心分析和算法问题。
课程简介: This course will focus on fundamental subjects in convexity, duality, and convex optimization algorithms. The aim is to develop the core analytical and algorithmic issues of continuous optimization, duality, and saddle point theory using a handful of unifying principles that can be easily visualized and readily understood.
关 键 词: 凸优化算法; 基础学科的对偶; 对偶岩心分析; 算法的问题
课程来源: MIT Course
最后编审: 2020-05-31:王勇彬(课程编辑志愿者)
阅读次数: 417