.png){kind=icon}
Return
Copositive optimization - Recent developments and applications
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2011.04.026.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Clique number
Completely positive matrix
Convexity gap
Crossing number
Robust optimization
Standard quadratic optimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available
Cited Papers
Optimal Pavement Design and Maintenance Strategy for Developing Countries: An Analysis using HDM-4
PREAI
ShareSave
Factor Analytic Models: Viewing the Structure of an Assessment Instrument From Three Perspectives
OAAI
OAAIShareSaveRegularity versus degeneracy in dynamics, games, and optimization: A unified approach to different aspects.png)
SIAM REVIEW
SIAM REVIEWIF6.1
PREAI
ShareSaveShareSaveShareSave
View more