3 papers
math.OC2022
Strengthening SONC Relaxations with Constraints Derived from Variable Bounds
Ksenia Bestuzheva, Ambros Gleixner, Helena Völker
Certificates of polynomial nonnegativity can be used to obtain tight dual bounds for polynomial optimization problems. We consider Sums of Nonnegative Circuit (SONC) polynomials ce…
math.OC2021
A Computational Study of Perspective Cuts
Ksenia Bestuzheva, Ambros Gleixner, Stefan Vigerske
The benefits of cutting planes based on the perspective function are well known for many specific classes of mixed-integer nonlinear programs with on/off structures. However, we ar…
math.OC2017
Invex Optimization Revisited
Ksenia Bestuzheva, Hassan Hijazi
Given a non-convex optimization problem, we study conditions under which every Karush-Kuhn-Tucker (KKT) point is a global optimizer. This property is known as KT-invexity and allow…