54 citations · 92 across the 14 of their papers we have counts for
Showing 2017 · math.OCShow all
3 papers · 2 filters
math.OC2017
A Bounded Degree Lasserre Hierarchy with SOCP Relaxations for Global Polynomial Optimization and Applications
T. D Chuong, V. Jeyakumar, G. Li
In this paper, we propose a new convergent conic programming hierarchy of relaxations involving both semi-definite cone and second-order cone constraints for solving nonconvex poly…
math.OC2017
Convexifiability of Continuous and Discrete Nonnegative Quadratic Programs for Gap-Free Duality
N. H. Chieu, V. Jeyakumar, G. Li
In this paper we show that a convexifiability property of nonconvex quadratic programs with nonnegative variables and quadratic constraints guarantees zero duality gap between the…
math.OC2017
Extended Trust-Region Problems with One or Two Balls: Exact Copositive and Lagrangian Relaxations
I. M. Bomze, V. Jeyakumar, G. Li
We establish a geometric condition guaranteeing exact copositive relaxation for the nonconvex quadratic optimization problem under two quadratic and several linear constraints, and…