38 citations · 38 across the 3 of their papers we have counts for
3 papers · 1 filter
Sum of squares generalizations for conic sets
Lea Kapelevich, Chris Coey, Juan Pablo Vielma
In polynomial optimization problems, nonnegativity constraints are typically handled using the sum of squares condition. This can be efficiently enforced using semidefinite program…
Solving natural conic formulations with Hypatia.jl
Chris Coey, Lea Kapelevich, Juan Pablo Vielma
Many convex optimization problems can be represented through conic extended formulations with auxiliary variables and constraints using only the small number of standard cones reco…
Outer Approximation With Conic Certificates For Mixed-Integer Convex Problems
Chris Coey, Miles Lubin, Juan Pablo Vielma
A mixed-integer convex (MI-convex) optimization problem is one that becomes convex when all integrality constraints are relaxed. We present a branch-and-bound LP outer approximatio…