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 …

This is the first comprehensive introduction to the powerful moment approach for solving
global optimization problems (and some related problems) described by polynomials (and …

Abstract Recent developments in (Global) Optimization are surveyed in this paper. We
collected and commented quite a large number of recent references which, in our opinion …

In this paper, we model any nonconvex quadratic program having a mix of binary and
continuous variables as a linear program over the dual of the cone of copositive matrices …

The first systematic overviews on global optimization appeared in 1975–1978 thanks to two
fundamental volumes titled Towards Global Optimization (Dixon & Szegö, 1975, 1978). At …

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 …

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) …

We study linear optimization problems over the cone of copositive matrices. These problems
appear in nonconvex quadratic and binary optimization; for instance, the maximum clique …

Starting from an algorithm recently proposed by Pullan and Hoos, we formulate and analyze
iterated local search algorithms for the maximum clique problem. The basic components of …