By Professor Jeya Jeyakumar

Books

Jeyakumar V; Luc DT, 2008, Nonsmooth Vector Functions and Continuous Optimization, Springer Publishing Company, USA

Book Chapters

Jeyakumar V; Lee G; Li G, 2010, 'Global Optimality Conditions for Classes of Non-convexMulti-objective Quadratic Optimization Problems', in Burachik RS; Yao J-C (ed.), Springer Optimization and Its Applications, Vol 47, Springer, pp. 177 - 186

, 2008, 'Calculus Rules for Pseudo-Jacobians', in NONSMOOTH VECTOR FUNCTIONS AND CONTINUOUS OPTIMIZATION, SPRINGER, pp. 57 - 97

, 2008, 'Monotone Operators and Nonsmooth Variational Inequalities', in NONSMOOTH VECTOR FUNCTIONS AND CONTINUOUS OPTIMIZATION, SPRINGER, pp. 207 - 254

, 2008, 'Nonsmooth Mathematical Programming Problems', in NONSMOOTH VECTOR FUNCTIONS AND CONTINUOUS OPTIMIZATION, SPRINGER, pp. 143 - 206

, 2008, 'Openness of Continuous Vector Functions', in NONSMOOTH VECTOR FUNCTIONS AND CONTINUOUS OPTIMIZATION, SPRINGER, pp. 99 - 142

Jeyakumar V; Luc DT, 2008, 'Pseudo-Jacobian Matrices', in NONSMOOTH VECTOR FUNCTIONS AND CONTINUOUS OPTIMIZATION, SPRINGER, pp. 1 - +

Jeyakumar V, 2001, 'Composite nonsmooth optimization', in Encyclopedia of optimization, Kluwer Academic Publishers, The Netherlands, pp. 307 - 310, https://www.springer.com/gp/book/9780387747583#aboutBook

Jeyakumar V, 2001, 'Farkas lemma: generalizations', in Encyclopedia of optimization, Kluwer Academic Publishers, The Netherlands, pp. 87 - 91, https://www.springer.com/gp/book/9780387747583#aboutBook

Edited Books

Jeyakumar V; Rubinov A, (ed.), 2005, Continuous Optimization: Current Trends and Modern Applications, Springer Publishing Company, USA, https://link.springer.com/book/10.1007/b137941

Journal articles

Huang QY; Jeyakumar V, 2024, 'A distributional Farkas’ lemma and moment optimization problems with no-gap dual semi-definite programs', Optimization Letters, 18, pp. 1095 - 1110, http://dx.doi.org/10.1007/s11590-024-02097-x

Jeyakumar V; Li G; Woolnough D; Wu H, 2024, 'Affinely adjustable robust optimization for radiation therapy under evolving data uncertainty via semi-definite programming', Optimization, 73, pp. 1807 - 1832, http://dx.doi.org/10.1080/02331934.2023.2178848

Huang QY; Jeyakumar V; Li G, 2024, 'Piecewise SOS-convex moment optimization and applications via exact semi-definite programs', EURO Journal on Computational Optimization, 12, http://dx.doi.org/10.1016/j.ejco.2024.100094

Jeyakumar V; Lee GM; Lee JH; Huang Y, 2024, 'Sum-of-Squares Relaxations in Robust DC Optimization and Feature Selection', Journal of Optimization Theory and Applications, 200, pp. 308 - 343, http://dx.doi.org/10.1007/s10957-023-02312-2

Jeyakumar V; Lee JH; Lee GM; Li G; Woolnough D, 2022, 'Sums of Squares Polynomial Program Reformulations for Adjustable Robust Linear Optimization Problems with Separable Polynomial Decision Rules', Set-Valued and Variational Analysis, 30, pp. 1363 - 1380, http://dx.doi.org/10.1007/s11228-022-00648-x

Woolnough D; Jeyakumar N; Li G; Loy CT; Jeyakumar V, 2022, 'Robust Optimization and Data Classification for Characterization of Huntington Disease Onset via Duality Methods', Journal of Optimization Theory and Applications, 193, pp. 649 - 675, http://dx.doi.org/10.1007/s10957-021-01835-w

Goberna MA; Jeyakumar V; Li G; Vicente-Pérez J, 2022, 'The radius of robust feasibility of uncertain mathematical programs: A Survey and recent developments', European Journal of Operational Research, 296, pp. 749 - 763, http://dx.doi.org/10.1016/j.ejor.2021.04.035

Chuong TD; Jeyakumar V, 2022, 'Adjustable robust multiobjective linear optimization: Pareto optimal solutions via conic programming', Annals of Operations Research, http://dx.doi.org/10.1007/s10479-022-05104-5

Chuong TD; Jeyakumar V; Li G; Woolnough D, 2022, 'Exact dual semi-definite programs for affinely adjustable robust SOS-convex polynomial optimization problems', Optimization, 71, pp. 3539 - 3569, http://dx.doi.org/10.1080/02331934.2021.1902521

Chuong TD; Jeyakumar V; Li G; Woolnough D, 2021, 'Exact SDP reformulations of adjustable robust linear programs with box uncertainties under separable quadratic decision rules via SOS representations of non-negativity', Journal of Global Optimization, 81, pp. 1095 - 1117, http://dx.doi.org/10.1007/s10898-021-01050-x

Goberna MA; Jeyakumar V; Li G, 2021, 'Calculating Radius of Robust Feasibility of Uncertain Linear Conic Programs via Semi-definite Programs', Journal of Optimization Theory and Applications, 189, pp. 597 - 622, http://dx.doi.org/10.1007/s10957-021-01846-7

Woolnough D; Jeyakumar V; Li G, 2021, 'Exact conic programming reformulations of two-stage adjustable robust linear programs with new quadratic decision rules', Optimization Letters, 15, pp. 25 - 44, http://dx.doi.org/10.1007/s11590-020-01595-y

Jeyakumar V; Li G; Woolnough D, 2021, 'Quadratically adjustable robust linear optimization with inexact data via generalized S-lemma: Exact second-order cone program reformulations', EURO Journal on Computational Optimization, 9, http://dx.doi.org/10.1016/j.ejco.2021.100019

Chuong TD; Jeyakumar V, 2020, 'Generalized Farkas Lemma with Adjustable Variables and Two-Stage Robust Linear Programs', Journal of Optimization Theory and Applications, 187, pp. 488 - 519, http://dx.doi.org/10.1007/s10957-020-01753-3

Chieu NH; Jeyakumar V; Li G, 2020, 'Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality', EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 280, pp. 441 - 452, http://dx.doi.org/10.1016/j.ejor.2019.08.009

Chieu NH; Jeyakumar V; Li G, 2020, 'Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality', European Journal of Operational Research, 280, pp. 441 - 452, http://dx.doi.org/10.1016/j.ejor.2019.08.009

Chuong TD; Jeyakumar V; Li G, 2019, 'A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs', Journal of Global Optimization, 75, pp. 885 - 919, http://dx.doi.org/10.1007/s10898-019-00831-9

Chieu NH; Chuong TD; Jeyakumar V; Li G, 2019, 'A copositive Farkas lemma and minimally exact conic relaxations for robust quadratic optimization with binary and quadratic constraints', Operations Research Letters, 47, pp. 530 - 536, http://dx.doi.org/10.1016/j.orl.2019.09.013

Jeyakumar V; Mohebi H, 2019, 'Characterizing best approximation from a convex set without convex representation', Journal of Approximation Theory, 239, pp. 113 - 127, http://dx.doi.org/10.1016/j.jat.2018.11.003

Chuong TD; Jeyakumar V, 2018, 'Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers', Journal of Global Optimization, 72, pp. 655 - 678, http://dx.doi.org/10.1007/s10898-018-0665-7

Thai Doan C; jeyakumar V; Jeyakumar J, 2018, 'Tight SDP relaxations for a class of robust SOS-convex polynomial programs without the Slater condition', Journal of Convex Analysis, 25, pp. 1159 - 1182, http://www.heldermann.de/JCA/JCA25/JCA254/jca25073.htm

Goberna MA; Jeyakumar V; Li G; Vicente-Pérez J, 2018, 'Guaranteeing highly robust weakly efficient solutions for uncertain multi-objective convex programs', European Journal of Operational Research, 270, pp. 40 - 50, http://dx.doi.org/10.1016/j.ejor.2018.03.018

Bomze IM; Jeyakumar V; Li G, 2018, 'Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations', Journal of Global Optimization, 71, pp. 551 - 569, http://dx.doi.org/10.1007/s10898-018-0607-4

Chieu NH; Jeyakumar V; Li G; Mohebi H, 2018, 'Constraint qualifications for convex optimization without convexity of constraints : New connections and applications to best approximation', European Journal of Operational Research, 265, pp. 19 - 25, http://dx.doi.org/10.1016/j.ejor.2017.07.038

Jeyakumar V; Li G, 2018, 'Exact second-order cone programming relaxations for some nonconvex minimax quadratic optimization problems', SIAM Journal on Optimization, 28, pp. 760 - 787, http://dx.doi.org/10.1137/16M1058480

Thai Doan C; Jeyakumar J, 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

Chieu NH; Jeyakumar V; Li G, 2017, 'A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems', Operations Research Letters, 45, pp. 325 - 333, http://dx.doi.org/10.1016/j.orl.2017.04.005

Chuong TD; Jeyakumar V, 2017, 'An Exact Formula for Radius of Robust Feasibility of Uncertain Linear Programs', Journal of Optimization Theory and Applications, 173, pp. 203 - 226, http://dx.doi.org/10.1007/s10957-017-1067-6

Thai Doan C; Jeyakumar , 2017, 'Convergent conic linear programming relaxations for cone convex polynomial programs', Operations Research Letters, 45, pp. 220 - 226, http://dx.doi.org/10.1016/j.orl.2017.03.003

Jeyakumar V; Li G, 2017, 'Exact Conic Programming Relaxations for a Class of Convex Polynomial Cone Programs', Journal of Optimization Theory and Applications, 172, pp. 156 - 178, http://dx.doi.org/10.1007/s10957-016-1023-x

Thai Doan C; Jeyakumar J, 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

Thai Doan C; Jeyakumar , 2016, 'A generalized Farkas lemma with a numerical certificate and linear semi-infinite programs with SDP duals', Linear Algebra and Its Applications, 515, pp. 38 - 52, http://dx.doi.org/10.1016/j.laa.2016.11.008

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, https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000371104500003&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=891bb5ab6ba270e68a29b250adbe88d1

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

Back to profile page