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

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

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), second order cone programs (SOCP), semidefinite problems (SDP), and copositive problems. We survey recent progress made in this...

Full description

Bibliographic Details
Main Authors: Mirjam Dür, Franz Rendl
Format: Article
Language:English
Published: Elsevier 2021-01-01
Series:EURO Journal on Computational Optimization
Subjects:
90C22
90C20
90C27
Online Access:http://www.sciencedirect.com/science/article/pii/S2192440621001489

Similar Items

Similar Items