arrow
返回

Copositive optimization - Recent developments and applications

delete2012-02-01
delete117
PRE
AI
I
Immanuel M. Bomze *
DOI:10.1016/j.ejor.2011.04.026delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

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总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

European Journal of Operational Research 封面图
European Journal of Operational Research
IF:
6
论文数:
2.2W
被引数:
6.4W

机构

暂无机构信息
引用论文

引用论文

Constraint-Programmierung
err1997-01-01
err0
PREAI
errThom Frühwirth; Slim Abdennadher
err分享
err收藏
err
IF0
err
err0
PREAI
err
err分享
err收藏
学者 查看更多内容