1.2k citations · 3.4k across the 72 of their papers we have counts for
4 papers · 2 filters
Concave Quadratic Cuts for Mixed-Integer Quadratic Problems
Jaehyun Park, Stephen Boyd
The technique of semidefinite programming (SDP) relaxation can be used to obtain a nontrivial bound on the optimal value of a nonconvex quadratically constrained quadratic program…
A Simple Effective Heuristic for Embedded Mixed-Integer Quadratic Programming
Reza Takapoui, Nicholas Moehle, Stephen Boyd +1
In this paper we propose a fast optimization algorithm for approximately minimizing convex quadratic functions over the intersection of affine and separable constraints (i.e., the…
Matrix-Free Convex Optimization Modeling
Steven Diamond, Stephen Boyd
We introduce a convex optimization modeling framework that transforms a convex optimization problem expressed in a form natural and convenient for the user into an equivalent cone…
A Semidefinite Programming Method for Integer Convex Quadratic Minimization
Jaehyun Park, Stephen Boyd
We consider the NP-hard problem of minimizing a convex quadratic function over the integer lattice . We present a simple semidefinite programming (SDP) relaxation for ob…