返回
Copositive optimization - Recent developments and applications
DOI:10.1016/j.ejor.2011.04.026.png)
摘要
En 中文
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.
Keyword:
Clique number
Completely positive matrix
Convexity gap
Crossing number
Robust optimization
Standard quadratic optimization
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
Regularity versus degeneracy in dynamics, games, and optimization: A unified approach to different aspects
SIAM REVIEW
IF6.1

