A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems. - N. H. Chieu; Vaithilingam Jeyakumar; Guoyin Li 001 (Oper. Res. Lett., 2017)

Constraint qualifications for convex optimization without convexity of constraints : New connections and applications to best approximation. - N. H. Chieu; Vaithilingam Jeyakumar; Guoyin Li 001; Hossein Mohebi (Eur. J. Oper. Res., 2018)

A copositive Farkas lemma and minimally exact conic relaxations for robust quadratic optimization with binary and quadratic constraints. - N. H. Chieu; Thai Doan Chuong; V. Jeyakumar 001; Guoyin Li 001 (Oper. Res. Lett., 2019)

Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality. - N. H. Chieu; V. Jeyakumar 001; Guoyin Li 001 (Eur. J. Oper. Res., 2020)