Login / Signup
V. Jeyakumar
ORCID
Publication Activity (10 Years)
Years Active: 2003-2024
Publications (10 Years): 6
Top Topics
Quadratic Optimization
Semi Infinite
Quadratic Program
Decision Rules
Top Venues
J. Glob. Optim.
EURO J. Comput. Optim.
Oper. Res. Lett.
Eur. J. Oper. Res.
</>
Publications
</>
Queenie Yingkun Huang
,
V. Jeyakumar
,
Guoyin Li
Piecewise SOS-convex moment optimization and applications via exact semi-definite programs.
EURO J. Comput. Optim.
12 (2024)
Thai Doan Chuong
,
V. Jeyakumar
,
Guoyin Li
,
D. Woolnough
Exact SDP reformulations of adjustable robust linear programs with box uncertainties under separable quadratic decision rules via SOS representations of non-negativity.
J. Glob. Optim.
81 (4) (2021)
V. Jeyakumar
,
Guoyin Li
,
D. Woolnough
Quadratically adjustable robust linear optimization with inexact data via generalized S-lemma: Exact second-order cone program reformulations.
EURO J. Comput. Optim.
9 (2021)
N. H. Chieu
,
V. Jeyakumar
,
Guoyin Li
Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality.
Eur. J. Oper. Res.
280 (2) (2020)
Thai Doan Chuong
,
V. Jeyakumar
,
Guoyin Li
A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs.
J. Glob. Optim.
75 (4) (2019)
N. H. Chieu
,
Thai Doan Chuong
,
V. Jeyakumar
,
Guoyin Li
A copositive Farkas lemma and minimally exact conic relaxations for robust quadratic optimization with binary and quadratic constraints.
Oper. Res. Lett.
47 (6) (2019)
V. Jeyakumar
A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions.
Optim. Lett.
2 (1) (2008)
V. Jeyakumar
The strong conical hull intersection property for convex programming.
Math. Program.
106 (1) (2006)
V. Jeyakumar
Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints.
SIAM J. Optim.
13 (4) (2003)