Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems

Mirjam Dür(mirjam.duermath.uni-augsburg.de)
Franz Rendl(Franz.Rendlaau.at)

Abstract: A conic optimization problem is a problem involving a constraint that the optimization variable be in some closed convex cone. Prominent examples are second order cone programs (SOCP), semidefinite problems (SDP), and copositive problems. We survey recent progress made in this area. In particular, we highlight the connections between nonconvex quadratic problems, binary quadratic problems, and copositive optimization. We review how tight bounds can be obtained by relaxing the copositivity constraint to semidefinitness, and we discuss the effect that different modelling techniques have on the quality of the bounds.

Keywords: semidefinite programming; second order cone programming; copositive optimization; binary quadratic optimization

Category 1: Linear, Cone and Semidefinite Programming

Citation: Preprent, submitted (2021)

Download: [PDF]

Entry Submitted: 06/30/2021
Entry Accepted: 06/30/2021
Entry Last Modified: 06/30/2021

Modify/Update this entry