图 书 馆
通过连续方法解决离散优化问题Tackling discrete optimization problems by continuous methods |
|
| 课程网址: | http://videolectures.net/8ecm2021_dur_tackling_discrete/ |
| 主讲教师: | Mirjam Dür |
| 开课单位: | 奥格斯堡大学 |
| 开课时间: | 2021-07-06 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | Many NP-hard discrete and combinatorial optimization problems can be formulated with the help of quadratic expressions. These in turn can be linearized by lifting the problem from n-dimensional space to the space of n by n matrices. We show that this leads to a conic optimization problem, i.e., an optimization problem in matrix variables where a constraint requires the matrix to be in the cone of so called copositive or completely positive matrices. The complexity of the original problem is entirely shifted into the cone constraint. We discuss the pros and cons of this approach, and we review the state of the art in this area, covering both theory and numerical solution approaches. |
| 关 键 词: | 离散组合; 连续方法; 圆锥约束 |
| 课程来源: | 视频讲座网 |
| 数据采集: | 2022-03-27：hqh |
| 最后编审: | 2022-03-27：hqh |
| 阅读次数: | 69 |