期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 216, 期 3, 页码 509-520出版社
ELSEVIER
DOI: 10.1016/j.ejor.2011.04.026
关键词
Clique number; Completely positive matrix; Convexity gap; Crossing number; Robust optimization; Standard quadratic optimization
Due to its versatility, copositive optimization receives increasing interest in the Operational Research community, and is a rapidly expanding and fertile field of research. It is a special case of conic optimization, which consists of minimizing a linear function over a cone subject to linear constraints. The diversity of copositive formulations in different domains of optimization is impressive, since problem classes both in the continuous and discrete world, as well as both deterministic and stochastic models are covered. Copositivity appears in local and global optimality conditions for quadratic optimization, but can also yield tighter bounds for NP-hard combinatorial optimization problems. Here some of the recent success stories are told, along with principles, algorithms and applications. (C) 2011 Published by Elsevier B.V.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据