Foundations of set-semidefinite optimization

Abstract

In this paper, we present various foundations of a new field of research in optimization unifying semidefinite and copositive programming, which is called set-semidefinite optimization. A set-semidefinite optimization problem is a vector optimization problem with a special constraint defined by a so-called set-semidefinite ordering cone. The investigations of this chapter are based on the paper [11].