By Professor Jeya Jeyakumar

Journal articles

Chuong TD; Jeyakumar V, 2017, 'Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications', Applied Mathematics and Computation, 315, pp. 381 - 399, http://dx.doi.org/10.1016/j.amc.2017.07.076

Chuong TD; Jeyakumar V, 2017, 'Finding Robust Global Optimal Values of Bilevel Polynomial Programs with Uncertain Linear Constraints', Journal of Optimization Theory and Applications, 173, pp. 683 - 703, http://dx.doi.org/10.1007/s10957-017-1069-4

Jeyakumar V; Kim S; Lee GM; Li G, 2016, 'Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets', Journal of Global Optimization, 65, pp. 175 - 190, http://dx.doi.org/10.1007/s10898-015-0356-6

Jeyakumar V; Lee GM; Linh NTH, 2016, 'Generalized Farkas’ lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization', Journal of Global Optimization, 64, pp. 679 - 702, http://dx.doi.org/10.1007/s10898-015-0277-4

Chuong TD; Jeyakumar V, 2016, 'Robust global error bounds for uncertain linear inequality systems with applications', Linear Algebra and Its Applications, 493, pp. 183 - 205, http://dx.doi.org/10.1016/j.laa.2015.11.035

Chuong TD; Jeyakumar V, 2016, 'Characterizing robust local error bounds for linear inequality systems under data uncertainty', Linear Algebra and Its Applications, 489, pp. 199 - 216, http://dx.doi.org/10.1016/j.laa.2015.10.011

Jeyakumary V; Lasserre JB; Li G; Pham TS; Jeyakumar J, 2016, 'Convergent semidefinite programming relaxations for global bilevel polynomial optimization problems', SIAM Journal on Optimization, 26, pp. 753 - 780, http://dx.doi.org/10.1137/15M1017922

Goberna MA; Jeyakumar V; Li G; Linh N, 2016, 'Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints', Operations Research Letters, 44, pp. 67 - 73, http://dx.doi.org/10.1016/j.orl.2015.11.011

Jeyakumar V; Lee GM; Lee JH, 2016, 'SUMS OF SQUARES CHARACTERIZATIONS OF CONTAINMENT OF CONVEX SEMIALGEBRAIC SETS', PACIFIC JOURNAL OF OPTIMIZATION, 12, pp. 29 - 42

Jeyakumar V; Lee GM; Lee JH, 2015, 'Generalized SOS-Convexity and Strong Duality with SDP Dual Programs in Polynomial Optimization', Journal of Convex Analysis, 22, pp. 999 - 1023, http://www.heldermann.de/JCA/JCA22/JCA224/jca22053.htm

Jeyakumar V; Li G, 2015, 'A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs', Operations Research Letters, 43, pp. 405 - 410, http://dx.doi.org/10.1016/j.orl.2015.05.006

Goberna MA; Jeyakumar V; Li G; Vicente-Pérez J, 2015, 'Robust solutions to multi-objective linear programs with uncertain data', European Journal of Operational Research, 242, pp. 730 - 743, http://dx.doi.org/10.1016/j.ejor.2014.10.027

Jeyakumar V; Lee GM; Li G, 2015, 'Characterizing Robust Solution Sets of Convex Programs under Data Uncertainty', Journal of Optimization Theory and Applications, 164, pp. 407 - 435, http://dx.doi.org/10.1007/s10957-014-0564-0

Jeyakumar V; Li G, 2015, 'A new class of alternative theorems for SOS-convex inequalities and robust optimization', Applicable Analysis, 94, pp. 56 - 74, http://dx.doi.org/10.1080/00036811.2013.859251

Jeyakumar V; Li G; Vicente-Pérez J, 2015, 'Robust SOS-convex polynomial optimization problems: exact SDP relaxations', Optimization Letters, 9, pp. 1 - 18, http://dx.doi.org/10.1007/s11590-014-0732-z

Jeyakumar V; Lasserre JB; Li G, 2014, 'On Polynomial Optimization Over Non-compact Semi-algebraic Sets', Journal of Optimization Theory and Applications, 163, pp. 707 - 718, http://dx.doi.org/10.1007/s10957-014-0545-3

Jeyakumar V; Li GY, 2014, 'Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization', Mathematical Programming, 147, pp. 171 - 206, http://dx.doi.org/10.1007/s10107-013-0716-2

Jeyakumar V; Lee GM; Li G, 2014, 'Characterizing Robust Solution Sets of Convex Programs under Data Uncertainty', Journal of Optimization Theory and Applications, http://dx.doi.org/10.1007/s10957-014-0564-0

Jeyakumar V; Phaìm TS; Li G, 2014, 'Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness', Operations Research Letters, 42, pp. 34 - 40, http://dx.doi.org/10.1016/j.orl.2013.11.005

Dinh N; Jeyakumar V, 2014, 'Farkas' lemma: Three decades of generalizations for mathematical optimization', Top, 22, pp. 1 - 22, http://dx.doi.org/10.1007/s11750-014-0319-y

Dinh N; Jeyakumar V, 2014, 'Rejoinder on: Farkas' lemma: Three decades of generalizations for mathematical optimization', Top, 22, pp. 41 - 44, http://dx.doi.org/10.1007/s11750-014-0320-5

Goberna MA; Jeyakumar V; Li G; Vicente-Pérez J, 2014, 'Robust solutions of multiobjective linear semi-infinite programs under constraint data uncertainty', SIAM Journal on Optimization, 24, pp. 1402 - 1419, http://dx.doi.org/10.1137/130939596

Jeyakumar V; Vicente-Pérez J, 2014, 'Dual Semidefinite Programs Without Duality Gaps for a Class of Convex Minimax Programs', Journal of Optimization Theory and Applications, 162, pp. 735 - 753, http://dx.doi.org/10.1007/s10957-013-0496-0

Jeyakumar V; Li G; Srisatkunarajah S, 2014, 'Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations', Journal of Global Optimization, 58, pp. 31 - 50, http://dx.doi.org/10.1007/s10898-013-0058-x

Jeyakumar V; Li G, 2013, 'A new class of alternative theorems for SOS-convex inequalities and robust optimization', Applicable Analysis, http://dx.doi.org/10.1080/00036811.2013.859251

Jeyakumar V; Li G; Mordukhovich B; Wang J, 2013, 'Robust best approximation with interpolation constraints under ellipsoidal uncertainty: Strong duality and nonsmooth Newton methods', Nonlinear Analysis - Theory Methods and Applications, 81, pp. 1 - 11, http://dx.doi.org/10.1016/j.na.2012.12.009

Bot R; Jeyakumar V; Li G, 2013, 'Robust duality in parametric convex optimization', Set-Valued and Variational Analysis, 21, pp. 177 - 189, http://link.springer.com/article/10.1007/s11228-012-0219-y

Goberna MA; Jeyakumar V; Li G; López MA, 2013, 'Robust linear semi-infinite programming duality under uncertainty', Mathematical Programming, 139, pp. 185 - 203, http://dx.doi.org/10.1007/s10107-013-0668-6

Jeyakumar V; Li G, 2013, 'Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty', Journal of Global Optimization, 55, pp. 209 - 226, http://dx.doi.org/10.1007/s10898-012-9857-8

Jeyakumar V; Li G; Wang J, 2013, 'Some robust convex programs without duality gap', Journal of Convex Analysis, 20, pp. 377 - 394, http://web.maths.unsw.edu.au/~gyli/papers/jlw_duality_gap.pdf

Jeyakumar V; Li G; Srisatkunarajah S, 2013, 'Strong duality for robust minimax fractional programming problems', European Journal of Operational Research, 228, pp. 331 - 336, http://dx.doi.org/10.1016/j.ejor.2013.02.015

Jeyakumar V; Li G, 2012, 'Exact SDP relaxations for classes of nonlinear semidefinite programming problems', Operations Research Letters, 40, pp. 529 - 536, http://dx.doi.org/10.1016/j.orl.2012.09.006

Jeyakumar V; Wang J; Li G, 2012, 'Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty', Journal of Mathematical Analysis and Applications, 393, pp. 285 - 297, http://dx.doi.org/10.1016/j.jmaa.2012.03.037

Jeyakumar V; Li G; Lee GM, 2012, 'Robust duality for generalized convex programming prolems under data uncertainty', Nonlinear Analysis - Theory Methods and Applications, 75, pp. 1362 - 1373, http://dx.doi.org/10.1016/j.na.2011.04.006

Jeyakumar V; Li G, 2012, 'Strong duality in robust semi-definite linear programming under data uncertainty', Optimization, http://dx.doi.org/10.1080/02331934.2012.690760

Jeyakumar V; Li G; Suthaharan S, 2012, 'Support vector machine classifiers with uncertain knowledge sets via robust optimization', Optimization, http://dx.doi.org/10.1080/02331934.2012.703667

Jeyakumar V; Li G; Lee GM, 2011, 'A robust Von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty', Operations Research Letters, 39, pp. 109 - 114, http://dx.doi.org/10.1016/j.orl.2011.02.007

Jeyakumar V; Li G, 2011, 'Necessary global optimality conditions for nonlinear programming problems with polynomial constraints', Mathematical Programming, 126, pp. 393 - 399, http://dx.doi.org/10.1007/s10107-009-0283-8

Jeyakumar V; Li G, 2011, 'Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems', Journal of Global Optimization, 49, pp. 1 - 14, http://dx.doi.org/10.1007/s10898-009-9518-8

Li G; Jeyakumar V; Lee G, 2011, 'Robust conjugate duality for convex optimization under uncertainty with application to data classification', Nonlinear Analysis - Theory Methods and Applications, 74, pp. 2327 - 2341, http://dx.doi.org/10.1016/j.na.2010.11.036

Jeyakumar V; Li G, 2011, 'Robust duality for fractional programming problems with constraint-wise data uncertainty', Journal of Optimization Theory and Applications, 151, pp. 292 - 303, http://dx.doi.org/10.1007/s10957-011-9896-1

Jeyakumar V; Li G, 2011, 'Robust Farkas’ lemma for uncertain linear systems with applications', Positivity, 15, pp. 331 - 342, http://dx.doi.org/10.1007/s11117-010-0078-4

Cysique LA; Murray JM; Dunbar M; Jeyakumar V; Brew BJ, 2010, 'A screening algorithm for HIV associated neurocognitive disorders', HIV Medicine, 11, pp. 642 - 649, http://dx.doi.org/10.1111/j.1468-1293.2010.00834.x

Jeyakumar V; Li G, 2010, 'Characterizing robust set containments and solutions of uncertain linear programs without qualifications', Operations Research Letters, 38, pp. 188 - 194, http://dx.doi.org/10.1016/j.orl.2009.12.004

Jeyakumar V; Lee G; Srisatkunarajah S, 2010, 'Distinguishing a global minimizer from local minimizers of quadratic minimization with mixed variables', Pacific Journal of Optimization, 6, pp. 65 - 74

Jeyakumar V; Huy N, 2010, 'Global optimality conditions for nonlinear programming problems with bounds via quadratic underestimators', Optimization, 59, pp. 161 - 173

Jeyakumar V; Li G, 2010, 'New strong duality results for convex programs with separable constraints', European Journal of Operational Research, 207, pp. 1203 - 1209

Dunbar M; Murray JM; Cysique LA; Brew BJ; Jeyakumar V, 2010, 'Simultaneous classification and feature selection via convex quadratic programming with application to HIV-associated neurocognitive disorder assessment', European Journal of Operational Research, 206, pp. 470 - 478, http://www.sciencedirect.com/science/article/B6VCT-4YM7FH3-4/2/a3b9972e52fd64b1f7b5439ecdb15184

Phat VN; Jeyakumar V, 2010, 'Stability, stabilization and duality for linear time-varying systems', Optimization, 59, pp. 447 - 460, http://dx.doi.org/10.1080/02331930801950845

Jeyakumar V; Li G, 2010, 'Strong duality in robust convex programming: complete characterizations', SIAM Journal on Optimization, 20, pp. 3384 - 3407

Back to profile page