搜索结果: 1-1 共查到“管理学 Non-Convex Problems”相关记录1条 . 查询时间(0.078 秒)
Semidefinite Programming Relaxations of Non-Convex Problems in Control and Combinatorial Optimization
Semidefinite Programming Relaxations Non-Convex Problems Control Combinatorial Optimization
2015/7/13
We point out some connections between applications of semidefinite programming in control and in combinatorial optimization. In both fields semidefinite programs arise as convex relaxations of NP-hard...