¶¶Òõ¶ÌÊÓƵ

Professor Jeya Jeyakumar

Professor Jeya Jeyakumar

Professor
Science
School of Mathematics & Statistics

ABOUT ME

Ìý

Biography

I am an applied mathematician. My research interests are in mathematical optimization. It is an area of mathematics that directly deals with the problem of making the best possible choice from a set of feasible choices. It seeks to understand how we achieve the best possible choice and how we can use this knowledge to improve management and technical decisions in science, engineering, and commerce. Thinking in terms of choices is common in our cognitive culture and searching for the best possible choice is a basic human desire. Thus models of optimization arise every day as management and technical decisions in many areas of human activity. I develop mathematical principles and methods for identifying and locating solutions for a wide range of optimization models.

Education

PhD in Optimization, University of Melbourne

AWARDS & ACHIEVEMENTS

Ìý

PRIZESÌý

  • 2019: Joint winner of the 2019 Journal of Global Optimization Best Paper Prize,

  • 2017: Winner of the 2015 Optimization Letters Best Paper Prize,Ìý

Ìý

MY RECENT GRANTS

  • 2024, UNSW Science Goldstar Award ($30,000) (with G. Li and Ho-Nguyen):ÌýNew Optimisation with Uncertainty Quantification for Best Decision-Making.
  • 2021-2023, ARC Discovery Project Grant ($400,000) (with G. Li):ÌýData-Driven Multistage Robust Optimization - The New Frontier in Optimization
  • 2018-2020, ARC Discovery Project Grant ($401,706) (with G. Li) : New mathematics for multi-extremal optimization and diffusion tensor imaging
  • 2017,ÌýUNSW Science Gold Star AwardÌý($40,000), (withÌýG. Li, and T. D. Chuong): Numerically Certifiable Mathematics for Multi-Extremal Global Optimization.Ìý
  • 2012-2014, ARC Discovery Project GrantÌý($330,000) (with G. Li): New theory and methods of robust global optimization
  • 2011, UNSW Goldstar AwardÌý ($30,000)ÌýÌýInnovative approaches to solving optimization problems affected by data uncertainty optimizationÌý
  • 2010-2013, ARC Discovery Project Grant($285,543): A new improved solution to global optimization over multi-variate polynomials
  • 2007-2009, ARC Discovery Project Grant ($246,000): Quadratic support function technique to solving hard global nonconvex optimization problems
  • 2006-2008, ARC Linkage International Award ($22,250):Continuous optimization with linear matrix inequality systems
  • 2005-2007, ARC Discovery Project Grant ($403,000) (with T. Hoang and B. Vo) : Convex optimization for control, signal processing and communications
  • 2004-2006, ARC Discovery Project Grant ($283,752) (with A.M. Rubinov): Necessary and Sufficient Conditions in Global Continuous Optimization

Ìý

MOST CITED ARTICLES

  • 2012, The paper ``V. Jeyakumar and G. Li. Exact SDP relaxations for classes of nonlinear semidefinite programming problems, Operation Research Letters, 40 (2012), no. 6, 529–536.'' published in Operation Research Letters (ERA: A), was listed asÌýthe most cited 25 articlesÌýfrom 2012-2016.
  • 2011,ÌýThe paper ``V. Jeyakumar, G. Li and G. M. Lee, A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty, Volume 39, Issue 2, March 2011, 109-114.'' published in Operation Research Letters (ERA: A), was listed as theÌýmost cited 25 articlesÌýfrom 2011-2015.

RESEARCH

Ìý

My Research Goals

  • To understand and improve Mathematics of Decision Making
  • To develop and characterize mathematical principles of optimization
  • To apply the principles of optimization to bring rigorous approaches to improve management and technical decisions
  • To provide advanced mathematical framework to solve practical optimization problems in science, engineering, commerce and medicine

Ìý

My Research in Detail

I am interested in a range of topics in Optimization. One strand of my research examines optimization models in the face of data uncertainty. We examine mathematical approaches to finding robust best solutions for uncertain optimization models that are immunized against data uncertainty. We develop mathematical principles and methods for identifying and locating such solutions of a wide range of optimization models.

One paper, grown out of our recent work in this area, won the Optimization Letters Journal Best Paper Award for 2015.

A current project examines multi-objective optimization models in the presence of conflicting objectives and data uncertainty. It is a joint work with Dr Guoyin Li (Associate Professor), who is a member of the Optimization group at UNSW.

A second area of my research focuses on analysis, methods, and applications of duality theory and associated techniques of convex optimization. We have examined a variety of topics such as the convex optimization models arising from the machine learning problems of large-scale data classification.

Some of my recent research projects in this area have involved technologically significant problems such as the development of screening algorithms for HIV-associated neurological disorders, produced by a new optimization procedure. This was a result of successful research collaboration between the research group in Optimization within Mathematics and the HIV Epidemiology and Clinical Research Group at St Vincent's Hospital. The research outcome on screening algorithms was published in the British Journal, of HIV Medicine.

What did HIV clinicians read on Medscape in 2011?
When HIV specialists come to Medscape HIV/AIDS what are they most interested in reading? ... Starting with number 10, here is our most-read content for 2011 in HIV. 10. Lifelong Antiretroviral Therapy Unsustainable, Experts Say. 9. Can We Stop Monitoring CD4 counts Entirely in HIV? ... 2. Curing HIV? And the number-one most-read article by HIV clinicians on Medscape in 2011 was...


A Screening Algorithm for HIV-Associated Neurocognitive Disorders, Cysique, Murray, Dunbar, Jeyakumar, Brew, HIV Medicine, 11:642-649, 2011.Ìý


Much of my studies in this area are fundamental, but these mathematical studies have a flow-through effect for addressing major challenges of modern problems such as the development of clinically based decision support tools in medical science. A current project is examining two-stage convex optimization with applications to medical decision-making optimization models of radiation therapy planning. Another ongoing collaborative project examines applications of robust optimization for characterizing Huntington's disease onset.

One study examines emerging applications of algebraic geometry to optimization over polynomials. A good understanding of convex sets in algebraic geometry will lead to insights into solving complex optimization problems involving polynomials.

Another project investigates bi-level optimization models. These models arise when two independent decision-makers, ordered within a hierarchical structure, have conflicting objectives. Optimization models of this kind appear in resource allocation and planning problems.

A new project starting this year examines optimization approaches to multi-stage optimization problems in the face of evolving uncertainty. The dynamic decision-making problems under uncertainty are multi-stage robust optimization problems, where uncertainties evolve (in stages), rendering traditional optimization solutions sub-optimal.Ìý This issue is particularly prevalent in medical decision-making, where a patient's condition can change during the treatment. The project aims to develop optimization principles to identify true optimal solutions to these multi-stage problems and develop associated methods to find those solutions.

Recently completed honours thesis topics include:

(i) Feature Selection under Data Uncertainty via DC Programming (2022)

(ii) Supervised Machine Learning under Data Uncertainty (2020)

(iii) Two-stage Adjustable Robust Optimization (2019)

(iv) Bilevel optimization and Principal-Agent Problems (2017)

(v) Portfolio Optimization under Data Uncertainty (2010)

(vi) Optimization approaches to simultaneous classification and feature selection (2007)

(vii) Semidefinite programming approaches to support vector machines (2003)

(viii) Optimization methods in data mining (2000) <

I am interested in talented prospective postgraduate students/postdocs/honours students with interests in these areas.

TEACHING & OUTREACH

Ìý

Courses I teachÌý

Professional affiliations and service positions

  • >Associate Editor, The Journal of Optimization Theory and Applications
  • Associate Editor, Journal of Global Optimization
  • Associate Editor, Minimax Theory and Its Applications
Phone
9385 7046
Location
School of Mathematics and Statistics University of New South Wales Sydney NSW 2052 The Red Centre Room 2073
  • Books | 2008
    Jeyakumar V; Luc DT, 2008, Nonsmooth Vector Functions and Continuous Optimization, Springer Series in Optimization and Its Applications, Springer Publishing Company, USA,
  • Book Chapters | 2010
    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
    Book Chapters | 2008
    , 2008, 'Calculus Rules for Pseudo-Jacobians', in NONSMOOTH VECTOR FUNCTIONS AND CONTINUOUS OPTIMIZATION, edn. Springer Series in Optimization and Its Applications, SPRINGER, pp. 57 - 97,
    Book Chapters | 2008
    , 2008, 'Monotone Operators and Nonsmooth Variational Inequalities', in NONSMOOTH VECTOR FUNCTIONS AND CONTINUOUS OPTIMIZATION, edn. Springer Series in Optimization and Its Applications, SPRINGER, pp. 207 - 254,
    Book Chapters | 2008
    , 2008, 'Nonsmooth Mathematical Programming Problems', in NONSMOOTH VECTOR FUNCTIONS AND CONTINUOUS OPTIMIZATION, edn. Springer Series in Optimization and Its Applications, SPRINGER, pp. 143 - 206,
    Book Chapters | 2008
    , 2008, 'Openness of Continuous Vector Functions', in NONSMOOTH VECTOR FUNCTIONS AND CONTINUOUS OPTIMIZATION, edn. Springer Series in Optimization and Its Applications, SPRINGER, pp. 99 - 142,
    Book Chapters | 2008
    Jeyakumar V; Luc DT, 2008, 'Pseudo-Jacobian Matrices', in NONSMOOTH VECTOR FUNCTIONS AND CONTINUOUS OPTIMIZATION, edn. Springer Series in Optimization and Its Applications, SPRINGER, pp. 1 - +,
    Book Chapters | 2001
    Jeyakumar V, 2001, 'Composite nonsmooth optimization', in Encyclopedia of optimization, edn. Original, Kluwer Academic Publishers, The Netherlands, pp. 307 - 310,
    Book Chapters | 2001
    Jeyakumar V, 2001, 'Farkas lemma: generalizations', in Encyclopedia of optimization, edn. Original, Kluwer Academic Publishers, The Netherlands, pp. 87 - 91,
  • Edited Books | 2005
    Jeyakumar V; Rubinov A, (ed.), 2005, Continuous Optimization: Current Trends and Modern Applications, Springer Publishing Company, USA,
  • Journal articles | 2024
    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,
    Journal articles | 2024
    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,
    Journal articles | 2024
    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,
    Journal articles | 2024
    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,
    Journal articles | 2022
    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,
    Journal articles | 2022
    Chuong TD; Jeyakumar V, 2022, 'Adjustable robust multiobjective linear optimization: Pareto optimal solutions via conic programming', Annals of Operations Research,
    Journal articles | 2022
    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,
    Journal articles | 2022
    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,
    Journal articles | 2022
    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,
    Journal articles | 2021
    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,
    Journal articles | 2021
    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,
    Journal articles | 2021
    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,
    Journal articles | 2021
    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,
    Journal articles | 2020
    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,
    Journal articles | 2020
    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,
    Journal articles | 2020
    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,
    Journal articles | 2019
    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,
    Journal articles | 2019
    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,
    Journal articles | 2019
    Jeyakumar V; Mohebi H, 2019, 'Characterizing best approximation from a convex set without convex representation', Journal of Approximation Theory, 239, pp. 113 - 127,
    Journal articles | 2018
    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,
    Journal articles | 2018
    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,
    Journal articles | 2018
    Chuong TD; Jeyakumar V, 2018, 'Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers', Journal of Global Optimization, 72, pp. 655 - 678,
    Journal articles | 2018
    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,
    Journal articles | 2018
    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,
    Journal articles | 2018
    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,
    Journal articles | 2017
    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,
    Journal articles | 2017
    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,
    Journal articles | 2017
    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,
    Journal articles | 2017
    Thai Doan C; Jeyakumar , 2017, 'Convergent conic linear programming relaxations for cone convex polynomial programs', Operations Research Letters, 45, pp. 220 - 226,
    Journal articles | 2017
    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,
    Journal articles | 2017
    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,
    Journal articles | 2016
    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,
    Journal articles | 2016
    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,
    Journal articles | 2016
    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,
    Journal articles | 2016
    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,
    Journal articles | 2016
    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,
    Journal articles | 2016
    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,
    Journal articles | 2016
    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,
    Journal articles | 2016
    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,
    Journal articles | 2015
    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,
    Journal articles | 2015
    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,
    Journal articles | 2015
    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,
    Journal articles | 2015
    Jeyakumar V; Li G; Vicente-Pérez J, 2015, 'Robust SOS-convex polynomial optimization problems: exact SDP relaxations', Optimization Letters, 9, pp. 1 - 18,
    Journal articles | 2015
    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,
    Journal articles | 2015
    Jeyakumar V; Li G, 2015, 'A new class of alternative theorems for SOS-convex inequalities and robust optimization', Applicable Analysis, 94, pp. 56 - 74,
    Journal articles | 2014
    Dinh N; Jeyakumar V, 2014, 'Farkas' lemma: Three decades of generalizations for mathematical optimization', TOP, 22, pp. 1 - 22,
    Journal articles | 2014
    Dinh N; Jeyakumar V, 2014, 'Rejoinder on: Farkas' lemma: Three decades of generalizations for mathematical optimization', TOP, 22, pp. 41 - 44,
    Journal articles | 2014
    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,
    Journal articles | 2014
    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,
    Journal articles | 2014
    Jeyakumar V; Lee GM; Li G, 2014, 'Characterizing Robust Solution Sets of Convex Programs under Data Uncertainty', Journal of Optimization Theory and Applications,
    Journal articles | 2014
    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,
    Journal articles | 2014
    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,
    Journal articles | 2014
    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,
    Journal articles | 2014
    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,
    Journal articles | 2013
    Bot R; Jeyakumar V; Li G, 2013, 'Robust duality in parametric convex optimization', Set-Valued and Variational Analysis, 21, pp. 177 - 189,
    Journal articles | 2013
    Goberna MA; Jeyakumar V; Li G; López MA, 2013, 'Robust linear semi-infinite programming duality under uncertainty', Mathematical Programming, 139, pp. 185 - 203,
    Journal articles | 2013
    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,
    Journal articles | 2013
    Jeyakumar V; Li G; Srisatkunarajah S, 2013, 'Strong duality for robust minimax fractional programming problems', European Journal of Operational Research, 228, pp. 331 - 336,
    Journal articles | 2013
    Jeyakumar V; Li G; Wang J, 2013, 'Some robust convex programs without duality gap', Journal of Convex Analysis, 20, pp. 377 - 394,
    Journal articles | 2013
    Jeyakumar V; Li G, 2013, 'A new class of alternative theorems for SOS-convex inequalities and robust optimization', Applicable Analysis,
    Journal articles | 2013
    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,
    Journal articles | 2012
    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,
    Journal articles | 2012
    Jeyakumar V; Li G; Suthaharan S, 2012, 'Support vector machine classifiers with uncertain knowledge sets via robust optimization', Optimization,
    Journal articles | 2012
    Jeyakumar V; Li G, 2012, 'Exact SDP relaxations for classes of nonlinear semidefinite programming problems', Operations Research Letters, 40, pp. 529 - 536,
    Journal articles | 2012
    Jeyakumar V; Li G, 2012, 'Strong duality in robust semi-definite linear programming under data uncertainty', Optimization,
    Journal articles | 2012
    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,
    Journal articles | 2011
    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,
    Journal articles | 2011
    Jeyakumar V; Li G, 2011, 'Necessary global optimality conditions for nonlinear programming problems with polynomial constraints', Mathematical Programming, 126, pp. 393 - 399,
    Journal articles | 2011
    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,
    Journal articles | 2011
    Jeyakumar V; Li G, 2011, 'Robust Farkas’ lemma for uncertain linear systems with applications', Positivity, 15, pp. 331 - 342,
    Journal articles | 2011
    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,
    Journal articles | 2011
    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,
    Journal articles | 2010
    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,
    Journal articles | 2010
    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,
    Journal articles | 2010
    Jeyakumar V; Huy N, 2010, 'Global optimality conditions for nonlinear programming problems with bounds via quadratic underestimators', Optimization, 59, pp. 161 - 173
    Journal articles | 2010
    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
    Journal articles | 2010
    Jeyakumar V; Li G, 2010, 'Characterizing robust set containments and solutions of uncertain linear programs without qualifications', Operations Research Letters, 38, pp. 188 - 194,
    Journal articles | 2010
    Jeyakumar V; Li G, 2010, 'New strong duality results for convex programs with separable constraints', European Journal of Operational Research, 207, pp. 1203 - 1209
    Journal articles | 2010
    Jeyakumar V; Li G, 2010, 'Strong duality in robust convex programming: complete characterizations', SIAM Journal on Optimization, 20, pp. 3384 - 3407
    Journal articles | 2010
    Phat VN; Jeyakumar V, 2010, 'Stability, stabilization and duality for linear time-varying systems', Optimization, 59, pp. 447 - 460,
    Journal articles | 2009
    Jeyakumar V; Lee GM; Li G, 2009, 'Alternative theorems for quadratic inequality systems and global quadratic optimization', SIAM Journal on Optimization, 20, pp. 983 - 1001
    Journal articles | 2009
    Jeyakumar V; Lee GM; Srisatkunarajah S, 2009, 'New Kuhn-Tucker sufficiency for global optimality via convexification', Nonlinear Analysis - Theory Methods and Applications, 71, pp. 373 - 381
    Journal articles | 2009
    Jeyakumar V; Lee GM; Srisatkunarajah S, 2009, 'New Kuhn-Tucker sufficiency for global optimality via convexification', Nonlinear Analysis, Theory, Methods and Applications, 71, pp. 373 - 381,
    Journal articles | 2009
    Jeyakumar V; Li G; Huy N, 2009, 'Necessary and sufficient conditions for S-lemma and nonconvex quadratic optimization', Optimization and Engineering, 10, pp. 491 - 503
    Journal articles | 2009
    Jeyakumar V; Li G, 2009, 'Farkas' lemma for separable sublinear inequalities without qualifications', Optimization Letters, 3, pp. 537 - 545,
    Journal articles | 2009
    Jeyakumar V; Li G, 2009, 'New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs', Nonlinear Analysis - Theory Methods and Applications, 71, pp. e2239 - e2249
    Journal articles | 2009
    Jeyakumar V; Li G, 2009, 'Qualification-free optimality conditions for convex programs with separable inequality constraints', Journal of Convex Analysis, 16, pp. 845 - 856
    Journal articles | 2009
    Jeyakumar V; Li G, 2009, 'Stable zero duality gaps in convex programming: Complete dual characterisations with applications to semidefinite programs', Journal of Mathematical Analysis and Applications, 360, pp. 156 - 167
    Journal articles | 2009
    Jeyakumar V; Srisatkunarajah S, 2009, 'A note on sufficient global optimality conditions for fixed charge quadratic programs', Applied Mathematics Letters, 22, pp. 1016 - 1020
    Journal articles | 2009
    Jeyakumar V; Srisatkunarajah S, 2009, 'Geometric conditions for Kuhn-Tucker sufficiently of global optimality in mathematical programming', European Journal of Operational Research, 194, pp. 363 - 367
    Journal articles | 2009
    Jeyakumar V; Srisatkunarajah S, 2009, 'Lagrange multiplier necessary conditions for global optimality for non-convex minimization over a quadratic constraint via S-lemma', Optimization Letters, 3, pp. 23 - 33
    Journal articles | 2009
    Jeyakumar V; Srisatkunarajah S, 2009, 'New sufficiency for global optimality and duality of mathematical programming problems via underestimators', Journal of Optimization Theory and Applications, 140, pp. 239 - 247
    Journal articles | 2008
    Goberna MA; Jeyakumar V; Lopez MA, 2008, 'Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities', Nonlinear Analysis - Theory Methods and Applications, 68, pp. 1184 - 1194
    Journal articles | 2008
    Gwinner J; Jeyakumar V; Lee GM, 2008, 'Necessary and sufficient conditions for globally stable convex minimax theorems', Pacific Journal of Optimization, 4, pp. 483 - 491
    Journal articles | 2008
    Jeyakumar V; Huy N, 2008, 'Global minimization of difference of quadratic and convex functions over box or binary constraints', Optimization Letters, 2, pp. 223 - 238
    Journal articles | 2008
    Jeyakumar V; Kum S; Lee G, 2008, 'Necessary and sufficient conditions for Farkas` lemma for cone systems and second-order cone programming duality', Journal of Convex Analysis, 15, pp. 63 - 71
    Journal articles | 2008
    Jeyakumar V; Lee GM, 2008, 'Complete characterizations of stable Farkas` lemma and cone-convex programming duality', Mathematical Programming, 114, pp. 335 - 347,
    Journal articles | 2008
    Jeyakumar V; Srisatkunarajah S; Nguyen H, 2008, 'Unified global optimality conditions for smooth minimization problems with mixed variables', Rairo-Operations Research, 42, pp. 361 - 370
    Journal articles | 2008
    Jeyakumar V, 2008, 'A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions', Optimization Letters, 2, pp. 15 - 25
    Journal articles | 2008
    Jeyakumar V, 2008, 'Constraint qualifications characterizing Lagrangian duality in convex optimization', Journal of Optimization Theory and Applications, 136, pp. 369 - 391
    Journal articles | 2008
    Jeyakumar V, 2008, 'Constraint qualifications characterizing lagrangian duality in convex optimization', Journal of Optimization Theory and Applications, 136, pp. 31 - 41,
    Journal articles | 2007
    Jeyakumar V; Huy N, 2007, 'Global minimization of difference of quadratic and convex functions over box or binary constraints', Optimization Letters
    Journal articles | 2007
    Jeyakumar V; Huy N, 2007, 'Global optimality of quadratic minimization over symmetric polytopes', Optimization, 56, pp. 633 - 640
    Journal articles | 2007
    Jeyakumar V; Rubinov A; Wu ZY, 2007, 'Generalized Fenchel`s conjugation formulas and duality for abstract convex functions', Journal of Optimization Theory and Applications, 132, pp. 441 - 458
    Journal articles | 2007
    Jeyakumar V; Rubinov A; Wu ZY, 2007, 'Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions', Mathematical Programming, 110, pp. 521 - 541
    Journal articles | 2007
    Jeyakumar V; Srisatkunarajah S; Huy N, 2007, 'Kuhn-Tucker sufficiency for global minimum of multi-extremal mathematical programming problems', Journal of Mathematical Analysis and Applications, 335, pp. 779 - 788
    Journal articles | 2007
    Jeyakumar V; Wu Z, 2007, 'A dual criterion for maximal monotonicity of composition operators', Set - Valued Analysis, 15, pp. 265 - 273
    Journal articles | 2007
    Jeyakumar V; Wu ZY, 2007, 'Conditions for global optimality of quadratic minimization problems with LMI constraints', Asia-Pacific Journal of Operational Research, 24, pp. 149 - 160,
    Journal articles | 2007
    Wu ZY; Jeyakumar V; Rubinov A, 2007, 'Sufficient conditions for global optimality of bivalent non-convex quadratic programs with inequality constraints', Journal of Optimization Theory and Applications, 133, pp. 123 - 130
    Journal articles | 2006
    Burachik RS; Jeyakumar V; Wu Z, 2006, 'Necessary and sufficient conditions for stable conjugate duality', Nonlinear Analysis - Theory Methods and Applications, 64, pp. 1998 - 2006
    Journal articles | 2006
    Dinh N; Jeyakumar V; Lee G, 2006, 'Lagrange multiplier characterizations of solution sets of constrained pseudolinear optimization problems', Optimization, 55, pp. 241 - 250
    Journal articles | 2006
    Goberna MA; Jeyakumar V; Dinh N, 2006, 'Dual characterizations of set containments with strict convex inequalities', Journal of Global Optimization, 34, pp. 33 - 54
    Journal articles | 2006
    Huy N; Jeyakumar V; Lee G, 2006, 'Sufficient global optimality conditions for multi-extremal smooth minimisation problems with bounds and linear matrix inequality constraints', ANZIAM Journal, 47, pp. 439 - 450
    Journal articles | 2006
    Jeyakumar V; Lee GM; Dinh N, 2006, 'Characterizations of solution sets of convex vector minimization problems', European Journal of Operational Research, 174, pp. 1380 - 1395
    Journal articles | 2006
    Jeyakumar V; Ormerod JT; Womersley RS, 2006, 'Knowledge-based semidefinite linear programming classifiers', Optimization Methods and Software, 21, pp. 693 - 706
    Journal articles | 2006
    Jeyakumar V; Rubinov A; Wu ZY, 2006, 'Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints', Journal of Global Optimization, 36, pp. 471 - 481
    Journal articles | 2006
    Jeyakumar V; Thera M; Wu Z, 2006, 'Asymptotic sums of monotone operators', Pacific Journal of Optimization, 2, pp. 591 - 598
    Journal articles | 2006
    Jeyakumar V; Wu Z, 2006, 'A qualification free sequential Pshenichnyi-Rockafellar Lemma and convex semidefinite programming', Journal of Convex Analysis, 13, pp. 773 - 784
    Journal articles | 2006
    Jeyakumar V; Wu ZY; Lee GM; Dinh N, 2006, 'Liberating the subgradient optimality conditions from constraint qualifications', Journal of Global Optimization, 36, pp. 127 - 137
    Journal articles | 2006
    Jeyakumar V, 2006, 'The strong conical hull intersection property for convex programming', Mathematical Programming, 106, pp. 81 - 92,
    Journal articles | 2005
    Burachik RS; Jeyakumar V, 2005, 'A dual condition for the convex subdifferential sum formula with applications', Journal of Convex Analysis, 12, pp. 279 - 290
    Journal articles | 2005
    Burachik RS; Jeyakumar V, 2005, 'A new geometric condition for Fenchel`s duality in infinite dimensional spaces', Mathematical Programming, 104, pp. 229 - 233
    Journal articles | 2005
    Burachik RS; Jeyakumar V, 2005, 'A simple closure condition for the normal cone intersection formula', Proceedings of the American Mathematical Society, 133, pp. 1741 - 1748
    Journal articles | 2005
    Dinh N; Jeyakumar V; Lee GM, 2005, 'Sequential lagrangian conditions for convex programs with applications to semidefinite programming', Journal of Optimization Theory and Applications, 125, pp. 85 - 112
    Journal articles | 2005
    Jeyakumar V; Mohebi H, 2005, 'A global approach to nonlinearly constrained best approximation', Numerical Functional Analysis and Optimization, 26, pp. 205 - 227
    Journal articles | 2005
    Jeyakumar V; Mohebi H, 2005, 'Limiting epsilon-subgradient characterizations of constrained best approximations', Journal of Approximation Theory, 135, pp. 145 - 159
    Journal articles | 2004
    Jeyakumar V; Lee GM; Dinh N, 2004, 'Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex-programs', Journal of Optimization Theory and Applications, 123, pp. 83 - 103
    Journal articles | 2004
    Jeyakumar V; Yen ND, 2004, 'Solution stability of nonsmooth continuous systems with applications to cone-constrained optimization', Journal of Optimization Theory and Applications, 14, pp. 1106 - 1127
    Journal articles | 2003
    Jeyakumar V; Lee GM; Dinh N, 2003, 'New sequential Lagrange multiplier conditions characterizing optimality without constraint qualification for convex programs', SIAM JOURNAL ON OPTIMIZATION, 14, pp. 534 - 547,
    Journal articles | 2003
    Jeyakumar V; Lee GM; Dinh N, 2003, 'New sequential Lagrange multiplier conditions characterizing optimality without constraint qualification for convex programs', SIAM Journal on Optimization, 14, pp. 534 - 547
    Journal articles | 2003
    Jeyakumar V; Luc DT, 2003, 'Sharp variational conditions for convex composite nonsmooth functions', SIAM Journal on Optimization, 13, pp. 904 - 920
    Journal articles | 2003
    Jeyakumar V, 2003, 'Characterizing set containments involving infinite convex constraints and reverse-convex constraints', SIAM Journal on Optimization, 13, pp. 947 - 959,
    Journal articles | 2003
    Jeyakumar V, 2003, 'Characterizing set containments involving infinite convex constraints', SIAM Journal on Optimization, 13, pp. 947 - 959
    Journal articles | 2002
    Jeyakumar V; Luc DT; Tinh PN, 2002, 'Convex composite non-Lipschitz programming', Mathematical Programming, 92, pp. 177 - 195
    Journal articles | 2002
    Jeyakumar V; Luc DT, 2002, 'An open mapping theorem using unbounded generalized Jacobians', Nonlinear Analysis - Theory Methods and Applications, 50, pp. 647 - 663
    Journal articles | 2002
    Jeyakumar V; Luc DT, 2002, 'Convex interior mapping theorems for continuous nonsmooth functions and optimization', Journal of Nonlinear and Convex Analysis, 3, pp. 251 - 266
    Journal articles | 2001
    Fischer A; Jeyakumar V; Luc DT, 2001, 'Solution point characterizations and convergence analysis of a descent algorithm for nonsmooth continuous complementarity problems', Journal of Optimization Theory and Applications, 110, pp. 493 - 513
    Journal articles | 2000
    Jeyakumar V; Nealon MJ, 2000, 'Complete dual characterizations of optimaility for convex semidefinite programming', Canadian Mathematical Society, pp. 165 - 173
    Journal articles | 2000
    Wang XJ; Jeyakumar V, 2000, 'A sharp Lagrange multiplier rule for nonsmooth mathematical programming problems involving equality constraints', SIAM Journal on Optimization, 10, pp. 1136 - 1148
    Journal articles | 1999
    Glover BM; Rubinov A; Jeyakumar V, 1999, 'Dual conditions characterizing optimality for convex multi-objective programs', Mathematical Programming, pp. 201 - 217
    Journal articles | 1999
    Jeyakumar V; Luc DT, 1999, 'Approximate generalized Hessians and Taylor`s expansions for continuously Gateaux differentiable functions', Nonlinear Analysis - Theory Methods and Applications, 36, pp. 353 - 368,
    Journal articles | 1999
    Jeyakumar V; Luc TD, 1999, 'Nonsmooth calculus, minimality, and monotonicity of convexificators 1,2', Journal of Optimization Theory and Applications, 101, pp. 599 - 621
    Journal articles | 1999
    Jeyakumar V; Teo KL, 1999, 'Untitled - Preface', JOURNAL OF THE AUSTRALIAN MATHEMATICAL SOCIETY SERIES B-APPLIED MATHEMATICS, 40, pp. 288 - 288,
    Journal articles | 1999
    Jeyakumar V; Yang XQ, 1999, 'Approximate Hessian matrices and second-order optimality conditions for nonlinear programming problems with C1-data', Journal of Australian Mathematical Society B, pp. 403 - 420
    Journal articles | 1998
    Jeyakumar V; Luc DT; Schaible S, 1998, 'Characterizations of generalized monotone nonsmooth continuous maps using approximate Jocobians', Journal of Convex Analysis, pp. 119 - 132
    Journal articles | 1998
    Jeyakumar V; Luc DT, 1998, 'Approximate Jacobian matrices for nonsmooth continuous maps and C1-optimization', SIAM Journal on Control and Optimization, pp. 1815 - 1832
    Journal articles | 1997
    Demyanov VF; Jeyakumar V, 1997, 'Hunting for a smaller convex subdifferential', Journal of Global Optimization, 10, pp. 305 - 326
    Journal articles | 1997
    Jeyakumar V, 1997, 'Asymptotic dual conditions characterizing optimality for infinite convex programs', Journal of Optimization Theory and Applications, pp. 153 - 165
    Journal articles | 1997
    Yang XQ; Jeyakumar V, 1997, 'First and second order optimality conditions for convex composite multiobjective optimization', Journal of Optimization Theory and Applications, 95, pp. 209 - 224,
    Journal articles | 1996
    Glover BM; Ishizuku Y; Jeyakumar V; Tuan HD, 1996, 'Complete characterizations of global optimality for problems involving the pointwise minimum of sublinear functions', SIAM Journal on Optimization, 6, pp. 362 - 372,
    Journal articles | 1996
    Jeyakumar V; Glover BM, 1996, 'Characterizing global optimality for DC optimization problems under convex inequality constraints', Journal of Global Optimization, 8, pp. 171 - 187,
    Journal articles | 1996
    Jeyakumar V; Rubinov A; Glover BM; Ishizuka Y, 1996, 'Inequality systems and flobal optimization', Journal of Mathematical Analysis and Applications, 202, pp. 900 - 919
    Journal articles | 1996
    Jeyakumar V; Zaffaroni A, 1996, 'Asymptotic conditions for weak and proper optimality in infinite dimensional convex vector optimization', Numerical Functional Analysis and Optimization, 17, pp. 323 - 343
    Journal articles | 1996
    Rubinov A; Jeyakumar V; Glover BM, 1996, 'Generalized convex relations with applications to optimization and models of economic dynamics', Set - Valued Analysis, 4, pp. 67 - 89,
    Journal articles | 1995
    Jeyakumar V; Glover BM, 1995, 'Nonlinear extensions of Farkas` lemma with applications to global optimization and least squares', Mathematics of Operations Research, 20, pp. 818 - 837
    Journal articles | 1995
    Jeyakumar V; Yang XQ, 1995, 'Convex composite minimization with C1,1 functions', Journal of Optimization Theory and Applications, 86, pp. 631 - 648,
    Journal articles | 1995
    Jeyakumar V; Yang XQ, 1995, 'On characterizing the solution sets of pseudolinear programs', Journal of Optimization Theory and Applications, pp. 747 - 755
    Journal articles | 1995
    Rubinov A; Glover BM; Jeyakumar V, 1995, 'A general approach to dual characterizations of solvability of inequality systems with applications', Journal of Convex Analysis, 2, pp. 309 - 344
    Journal articles | 1995
    Studniarski M; Jeyakumar V, 1995, 'A generalized mean-value theorem and optimality conditions in composite nonsmooth minimization', Nonlinear Analysis - Theory Methods and Applications, 24, pp. 883 - 894,
    Journal articles | 1994
    Glover BM; Jeyakumar V; Oettli W, 1994, 'A Farkas lemma for difference sublinear systems and quasidifferentiable programming', Mathematical Programming, 63, pp. 109 - 125,
    Journal articles | 1994
    Glover BM; Jeyakumar V; Oettli W, 1994, 'Solvability theorems for classes of difference convex functions', Nonlinear Analysis, 22, pp. 1191 - 1200,
    Journal articles | 1994
    Jeyakumar V; Oettli W, 1994, 'A Nonnegativity Criterion for Biconvex Functions', ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, 74, pp. 71 - 72,
    Journal articles | 1993
    Gwinner J; Jeyakumar V, 1993, 'A solvability theorem and minimax fractional programming', ZOR Zeitschrift für Operations Research Methods and Models of Operations Research, 37, pp. 1 - 12,
    Journal articles | 1993
    Jeyakumar V; Glover BM, 1993, 'A new version of Farkas' lemma and global convex maximization', Applied Mathematics Letters, 6, pp. 39 - 43,
    Journal articles | 1993
    Jeyakumar V; Oettli W; Natividad M, 1993, 'A Solvability Theorem for a Class of Quasiconvex Mappings with Applications to Optimization', Journal of Mathematical Analysis and Applications, 179, pp. 537 - 546,
    Journal articles | 1993
    Jeyakumar V; Yang XQ, 1993, 'Convex composite multi-objective nonsmooth programming', Mathematical Programming, Series A, 59, pp. 325 - 343
    Journal articles | 1993
    Jeyakumar V; Yang XQ, 1993, 'Convex composite multi-objective nonsmooth programming', Mathematical Programming, 59, pp. 325 - 343,
    Journal articles | 1992
    Jeyakumar V; Mond B, 1992, 'On generalized convexmathematical programming', Journal of Australian Mathematical Society, 1, pp. 43 - 53
    Journal articles | 1992
    Jeyakumar V; Wolkowicz H, 1992, 'Generalizations of Slater's constraint qualification for infinite convex programs', Mathematical Programming, 57, pp. 85 - 101,
    Journal articles | 1992
    Jeyakumar V, 1992, 'Infinite-dimensional convex programming with applications to constrained approximation', Journal of Optimization Theory and Applications, 75, pp. 569 - 586,
    Journal articles | 1992
    Yang XQ; Jeyakumar V, 1992, 'Generalized second-order directional derivatives and optimization with C1,1 functions', Optimization, 26, pp. 165 - 185,
    Journal articles | 1991
    Jeyakumar V; Gwinner J, 1991, 'Inequality systems and optimization', Journal of Mathematical Analysis and Applications, 159, pp. 51 - 71,
    Journal articles | 1991
    Jeyakumar V, 1991, 'Composite Nonsmooth Programming with Gâteaux Differentiability', SIAM Journal on Optimization, 1, pp. 30 - 41,
    Journal articles | 1990
    Jeyakumar V; Wolkowicz H, 1990, 'Zero duality gaps in infinite-dimensional programming', Journal of Optimization Theory and Applications, 67, pp. 87 - 108,
    Journal articles | 1990
    Jeyakumar V, 1990, 'Duality and infinite dimensional optimization', Nonlinear Analysis, 15, pp. 1111 - 1122,
    Journal articles | 1988
    Jeyakumar V, 1988, 'Equivalence of saddle-points and optima, and duality for a class of non-smooth non-convex problems', Journal of Mathematical Analysis and Applications, 130, pp. 334 - 343,
    Journal articles | 1988
    Jeyakumar V, 1988, 'Non-convex infinite games', Optimization, 19, pp. 289 - 296,
    Journal articles | 1988
    WEIR T; JEYAKUMAR V, 1988, 'A CLASS OF NONCONVEX FUNCTIONS AND MATHEMATICAL-PROGRAMMING', BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY, 38, pp. 177 - 189,
    Journal articles | 1988
    Weir T; Jeyakumar V, 1988, 'A class of nonconvex functions and mathematical programming', Bulletin of the Australian Mathematical Society, 38, pp. 177 - 189,
    Journal articles | 1987
    CRAVEN BD; JEYAKUMAR V, 1987, 'ALTERNATIVE AND DUALITY THEOREMS WITH WEAKENED CONVEXITY', UTILITAS MATHEMATICA, 31, pp. 149 - 159,
    Journal articles | 1987
    Craven BD; Jeyakumar V; Gwinner J, 1987, 'Nonconvex Theorems of the Alternative and Minimization', Optimization, 18, pp. 151 - 163,
    Journal articles | 1987
    JEYAKUMAR V, 1987, 'NONDIFFERENTIABLE-PROGRAMMING AND DUALITY WITH MODIFIED CONVEXITY', BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY, 35, pp. 309 - 313,
    Journal articles | 1987
    Jeyakumar V, 1987, 'A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processes', Journal of Optimization Theory and Applications, 55, pp. 449 - 461,
    Journal articles | 1987
    Jeyakumar V, 1987, 'On optimality conditions in nonsmooth inequality constrained minimization', Numerical Functional Analysis and Optimization, 9, pp. 535 - 546,
    Journal articles | 1986
    Craven BD; Jeyakumar V, 1986, 'Equivalence of a Ky Fan type minimax theorem and a Gordan type alternative theorem', Operations Research Letters, 5, pp. 99 - 102,
    Journal articles | 1986
    JEYAKUMAR V, 1986, 'RHO-CONVEXITY AND 2ND-ORDER DUALITY', UTILITAS MATHEMATICA, 29, pp. 71 - 85,
    Journal articles | 1986
    Jeyakumar V, 1986, 'A generalization of a minimax theorem of Fan via a theorem of the alternative', Journal of Optimization Theory and Applications, 48, pp. 525 - 533,
    Journal articles | 1986
    Jeyakumar V, 1986, 'On subgradient duality with strong and weak convex functions', Journal of the Australian Mathematical Society, 40, pp. 143 - 152,
    Journal articles | 1985
    Jeyakumar V, 1985, 'Convexlike Alternative Theorems and Mathematical Programming', Optimization, 16, pp. 643 - 652,
    Journal articles | 1984
    Jeyakumar V, 1984, 'Nonlinear alternative theorems and nondifferentiable programming', Zeitschrift für Operations Research, 28, pp. 175 - 187,
  • Preprints | 2020
    Goberna MA; Jeyakumar V; Li G, 2020, Calculating Radius of Robust Feasibility of Uncertain Linear Conic Programs via Semidefinite Programs, ,
    Preprints | 2020
    Woolnough D; Jeyakumar V; Li G, 2020, Exact Conic Programming Reformulations of Two-Stage Adjustable Robust Linear Programs with New Quadratic Decision Rules, ,
    Preprints | 2017
    Bomze IM; Jeyakumar V; Li G, 2017, Extended Trust-Region Problems with One or Two Balls: Exact Copositive and Lagrangian Relaxations, ,
    Preprints | 2017
    Chuong TD; Jeyakumar V; Li G, 2017, A Bounded Degree Lasserre Hierarchy with SOCP Relaxations for Global Polynomial Optimization and Applications, ,
    Conference Papers | 1989
    GWINNER J; JEYAKUMAR V, 1989, 'STABLE MINIMAX ON NONCOMPACT SETS', in THERA MA; BAILLON JB (ed.), FIXED POINT THEORY AND APPLICATIONS, LONGMAN SCIENTIFIC & TECHNICAL, FRANCE, CTR INT RECONTRES MATH, MARSEILLE, pp. 215 - 220, presented at INTERNATIONAL CONF ON FIXED POINT THEORY AND APPLICATIONS, FRANCE, CTR INT RECONTRES MATH, MARSEILLE, 05 June 1989 - 09 June 1989,