2 papers
math.OC2020
On Standard Quadratic Programs with Exact and Inexact Doubly Nonnegative Relaxations
Y. Gorkem Gokmen, E. Alper Yildirim
The problem of minimizing a (nonconvex) quadratic form over the unit simplex, referred to as a standard quadratic program, admits an exact convex conic formulation over the computa…
math.OC2018
Global Solutions of Nonconvex Standard Quadratic Programs via Mixed Integer Linear Programming Reformulations
Jacek Gondzio, E. Alper Yildirim
A standard quadratic program is an optimization problem that consists of minimizing a (nonconvex) quadratic form over the unit simplex. We focus on reformulating a standard quadrat…