Robust optimization and stochastic optimization are the two main paradigms for dealing with
the uncertainty inherent in almost all real-world optimization problems. The core principle of …

In het leven streven we vaak naar het beste, of het er nu om gaat het snelste te zijn, het
sterkste, het meest efficiënt of het meest precies. Wiskundige optimalisatie is hierbij een …

In this article, we introduce a new method of certifying any copositive matrix to be copositive.
This is done through the use of a theorem by Hadeler and the Farkas Lemma. For a given …

We first provide an inner-approximation hierarchy described by a sum-of-squares (SOS)
constraint for the copositive (COP) cone over a general symmetric cone. The hierarchy is a …

Completely positive (CP) tensors, which correspond to a generalization of CP matrices,
allow to reformulate or approximate a general polynomial optimization problem (POP) with a …