120 citations · 147 across the 5 of their papers we have counts for
6 papers
Polyhedral Properties of RLT Relaxations of Nonconvex Quadratic Programs and Their Implications on Exact Relaxations
Yuzhou Qiu, E. Alper Yıldırım
We study linear programming relaxations of nonconvex quadratic programs given by the reformulation-linearization technique (RLT), referred to as RLT relaxations. We investigate the…
On Exact and Inexact RLT and SDP-RLT Relaxations of Quadratic Programs with Box Constraints
Yuzhou Qiu, E. Alper Yıldırım
Quadratic programs with box constraints involve minimizing a possibly nonconvex quadratic function subject to lower and upper bounds on each variable. This is a well-known NP-hard…
Operational Research: Methods and Applications
Fotios Petropoulos, Gilbert Laporte, Emel Aktas +79
Throughout its history, Operational Research has evolved to include a variety of methods, models and algorithms that have been applied to a diverse and wide range of contexts. This…
An Alternative Perspective on Copositive and Convex Relaxations of Nonconvex Quadratic Programs
E. Alper Yildirim
We study convex relaxations of nonconvex quadratic programs. We identify a family of so-called feasibility preserving convex relaxations, which includes the well-known copositive a…
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…
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…