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 …

Copositive programming is a relatively young field in mathematical optimization. It can be
seen as a generalization of semidefinite programming, since it means optimizing over the …

This chapter provides an introduction to copositive programming, which is linear
programming over the convex conic of copositive matrices. Researchers have shown that …

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 …

A conic optimization problem is a problem involving a constraint that the optimization
variable be in some closed convex cone. Prominent examples are linear programs (LP) …

Copositive optimization is a quickly expanding scientific research domain with wide-spread
applications ranging from global nonconvex problems in engineering to NP-hard …

Motivated by the expressive power of completely positive programming to encode hard
optimization problems, many approximation schemes for the completely positive cone have …

This paper studies several classes of nonconvex optimization problems defined over convex
cones, establishing connections between them and demonstrating that they can be …

In this article, we address Bayesian persuasion between a sender and a receiver with state-
dependent quadratic cost measures for general classes of distributions. The receiver seeks …

We provide convergent hierarchies for the convex cone C of copositive matrices and its dual
C^*, the cone of completely positive matrices. In both cases the corresponding hierarchy …