Copositive Programming – a Survey
By Mirjam Dür. 2010
282 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics, Electrical and Electronic Engineering, Numerical Analysis
View Paper: https://www.semanticscholar.org/paper/542b41a22aa4ce369e647a0c68ac5806b093b05b
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
- Roland Hildebrand
- Peter J. C. Dickinson
- Adam N. Letchford
- Luuk Gijben
- M. Duer
- S. Burer
- Mirjam Dür
- Juan Pablo Vielma
In Electrical and Electronic Engineering
In Numerical Analysis
- Roland Hildebrand
- Peter J. C. Dickinson
- Adam N. Letchford
- Luuk Gijben
- M. Duer
- S. Burer
- Mirjam Dür
- Guanghui Lan
Citations in the corpus
- AN IMPROVED CHARACTERISATION OF THE INTERIOR OF THE COMPLETELY POSITIVE CONE (2010, background): “Surveys on copositive and completely positive matrices and their cones are provided in [2, 7, 9].”
- Non-convex mixed-integer nonlinear programming: A survey (2012, background): “One can use this fact to derive even stronger SDP relaxations; see the survey [117].”
- Irreducible elements of the copositive cone (2013, background): “Indeed, it has turned out that many combinatorial problems can be formulated as linear problems over this convex matrix cone, for surveys see [8, 11].”