Professor Jeya   Jeyakumar
Professor

Professor Jeya Jeyakumar

Science
Sch of Mathematics & Statistic

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 everyday as management and technical decisions in many areas of human activity. I develop mathematical principles and methods for identifying and locating solutions of a wide range of optimization models.

Education

PhD in Optimization, University of Melbourne

AWARDS & ACHIEVEMENTS

 

PRIZES AND AWARDS

  • 2019: Joint winner of the 2019 Journal of Global Optimization Best Paper Prize, https://www.maths.unsw.edu.au/news/2019-11/jeya-guoyin-best-paper-award

  • 2017: Winner of the 2015 Optimization Letters Best Paper Prize,      https://link.springer.com/article/10.1007/s11590-016-1099-0

  • 2017 UNSW Science Gold Star Award

  • 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: UNSW Gold Star Award

  • 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.

  • 2010: International Collaboration Award, Australian Research Council

  • 2007: Linkage International Award, Australian Research Council and Korean Science and Engineering Foundation

 

RECENT COMPETITIVE GRANTS

  • 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
  • 2012-2014, ARC Discovery Project Grant($330,000) (with G. Li): New theory and methods of robust global optimization: Modern decision making under uncertain conditions
  • 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
  • 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

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 of 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 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, 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. https://onlinelibrary.wiley.com/doi/full/10.1111/j.1468-1293.2010.00834.x


---SUSAN B COX, AUGUST 12 2011 WWW.MEDSCAPE.COM

Much of my studies in this area is of fundamental in nature, 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 on-going collaborative project examines applications of robust optimization for characterizing Huntington disease onset.

A third strand of my research looks at semi-algebraic global optimization problems, where the set of feasible choices is defined by polynomial equations and inequalities. These problems have numerous locally best solutions that are not globally best. We develop mathematical principles which can identify and locate the globally best solutions and can also be readily validated by computer methods using commonly available algorithms and software. A current project is examining bi-level global optimization models involving polynomials.

 

Supervision Opportunities/Areas

Nowadays, optimization together with sophisticated computer models is a widely used technology to improve performance in many industrial problems and emerging scientific applications. It is an interesting and challenging area of mathematical research. My current research project contains exciting components that are suitable for honours projects and PhD programs.

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 is examining 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 over time (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 course of the treatment. The aim of the project is to develop  optimization principles to identify true optimal solutions of these multi-stage problems and develop associated methods to find those solutions.

Recently completed thesis topics include:

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

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

(iii) Portfolio Optimization under Data Uncertainty

(iv) Optimization approaches to simultaneous classification and feature selection

(v) Convex optimization approaches to data-mining

 

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

 

TEACHING & OUTREACH

 

Courses I teach

MATH3161/MATH5165 Optimization

MATH1231 Mathematics 1B

MATH2019 Engineering Mathematics

Professional affiliations and service positions

  • Associate Editor, The Journal of Optimization Theory and Applications
  • Associate Editor, Journal of Global Optimization
  • Associate Editor, Journal of the Australian Mathematical Society
  • 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

Publications

  • Book Chapters | 2010
    Professor Jeya Jeyakumar
    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, edn. Springer Series in Optimization and Its Applications, Springer, Natl Sun Yat-Sen Univ, Dept Appl Math, Kaohsiung, TAIWAN, pp. 177 - 186, http://dx.doi.org/10.1007/978-1-4419-0437-9_9
    Books | 2008
    Professor Jeya Jeyakumar
    Jeyakumar V; Luc DT, 2008, Nonsmooth Vector Functions and Continuous Optimization, Springer Series in Optimization and Its Applications, Springer Publishing Company, USA, http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000267133600006&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=891bb5ab6ba270e68a
    Book Chapters | 2008
    Professor Jeya Jeyakumar
    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 - +, http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000267133600001&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=891bb5ab6ba270e68a29b250adbe88d1
    Book Chapters | 2008
    Professor Jeya Jeyakumar
    2008, 'Nonsmooth Mathematical Programming Problems', in NONSMOOTH VECTOR FUNCTIONS AND CONTINUOUS OPTIMIZATION, edn. Springer Series in Optimization and Its Applications, SPRINGER, pp. 143 - 206, http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000267133600004&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=891bb5ab6ba270e68a29b250adbe88d1
    Book Chapters | 2008
    Professor Jeya Jeyakumar
    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, http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000267133600002&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=891bb5ab6ba270e68a29b250adbe88d1
    Book Chapters | 2008
    Professor Jeya Jeyakumar
    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, http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000267133600003&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=891bb5ab6ba270e68a29b250adbe88d1
    Book Chapters | 2008
    Professor Jeya Jeyakumar
    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, http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000267133600005&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=891bb5ab6ba270e68a29b250adbe88d1
    Edited Books | 2005
    Professor Jeya Jeyakumar
    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
    Book Chapters | 2001
    Professor Jeya Jeyakumar
    Jeyakumar V, 2001, 'Composite nonsmooth optimization', in Encyclopedia of optimization, edn. Original, Kluwer Academic Publishers, The Netherlands, pp. 307 - 310, https://www.springer.com/gp/book/9780387747583#aboutBook
    Book Chapters | 2001
    Professor Jeya Jeyakumar
    Jeyakumar V, 2001, 'Farkas lemma: generalizations', in Encyclopedia of optimization, edn. Original, Kluwer Academic Publishers, The Netherlands, pp. 87 - 91, https://www.springer.com/gp/book/9780387747583#aboutBook
  • Journal articles | 2021
    Professor Jeya Jeyakumar
    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, http://dx.doi.org/10.1007/s10898-021-01050-x
    Journal articles | 2021
    Professor Jeya Jeyakumar
    Chuong TD; Jeyakumar V; Li G; Woolnough D, 2021, 'Exact dual semi-definite programs for affinely adjustable robust SOS-convex polynomial optimization problems', Optimization, http://dx.doi.org/10.1080/02331934.2021.1902521
    Journal articles | 2021
    Professor Jeya Jeyakumar
    Woolnough D; Jeyakumar N; Li G; Loy CT; Jeyakumar V, 2021, 'Robust Optimization and Data Classification for Characterization of Huntington Disease Onset via Duality Methods', Journal of Optimization Theory and Applications, http://dx.doi.org/10.1007/s10957-021-01835-w
    Journal articles | 2021
    Professor Jeya Jeyakumar
    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, vol. 189, pp. 597 - 622, http://dx.doi.org/10.1007/s10957-021-01846-7
    Journal articles | 2021
    Professor Jeya Jeyakumar
    Goberna MA; Jeyakumar V; Li G; Vicente-Pérez J, 2021, 'The radius of robust feasibility of uncertain mathematical programs: A Survey and recent developments', European Journal of Operational Research, http://dx.doi.org/10.1016/j.ejor.2021.04.035
    Journal articles | 2021
    Professor Jeya Jeyakumar
    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, vol. 15, pp. 25 - 44, http://dx.doi.org/10.1007/s11590-020-01595-y
    Journal articles | 2020
    Professor Jeya Jeyakumar
    Chuong TD; Jeyakumar V, 2020, 'Generalized Farkas Lemma with Adjustable Variables and Two-Stage Robust Linear Programs', Journal of Optimization Theory and Applications, vol. 187, pp. 488 - 519, http://dx.doi.org/10.1007/s10957-020-01753-3
    Journal articles | 2020
    Professor Jeya Jeyakumar
    Chieu NH; Jeyakumar V; Li G, 2020, 'Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality', European Journal of Operational Research, vol. 280, pp. 441 - 452, http://dx.doi.org/10.1016/j.ejor.2019.08.009
    Journal articles | 2020
    Professor Jeya Jeyakumar
    Chieu NH; Jeyakumar V; Li G, 2020, 'Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality', EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, vol. 280, pp. 441 - 452, http://dx.doi.org/10.1016/j.ejor.2019.08.009
    Journal articles | 2019
    Professor Jeya Jeyakumar
    Jeyakumar V; Mohebi H, 2019, 'Characterizing best approximation from a convex set without convex representation', Journal of Approximation Theory, vol. 239, pp. 113 - 127, http://dx.doi.org/10.1016/j.jat.2018.11.003
    Journal articles | 2019
    Professor Jeya Jeyakumar
    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, vol. 75, pp. 885 - 919, http://dx.doi.org/10.1007/s10898-019-00831-9
    Journal articles | 2019
    Professor Jeya Jeyakumar
    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, vol. 47, pp. 530 - 536, http://dx.doi.org/10.1016/j.orl.2019.09.013
    Journal articles | 2018
    Professor Jeya Jeyakumar
    Chuong TD; Jeyakumar V, 2018, 'Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers', Journal of Global Optimization, vol. 72, pp. 655 - 678, http://dx.doi.org/10.1007/s10898-018-0665-7
    Journal articles | 2018
    Professor Jeya Jeyakumar
    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, vol. 270, pp. 40 - 50, http://dx.doi.org/10.1016/j.ejor.2018.03.018
    Journal articles | 2018
    Professor Jeya Jeyakumar
    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, vol. 71, pp. 551 - 569, http://dx.doi.org/10.1007/s10898-018-0607-4
    Journal articles | 2018
    Professor Jeya Jeyakumar
    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, vol. 265, pp. 19 - 25, http://dx.doi.org/10.1016/j.ejor.2017.07.038
    Journal articles | 2018
    Professor Jeya Jeyakumar
    Jeyakumar V; Li G, 2018, 'Exact second-order cone programming relaxations for some nonconvex minimax quadratic optimization problems', SIAM Journal on Optimization, vol. 28, pp. 760 - 787, http://dx.doi.org/10.1137/16M1058480
    Journal articles | 2018
    Professor Jeya Jeyakumar
    Thai Doan C; jeyakumar, V, 2018, 'Tight SDP relaxations for a class of robust SOS-convex polynomial programs without the Slater condition', Journal of Convex Analysis, vol. 25, pp. 1159 - 1182, http://www.heldermann.de/JCA/JCA25/JCA254/jca25073.htm
    Journal articles | 2017
    Professor Jeya Jeyakumar
    Thai Doan C, 2017, 'Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications', Applied Mathematics and Computation, vol. 315, pp. 381 - 399, http://dx.doi.org/10.1016/j.amc.2017.07.076
    Journal articles | 2017
    Professor Jeya Jeyakumar
    Thai Doan C; Jeyakumar , 2017, 'Convergent conic linear programming relaxations for cone convex polynomial programs', Operations Research Letters, vol. 45, pp. 220 - 226, http://dx.doi.org/10.1016/j.orl.2017.03.003
    Journal articles | 2017
    Professor Jeya Jeyakumar
    Thai Doan C, 2017, 'Finding Robust Global Optimal Values of Bilevel Polynomial Programs with Uncertain Linear Constraints', Journal of Optimization Theory and Applications, vol. 173, pp. 683 - 703, http://dx.doi.org/10.1007/s10957-017-1069-4
    Journal articles | 2017
    Professor Jeya Jeyakumar
    Chuong TD; Jeyakumar V, 2017, 'An Exact Formula for Radius of Robust Feasibility of Uncertain Linear Programs', Journal of Optimization Theory and Applications, vol. 173, pp. 203 - 226, http://dx.doi.org/10.1007/s10957-017-1067-6
    Journal articles | 2017
    Professor Jeya Jeyakumar
    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, vol. 45, pp. 325 - 333, http://dx.doi.org/10.1016/j.orl.2017.04.005
    Journal articles | 2017
    Professor Jeya Jeyakumar
    Jeyakumar V; Li G, 2017, 'Exact Conic Programming Relaxations for a Class of Convex Polynomial Cone Programs', Journal of Optimization Theory and Applications, vol. 172, pp. 156 - 178, http://dx.doi.org/10.1007/s10957-016-1023-x
    Journal articles | 2016
    Professor Jeya Jeyakumar
    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, vol. 515, pp. 38 - 52, http://dx.doi.org/10.1016/j.laa.2016.11.008
    Journal articles | 2016
    Professor Jeya Jeyakumar
    Chuong TD; Jeyakumar V, 2016, 'Robust global error bounds for uncertain linear inequality systems with applications', Linear Algebra and Its Applications, vol. 493, pp. 183 - 205, http://dx.doi.org/10.1016/j.laa.2015.11.035
    Journal articles | 2016
    Professor Jeya Jeyakumar
    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, vol. 64, pp. 679 - 702, http://dx.doi.org/10.1007/s10898-015-0277-4
    Journal articles | 2016
    Professor Jeya Jeyakumar
    Jeyakumary V; Lasserre JB; Li G; Pham TS, 2016, 'Convergent semidefinite programming relaxations for global bilevel polynomial optimization problems', SIAM Journal on Optimization, vol. 26, pp. 753 - 780, http://dx.doi.org/10.1137/15M1017922
    Journal articles | 2016
    Professor Jeya Jeyakumar
    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, vol. 65, pp. 175 - 190, http://dx.doi.org/10.1007/s10898-015-0356-6
    Journal articles | 2016
    Professor Jeya Jeyakumar
    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, vol. 44, pp. 67 - 73, http://dx.doi.org/10.1016/j.orl.2015.11.011
    Journal articles | 2016
    Professor Jeya Jeyakumar
    Jeyakumar V; Lee GM; Lee JH, 2016, 'SUMS OF SQUARES CHARACTERIZATIONS OF CONTAINMENT OF CONVEX SEMIALGEBRAIC SETS', PACIFIC JOURNAL OF OPTIMIZATION, vol. 12, pp. 29 - 42, http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000371104500003&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=891bb5ab6ba270e68a29b250adbe88d1
    Journal articles | 2016
    Professor Jeya Jeyakumar
    Chuong TD; Jeyakumar V, 2016, 'Characterizing robust local error bounds for linear inequality systems under data uncertainty', Linear Algebra and Its Applications, vol. 489, pp. 199 - 216, http://dx.doi.org/10.1016/j.laa.2015.10.011
    Journal articles | 2015
    Professor Jeya Jeyakumar
    Jeyakumar V; Lee GM; Li G, 2015, 'Characterizing Robust Solution Sets of Convex Programs under Data Uncertainty', Journal of Optimization Theory and Applications, vol. 164, pp. 407 - 435, http://dx.doi.org/10.1007/s10957-014-0564-0
    Journal articles | 2015
    Professor Jeya Jeyakumar
    Jeyakumar V; Li G, 2015, 'A new class of alternative theorems for SOS-convex inequalities and robust optimization', Applicable Analysis, vol. 94, pp. 56 - 74, http://dx.doi.org/10.1080/00036811.2013.859251
    Journal articles | 2015
    Professor Jeya Jeyakumar
    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, vol. 242, pp. 730 - 743, http://dx.doi.org/10.1016/j.ejor.2014.10.027
    Journal articles | 2015
    Professor Jeya Jeyakumar
    Jeyakumar V; Li G; Vicente-Pérez J, 2015, 'Robust SOS-convex polynomial optimization problems: exact SDP relaxations', Optimization Letters, vol. 9, pp. 1 - 18, http://dx.doi.org/10.1007/s11590-014-0732-z
    Journal articles | 2015
    Professor Jeya Jeyakumar
    Jeyakumar V; Li G, 2015, 'A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs', Operations Research Letters, vol. 43, pp. 405 - 410, http://dx.doi.org/10.1016/j.orl.2015.05.006
    Journal articles | 2015
    Professor Jeya Jeyakumar
    Jeyakumar V; Lee GM; Lee JH, 2015, 'Generalized SOS-Convexity and Strong Duality with SDP Dual Programs in Polynomial Optimization', Journal of Convex Analysis, vol. 22, pp. 999 - 1023, http://www.heldermann.de/JCA/JCA22/JCA224/jca22053.htm
    Journal articles | 2014
    Professor Jeya Jeyakumar
    Dinh N; Jeyakumar V, 2014, 'Farkas' lemma: Three decades of generalizations for mathematical optimization', TOP, vol. 22, pp. 1 - 22, http://dx.doi.org/10.1007/s11750-014-0319-y
    Journal articles | 2014
    Professor Jeya Jeyakumar
    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, vol. 162, pp. 735 - 753, http://dx.doi.org/10.1007/s10957-013-0496-0
    Journal articles | 2014
    Professor Jeya Jeyakumar
    Jeyakumar V; Lasserre JB; Li G, 2014, 'On Polynomial Optimization Over Non-compact Semi-algebraic Sets', Journal of Optimization Theory and Applications, vol. 163, pp. 707 - 718, http://dx.doi.org/10.1007/s10957-014-0545-3
    Journal articles | 2014
    Professor Jeya Jeyakumar
    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, vol. 24, pp. 1402 - 1419, http://dx.doi.org/10.1137/130939596
    Journal articles | 2014
    Professor Jeya Jeyakumar
    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, vol. 58, pp. 31 - 50, http://dx.doi.org/10.1007/s10898-013-0058-x
    Journal articles | 2014
    Professor Jeya Jeyakumar
    Jeyakumar V; Li GY, 2014, 'Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization', Mathematical Programming, vol. 147, pp. 171 - 206, http://dx.doi.org/10.1007/s10107-013-0716-2
    Journal articles | 2014
    Professor Jeya Jeyakumar
    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, vol. 42, pp. 34 - 40, http://dx.doi.org/10.1016/j.orl.2013.11.005
    Journal articles | 2014
    Professor Jeya Jeyakumar
    Dinh N; Jeyakumar V, 2014, 'Rejoinder on: Farkas' lemma: Three decades of generalizations for mathematical optimization', TOP, vol. 22, pp. 41 - 44, http://dx.doi.org/10.1007/s11750-014-0320-5
    Journal articles | 2014
    Professor Jeya Jeyakumar
    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
    Journal articles | 2013
    Professor Jeya Jeyakumar
    Jeyakumar V; Li G, 2013, 'Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty', Journal of Global Optimization, vol. 55, pp. 209 - 226, http://dx.doi.org/10.1007/s10898-012-9857-8
    Journal articles | 2013
    Professor Jeya Jeyakumar
    Bot R; Jeyakumar V; Li G, 2013, 'Robust duality in parametric convex optimization', Set-Valued and Variational Analysis, vol. 21, pp. 177 - 189, http://dx.doi.org/10.1007/s11228-012-0219-y
    Journal articles | 2013
    Professor Jeya Jeyakumar
    Goberna MA; Jeyakumar V; Li G; López MA, 2013, 'Robust linear semi-infinite programming duality under uncertainty', Mathematical Programming, vol. 139, pp. 185 - 203, http://dx.doi.org/10.1007/s10107-013-0668-6
    Journal articles | 2013
    Professor Jeya Jeyakumar
    Jeyakumar V; Li G; Srisatkunarajah S, 2013, 'Strong duality for robust minimax fractional programming problems', European Journal of Operational Research, vol. 228, pp. 331 - 336, http://dx.doi.org/10.1016/j.ejor.2013.02.015
    Journal articles | 2013
    Professor Jeya Jeyakumar
    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, vol. 81, pp. 1 - 11, http://dx.doi.org/10.1016/j.na.2012.12.009
    Journal articles | 2013
    Professor Jeya Jeyakumar
    Jeyakumar V; Li G; Wang J, 2013, 'Some robust convex programs without duality gap', Journal of Convex Analysis, vol. 20, pp. 377 - 394, http://web.maths.unsw.edu.au/~gyli/papers/jlw_duality_gap.pdf
    Journal articles | 2013
    Professor Jeya Jeyakumar
    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
    Journal articles | 2012
    Professor Jeya Jeyakumar
    Jeyakumar V; Li G, 2012, 'Exact SDP relaxations for classes of nonlinear semidefinite programming problems', Operations Research Letters, vol. 40, pp. 529 - 536, http://dx.doi.org/10.1016/j.orl.2012.09.006
    Journal articles | 2012
    Professor Jeya Jeyakumar
    Jeyakumar V; Li G; Suthaharan S, 2012, 'Support vector machine classifiers with uncertain knowledge sets via robust optimization', Optimization, vol. 63, pp. 1099 - 1116, http://dx.doi.org/10.1080/02331934.2012.703667
    Journal articles | 2012
    Professor Jeya Jeyakumar
    Jeyakumar V; Li G, 2012, 'Strong duality in robust semi-definite linear programming under data uncertainty', Optimization, vol. 63, pp. 713 - 733, http://dx.doi.org/10.1080/02331934.2012.690760
    Journal articles | 2012
    Professor Jeya Jeyakumar
    Jeyakumar V; Wang J; Li G, 2012, 'Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty', Journal of Mathematical Analysis and Applications, vol. 393, pp. 285 - 297, http://dx.doi.org/10.1016/j.jmaa.2012.03.037
    Journal articles | 2012
    Professor Jeya Jeyakumar
    Jeyakumar V; Li G; Lee GM, 2012, 'Robust duality for generalized convex programming prolems under data uncertainty', Nonlinear Analysis - Theory Methods and Applications, vol. 75, pp. 1362 - 1373, http://dx.doi.org/10.1016/j.na.2011.04.006
    Journal articles | 2011
    Professor Jeya Jeyakumar
    Jeyakumar V; Li G, 2011, 'Robust duality for fractional programming problems with constraint-wise data uncertainty', Journal of Optimization Theory and Applications, vol. 151, pp. 292 - 303, http://dx.doi.org/10.1007/s10957-011-9896-1
    Journal articles | 2011
    Professor Jeya Jeyakumar
    Jeyakumar V; Li G, 2011, 'Necessary global optimality conditions for nonlinear programming problems with polynomial constraints', Mathematical Programming, vol. 126, pp. 393 - 399, http://dx.doi.org/10.1007/s10107-009-0283-8
    Journal articles | 2011
    Professor Jeya Jeyakumar
    Jeyakumar V; Li G; Lee GM, 2011, 'A robust Von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty', Operations Research Letters, vol. 39, pp. 109 - 114, http://dx.doi.org/10.1016/j.orl.2011.02.007
    Journal articles | 2011
    Professor Jeya Jeyakumar
    Jeyakumar V; Li G, 2011, 'Robust Farkas’ lemma for uncertain linear systems with applications', Positivity, vol. 15, pp. 331 - 342, http://dx.doi.org/10.1007/s11117-010-0078-4
    Journal articles | 2011
    Professor Jeya Jeyakumar
    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, vol. 74, pp. 2327 - 2341, http://dx.doi.org/10.1016/j.na.2010.11.036
    Journal articles | 2011
    Professor Jeya Jeyakumar
    Jeyakumar V; Li G, 2011, 'Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems', Journal of Global Optimization, vol. 49, pp. 1 - 14, http://dx.doi.org/10.1007/s10898-009-9518-8
    Journal articles | 2010
    Professor Jeya Jeyakumar
    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, vol. 206, pp. 470 - 478, http://dx.doi.org/10.1016/j.ejor.2010.03.017
    Journal articles | 2010
    Professor Jeya Jeyakumar
    Cysique LA; Murray JM; Dunbar M; Jeyakumar V; Brew BJ, 2010, 'A screening algorithm for HIV associated neurocognitive disorders', HIV Medicine, vol. 11, pp. 642 - 649, http://dx.doi.org/10.1111/j.1468-1293.2010.00834.x
    Journal articles | 2010
    Professor Jeya Jeyakumar
    Jeyakumar V; Li G, 2010, 'Strong duality in robust convex programming: complete characterizations', SIAM Journal on Optimization, vol. 20, pp. 3384 - 3407, http://dx.doi.org/10.1137/100791841
    Journal articles | 2010
    Professor Jeya Jeyakumar
    Jeyakumar V; Li G, 2010, 'Characterizing robust set containments and solutions of uncertain linear programs without qualifications', Operations Research Letters, vol. 38, pp. 188 - 194, http://dx.doi.org/10.1016/j.orl.2009.12.004
    Journal articles | 2010
    Professor Jeya Jeyakumar
    Jeyakumar V; Lee G; Srisatkunarajah S, 2010, 'Distinguishing a global minimizer from local minimizers of quadratic minimization with mixed variables', Pacific Journal of Optimization, vol. 6, pp. 65 - 74
    Journal articles | 2010
    Professor Jeya Jeyakumar
    Phat VN; Jeyakumar V, 2010, 'Stability, stabilization and duality for linear time-varying systems', Optimization, vol. 59, pp. 447 - 460, http://dx.doi.org/10.1080/02331930801950845
    Journal articles | 2010
    Professor Jeya Jeyakumar
    Jeyakumar V; Li G, 2010, 'New strong duality results for convex programs with separable constraints', European Journal of Operational Research, vol. 207, pp. 1203 - 1209, http://dx.doi.org/10.1016/j.ejor.2010.07.007
    Journal articles | 2010
    Professor Jeya Jeyakumar
    Jeyakumar V; Huy N, 2010, 'Global optimality conditions for nonlinear programming problems with bounds via quadratic underestimators', Optimization, vol. 59, pp. 161 - 173, http://dx.doi.org/10.1080/02331930801951199
    Journal articles | 2009
    Professor Jeya Jeyakumar
    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, vol. 360, pp. 156 - 167, http://dx.doi.org/10.1016/j.jmaa.2009.06.043
    Journal articles | 2009
    Professor Jeya Jeyakumar
    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, vol. 71, pp. e2239 - e2249, http://dx.doi.org/10.1016/j.na.2009.05.009
    Journal articles | 2009
    Professor Jeya Jeyakumar
    Jeyakumar V; Lee GM; Li G, 2009, 'Alternative theorems for quadratic inequality systems and global quadratic optimization', SIAM Journal on Optimization, vol. 20, pp. 983 - 1001, http://dx.doi.org/10.1137/080736090
    Journal articles | 2009
    Professor Jeya Jeyakumar
    Jeyakumar V; Li G, 2009, 'Farkas' lemma for separable sublinear inequalities without qualifications', Optimization Letters, vol. 3, pp. 537 - 545, http://dx.doi.org/10.1007/s11590-009-0133-x
    Journal articles | 2009
    Professor Jeya Jeyakumar
    Jeyakumar V; Li G; Huy N, 2009, 'Necessary and sufficient conditions for S-lemma and nonconvex quadratic optimization', Optimization and Engineering, vol. 10, pp. 491 - 503, http://dx.doi.org/10.1007/s11081-008-9076-9
    Journal articles | 2009
    Professor Jeya Jeyakumar
    Jeyakumar V; Srisatkunarajah S, 2009, 'A note on sufficient global optimality conditions for fixed charge quadratic programs', Applied Mathematics Letters, vol. 22, pp. 1016 - 1020, http://dx.doi.org/10.1016/j.aml.2009.01.010
    Journal articles | 2009
    Professor Jeya Jeyakumar
    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, vol. 3, pp. 23 - 33, http://dx.doi.org/10.1007/s11590-008-0088-3
    Journal articles | 2009
    Professor Jeya Jeyakumar
    Jeyakumar V; Li G, 2009, 'Qualification-free optimality conditions for convex programs with separable inequality constraints', Journal of Convex Analysis, vol. 16, pp. 845 - 856
    Journal articles | 2009
    Professor Jeya Jeyakumar
    Jeyakumar V; Lee GM; Srisatkunarajah S, 2009, 'New Kuhn-Tucker sufficiency for global optimality via convexification', Nonlinear Analysis, Theory, Methods and Applications, vol. 71, pp. 373 - 381, http://dx.doi.org/10.1016/j.na.2008.10.083
    Journal articles | 2009
    Professor Jeya Jeyakumar
    Jeyakumar V; Srisatkunarajah S, 2009, 'Geometric conditions for Kuhn-Tucker sufficiently of global optimality in mathematical programming', European Journal of Operational Research, vol. 194, pp. 363 - 367, http://dx.doi.org/10.1016/j.ejor.2007.12.021
    Journal articles | 2009
    Professor Jeya Jeyakumar
    Jeyakumar V; Srisatkunarajah S, 2009, 'New sufficiency for global optimality and duality of mathematical programming problems via underestimators', Journal of Optimization Theory and Applications, vol. 140, pp. 239 - 247, http://dx.doi.org/10.1007/s10957-008-9438-7
    Journal articles | 2009
    Professor Jeya Jeyakumar
    Jeyakumar V; Lee GM; Srisatkunarajah S, 2009, 'New Kuhn-Tucker sufficiency for global optimality via convexification', Nonlinear Analysis - Theory Methods and Applications, vol. 71, pp. 373 - 381
    Journal articles | 2008
    Professor Jeya Jeyakumar
    Jeyakumar V, 2008, 'Constraint qualifications characterizing lagrangian duality in convex optimization', Journal of Optimization Theory and Applications, vol. 136, pp. 31 - 41, http://dx.doi.org/10.1007/s10957-007-9294-x
    Journal articles | 2008
    Professor Jeya Jeyakumar
    Jeyakumar V; Lee GM, 2008, 'Complete characterizations of stable Farkas` lemma and cone-convex programming duality', Mathematical Programming, vol. 114, pp. 335 - 347, http://dx.doi.org/10.1007/s10107-007-0104-x
    Journal articles | 2008
    Professor Jeya Jeyakumar
    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, vol. 68, pp. 1184 - 1194, http://dx.doi.org/10.1016/j.na.2006.12.014
    Journal articles | 2008
    Professor Jeya Jeyakumar
    Jeyakumar V, 2008, 'A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions', Optimization Letters, vol. 2, pp. 15 - 25, http://dx.doi.org/10.1007/s11590-006-0038-x
    Journal articles | 2008
    Professor Jeya Jeyakumar
    Jeyakumar V; Srisatkunarajah S; Nguyen H, 2008, 'Unified global optimality conditions for smooth minimization problems with mixed variables', Rairo-Operations Research, vol. 42, pp. 361 - 370, http://dx.doi.org/10.1051/ro:2008019
    Journal articles | 2008
    Professor Jeya Jeyakumar
    Gwinner J; Jeyakumar V; Lee GM, 2008, 'Necessary and sufficient conditions for globally stable convex minimax theorems', Pacific Journal of Optimization, vol. 4, pp. 483 - 491
    Journal articles | 2008
    Professor Jeya Jeyakumar
    Jeyakumar V, 2008, 'Constraint qualifications characterizing Lagrangian duality in convex optimization', Journal of Optimization Theory and Applications, vol. 136, pp. 369 - 391
    Journal articles | 2008
    Professor Jeya Jeyakumar
    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, vol. 15, pp. 63 - 71
    Journal articles | 2008
    Professor Jeya Jeyakumar
    Jeyakumar V; Huy N, 2008, 'Global minimization of difference of quadratic and convex functions over box or binary constraints', Optimization Letters, vol. 2, pp. 223 - 238
    Journal articles | 2007
    Professor Jeya Jeyakumar
    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, vol. 133, pp. 123 - 130, http://dx.doi.org/10.1007/s10957-007-9177-1
    Journal articles | 2007
    Professor Jeya Jeyakumar
    Jeyakumar V; Wu Z, 2007, 'A dual criterion for maximal monotonicity of composition operators', Set - Valued Analysis, vol. 15, pp. 265 - 273, http://dx.doi.org/10.1007/s11228-006-0025-5
    Journal articles | 2007
    Professor Jeya Jeyakumar
    Jeyakumar V; Rubinov A; Wu ZY, 2007, 'Generalized Fenchel`s conjugation formulas and duality for abstract convex functions', Journal of Optimization Theory and Applications, vol. 132, pp. 441 - 458, http://dx.doi.org/10.1007/s10957-007-9185-1
    Journal articles | 2007
    Professor Jeya Jeyakumar
    Jeyakumar V; Rubinov A; Wu ZY, 2007, 'Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions', Mathematical Programming, vol. 110, pp. 521 - 541, http://dx.doi.org/10.1007/s10107-006-0012-5
    Journal articles | 2007
    Professor Jeya Jeyakumar
    Jeyakumar V; Huy N, 2007, 'Global minimization of difference of quadratic and convex functions over box or binary constraints', Optimization Letters, vol. 2, pp. 223 - 238, http://dx.doi.org/10.1007/s11590-007-0053-6
    Journal articles | 2007
    Professor Jeya Jeyakumar
    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, vol. 335, pp. 779 - 788, http://dx.doi.org/10.1016/j.jmaa.2007.02.013
    Journal articles | 2007
    Professor Jeya Jeyakumar
    Jeyakumar V; Huy N, 2007, 'Global optimality of quadratic minimization over symmetric polytopes', Optimization, vol. 56, pp. 633 - 640, http://dx.doi.org/10.1080/02331930701617395
    Journal articles | 2007
    Professor Jeya Jeyakumar
    Jeyakumar V; Wu ZY, 2007, 'Conditions for global optimality of quadratic minimization problems with LMI constraints', Asia-Pacific Journal of Operational Research, vol. 24, pp. 149 - 160, http://dx.doi.org/10.1142/S021759590700119X
    Journal articles | 2006
    Professor Jeya Jeyakumar
    Jeyakumar V; Wu ZY; Lee GM; Dinh N, 2006, 'Liberating the subgradient optimality conditions from constraint qualifications', Journal of Global Optimization, vol. 36, pp. 127 - 137, http://dx.doi.org/10.1007/s10898-006-9003-6
    Journal articles | 2006
    Professor Jeya Jeyakumar
    Jeyakumar V; Rubinov A; Wu ZY, 2006, 'Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints', Journal of Global Optimization, vol. 36, pp. 471 - 481, http://dx.doi.org/10.1007/s10898-006-9022-3
    Journal articles | 2006
    Professor Jeya Jeyakumar
    Jeyakumar V; Lee GM; Dinh N, 2006, 'Characterizations of solution sets of convex vector minimization problems', European Journal of Operational Research, vol. 174, pp. 1380 - 1395, http://dx.doi.org/10.1016/j.ejor.2005.05.007
    Journal articles | 2006
    Professor Jeya Jeyakumar
    Jeyakumar V; Ormerod JT; Womersley RS, 2006, 'Knowledge-based semidefinite linear programming classifiers', Optimization Methods and Software, vol. 21, pp. 693 - 706, http://dx.doi.org/10.1080/10556780500137066
    Journal articles | 2006
    Professor Jeya Jeyakumar
    Dinh N; Jeyakumar V; Lee G, 2006, 'Lagrange multiplier characterizations of solution sets of constrained pseudolinear optimization problems', Optimization, vol. 55, pp. 241 - 250, http://dx.doi.org/10.1080/02331930600662849
    Journal articles | 2006
    Professor Jeya Jeyakumar
    Burachik RS; Jeyakumar V; Wu Z, 2006, 'Necessary and sufficient conditions for stable conjugate duality', Nonlinear Analysis - Theory Methods and Applications, vol. 64, pp. 1998 - 2006, http://dx.doi.org/10.1016/j.na.2005.07.034
    Journal articles | 2006
    Professor Jeya Jeyakumar
    Goberna MA; Jeyakumar V; Dinh N, 2006, 'Dual characterizations of set containments with strict convex inequalities', Journal of Global Optimization, vol. 34, pp. 33 - 54, http://dx.doi.org/10.1007/s10898-005-3885-6
    Journal articles | 2006
    Professor Jeya Jeyakumar
    Jeyakumar V, 2006, 'The strong conical hull intersection property for convex programming', Mathematical Programming, vol. 106, pp. 81 - 92, http://dx.doi.org/10.1007/s10107-005-0605-4
    Journal articles | 2006
    Professor Jeya Jeyakumar
    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, vol. 47, pp. 439 - 450, http://dx.doi.org/10.1017/S1446181100010063
    Journal articles | 2006
    Professor Jeya Jeyakumar
    Jeyakumar V; Thera M; Wu Z, 2006, 'Asymptotic sums of monotone operators', Pacific Journal of Optimization, vol. 2, pp. 591 - 598
    Journal articles | 2006
    Professor Jeya Jeyakumar
    Jeyakumar V; Wu Z, 2006, 'A qualification free sequential Pshenichnyi-Rockafellar Lemma and convex semidefinite programming', Journal of Convex Analysis, vol. 13, pp. 773 - 784
    Journal articles | 2005
    Professor Jeya Jeyakumar
    Jeyakumar V; Mohebi H, 2005, 'Limiting epsilon-subgradient characterizations of constrained best approximations', Journal of Approximation Theory, vol. 135, pp. 145 - 159, http://dx.doi.org/10.1016/j.jat.2005.04.004
    Journal articles | 2005
    Professor Jeya Jeyakumar
    Burachik RS; Jeyakumar V, 2005, 'A new geometric condition for Fenchel`s duality in infinite dimensional spaces', Mathematical Programming, vol. 104, pp. 229 - 233, http://dx.doi.org/10.1007/s10107-005-0614-3
    Journal articles | 2005
    Professor Jeya Jeyakumar
    Burachik RS; Jeyakumar V, 2005, 'A simple closure condition for the normal cone intersection formula', Proceedings of the American Mathematical Society, vol. 133, pp. 1741 - 1748, http://dx.doi.org/10.1090/S0002-9939-04-07844-X
    Journal articles | 2005
    Professor Jeya Jeyakumar
    Dinh N; Jeyakumar V; Lee GM, 2005, 'Sequential lagrangian conditions for convex programs with applications to semidefinite programming', Journal of Optimization Theory and Applications, vol. 125, pp. 85 - 112, http://dx.doi.org/10.1007/s10957-004-1712-8
    Journal articles | 2005
    Professor Jeya Jeyakumar
    Jeyakumar V; Mohebi H, 2005, 'A global approach to nonlinearly constrained best approximation', Numerical Functional Analysis and Optimization, vol. 26, pp. 205 - 227, http://dx.doi.org/10.1081/NFA-200063880
    Journal articles | 2005
    Professor Jeya Jeyakumar
    Burachik RS; Jeyakumar V, 2005, 'A dual condition for the convex subdifferential sum formula with applications', Journal of Convex Analysis, vol. 12, pp. 279 - 290
    Journal articles | 2004
    Professor Jeya Jeyakumar
    Jeyakumar V; Yen ND, 2004, 'Solution stability of nonsmooth continuous systems with applications to cone-constrained optimization', Journal of Optimization Theory and Applications, vol. 14, pp. 1106 - 1127, http://dx.doi.org/10.1137/S1052623402419236
    Journal articles | 2004
    Professor Jeya Jeyakumar
    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, vol. 123, pp. 83 - 103, http://dx.doi.org/10.1023/B:JOTA.0000043992.38554.c8
    Journal articles | 2003
    Professor Jeya Jeyakumar
    Jeyakumar V, 2003, 'Characterizing set containments involving infinite convex constraints and reverse-convex constraints', SIAM Journal on Optimization, vol. 13, pp. 947 - 959, http://dx.doi.org/10.1137/S1052623402401944
    Journal articles | 2003
    Professor Jeya Jeyakumar
    Jeyakumar V; Lee GM; Dinh N, 2003, 'New sequential Lagrange multiplier conditions characterizing optimality without constraint qualification for convex programs', SIAM Journal on Optimization, vol. 14, pp. 534 - 547, http://dx.doi.org/10.1137/S1052623402417699
    Journal articles | 2003
    Professor Jeya Jeyakumar
    Jeyakumar V; Lee GM; Dinh N, 2003, 'New sequential Lagrange multiplier conditions characterizing optimality without constraint qualification for convex programs', SIAM JOURNAL ON OPTIMIZATION, vol. 14, pp. 534 - 547, http://dx.doi.org/10.1137/S1052623402417699
    Journal articles | 2003
    Professor Jeya Jeyakumar
    Jeyakumar V; Luc DT, 2003, 'Sharp variational conditions for convex composite nonsmooth functions', SIAM Journal on Optimization, vol. 13, pp. 904 - 920, http://dx.doi.org/10.1137/S1052623401396509
    Journal articles | 2003
    Professor Jeya Jeyakumar
    Jeyakumar V, 2003, 'Characterizing set containments involving infinite convex constraints', SIAM Journal on Optimization, vol. 13, pp. 947 - 959
    Journal articles | 2002
    Professor Jeya Jeyakumar
    Jeyakumar V; Luc DT, 2002, 'An open mapping theorem using unbounded generalized Jacobians', Nonlinear Analysis - Theory Methods and Applications, vol. 50, pp. 647 - 663, http://dx.doi.org/10.1016/S0362-546X(01)00774-X
    Journal articles | 2002
    Professor Jeya Jeyakumar
    Jeyakumar V; Luc DT; Tinh PN, 2002, 'Convex composite non-Lipschitz programming', Mathematical Programming, vol. 92, pp. 177 - 195, http://dx.doi.org/10.1007/s101070100274
    Journal articles | 2002
    Professor Jeya Jeyakumar
    Jeyakumar V; Luc DT, 2002, 'Convex interior mapping theorems for continuous nonsmooth functions and optimization', Journal of Nonlinear and Convex Analysis, vol. 3, pp. 251 - 266
    Journal articles | 2001
    Professor Jeya Jeyakumar
    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, vol. 110, pp. 493 - 513, http://dx.doi.org/10.1023/A:1017580126509
    Journal articles | 2000
    Professor Jeya Jeyakumar
    Wang XJ; Jeyakumar V, 2000, 'A sharp Lagrange multiplier rule for nonsmooth mathematical programming problems involving equality constraints', SIAM Journal on Optimization, vol. 10, pp. 1136 - 1148, http://dx.doi.org/10.1137/S1052623499354540
    Journal articles | 2000
    Professor Jeya Jeyakumar
    Jeyakumar V; Nealon MJ, 2000, 'Complete dual characterizations of optimaility for convex semidefinite programming', Canadian Mathematical Society, pp. 165 - 173
    Journal articles | 1999
    Professor Jeya Jeyakumar
    Jeyakumar V; Luc TD, 1999, 'Nonsmooth calculus, minimality, and monotonicity of convexificators 1,2', Journal of Optimization Theory and Applications, vol. 101, pp. 599 - 621, http://dx.doi.org/10.1023/A:1021790120780
    Journal articles | 1999
    Professor Jeya Jeyakumar
    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, vol. 40, pp. 403 - 420
    Journal articles | 1999
    Professor Jeya Jeyakumar
    Jeyakumar V; Luc DT, 1999, 'Approximate generalized Hessians and Taylor`s expansions for continuously Gateaux differentiable functions', Nonlinear Analysis - Theory Methods and Applications, vol. 36, pp. 353 - 368, http://dx.doi.org/10.1016/S0362-546X(98)00058-3
    Journal articles | 1999
    Professor Jeya Jeyakumar
    Jeyakumar V; Teo KL, 1999, 'Untitled - Preface', JOURNAL OF THE AUSTRALIAN MATHEMATICAL SOCIETY SERIES B-APPLIED MATHEMATICS, vol. 40, pp. 288 - 288, http://dx.doi.org/10.1017/S0334270000010900
    Journal articles | 1999
    Professor Jeya Jeyakumar
    Glover BM; Rubinov A; Jeyakumar V, 1999, 'Dual conditions characterizing optimality for convex multi-objective programs', Mathematical Programming, vol. 84, pp. 201 - 217, http://dx.doi.org/10.1007/s10107980013a
    Journal articles | 1998
    Professor Jeya Jeyakumar
    Jeyakumar V; Luc DT, 1998, 'Approximate Jacobian matrices for nonsmooth continuous maps and C1-optimization', SIAM Journal on Control and Optimization, vol. 36, pp. 1815 - 1832, http://dx.doi.org/10.1137/S0363012996311745
    Journal articles | 1998
    Professor Jeya Jeyakumar
    Jeyakumar V; Luc DT; Schaible S, 1998, 'Characterizations of generalized monotone nonsmooth continuous maps using approximate Jocobians', Journal of Convex Analysis, vol. 5, pp. 119 - 132
    Journal articles | 1997
    Professor Jeya Jeyakumar
    Jeyakumar V, 1997, 'Asymptotic dual conditions characterizing optimality for infinite convex programs', Journal of Optimization Theory and Applications, vol. 93, pp. 153 - 165, http://dx.doi.org/10.1023/A:1022606002804
    Journal articles | 1997
    Professor Jeya Jeyakumar
    Demyanov VF; Jeyakumar V, 1997, 'Hunting for a smaller convex subdifferential', Journal of Global Optimization, vol. 10, pp. 305 - 326, http://dx.doi.org/10.1023/A:1008246130864
    Journal articles | 1997
    Professor Jeya Jeyakumar
    Yang XQ; Jeyakumar V, 1997, 'First and second order optimality conditions for convex composite multiobjective optimization', Journal of Optimization Theory and Applications, vol. 95, pp. 209 - 224, http://dx.doi.org/10.1023/A:1022695714596
    Journal articles | 1996
    Professor Jeya Jeyakumar
    Jeyakumar V; Rubinov A; Glover BM; Ishizuka Y, 1996, 'Inequality systems and flobal optimization', Journal of Mathematical Analysis and Applications, vol. 202, pp. 900 - 919, http://dx.doi.org/10.1006/jmaa.1996.0353
    Journal articles | 1996
    Professor Jeya Jeyakumar
    Rubinov A; Jeyakumar V; Glover BM, 1996, 'Generalized convex relations with applications to optimization and models of economic dynamics', Set - Valued Analysis, vol. 4, pp. 67 - 89, http://dx.doi.org/10.1007/BF00419374
    Journal articles | 1996
    Professor Jeya Jeyakumar
    Jeyakumar V; Zaffaroni A, 1996, 'Asymptotic conditions for weak and proper optimality in infinite dimensional convex vector optimization', Numerical Functional Analysis and Optimization, vol. 17, pp. 323 - 343, http://dx.doi.org/10.1080/01630569608816697
    Journal articles | 1996
    Professor Jeya Jeyakumar
    Jeyakumar V; Glover BM, 1996, 'Characterizing global optimality for DC optimization problems under convex inequality constraints', Journal of Global Optimization, vol. 8, pp. 171 - 187, http://dx.doi.org/10.1007/BF00138691
    Journal articles | 1996
    Professor Jeya Jeyakumar
    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, vol. 6, pp. 362 - 372, http://dx.doi.org/10.1137/0806021
    Journal articles | 1995
    Professor Jeya Jeyakumar
    Jeyakumar V; Yang XQ, 1995, 'Convex composite minimization with C1,1 functions', Journal of Optimization Theory and Applications, vol. 86, pp. 631 - 648, http://dx.doi.org/10.1007/BF02192162
    Journal articles | 1995
    Professor Jeya Jeyakumar
    Jeyakumar V; Yang XQ, 1995, 'On characterizing the solution sets of pseudolinear programs', Journal of Optimization Theory and Applications, vol. 87, pp. 747 - 755, http://dx.doi.org/10.1007/BF02192142
    Journal articles | 1995
    Professor Jeya Jeyakumar
    Jeyakumar V; Glover BM, 1995, 'Nonlinear extensions of Farkas` lemma with applications to global optimization and least squares', Mathematics of Operations Research, vol. 20, pp. 818 - 837, http://dx.doi.org/10.1287/moor.20.4.818
    Journal articles | 1995
    Professor Jeya Jeyakumar
    Studniarski M; Jeyakumar V, 1995, 'A generalized mean-value theorem and optimality conditions in composite nonsmooth minimization', Nonlinear Analysis - Theory Methods and Applications, vol. 24, pp. 883 - 894, http://dx.doi.org/10.1016/0362-546X(94)00122-X
    Journal articles | 1995
    Professor Jeya Jeyakumar
    Rubinov A; Glover BM; Jeyakumar V, 1995, 'A general approach to dual characterizations of solvability of inequality systems with applications', Journal of Convex Analysis, vol. 2, pp. 309 - 344
    Journal articles | 1994
    Professor Jeya Jeyakumar
    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, vol. 74, pp. 71 - 72, http://dx.doi.org/10.1002/zamm.19940740120
    Journal articles | 1994
    Professor Jeya Jeyakumar
    Glover BM; Jeyakumar V; Oettli W, 1994, 'Solvability theorems for classes of difference convex functions', Nonlinear Analysis, vol. 22, pp. 1191 - 1200, http://dx.doi.org/10.1016/0362-546X(94)90104-X
    Journal articles | 1994
    Professor Jeya Jeyakumar
    Glover BM; Jeyakumar V; Oettli W, 1994, 'A Farkas lemma for difference sublinear systems and quasidifferentiable programming', Mathematical Programming, vol. 63, pp. 109 - 125, http://dx.doi.org/10.1007/BF01582061
    Journal articles | 1993
    Professor Jeya Jeyakumar
    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, vol. 179, pp. 537 - 546, http://dx.doi.org/10.1006/jmaa.1993.1368
    Journal articles | 1993
    Professor Jeya Jeyakumar
    Jeyakumar V; Yang XQ, 1993, 'Convex composite multi-objective nonsmooth programming', Mathematical Programming, vol. 59, pp. 325 - 343, http://dx.doi.org/10.1007/BF01581251
    Journal articles | 1993
    Professor Jeya Jeyakumar
    Gwinner J; Jeyakumar V, 1993, 'A solvability theorem and minimax fractional programming', ZOR Zeitschrift für Operations Research Methods and Models of Operations Research, vol. 37, pp. 1 - 12, http://dx.doi.org/10.1007/BF01415524
    Journal articles | 1993
    Professor Jeya Jeyakumar
    Jeyakumar V; Glover BM, 1993, 'A new version of Farkas' lemma and global convex maximization', Applied Mathematics Letters, vol. 6, pp. 39 - 43, http://dx.doi.org/10.1016/0893-9659(93)90097-7
    Journal articles | 1993
    Professor Jeya Jeyakumar
    Jeyakumar V; Yang XQ, 1993, 'Convex composite multi-objective nonsmooth programming', Mathematical Programming, Series A, vol. 59, pp. 325 - 343
    Journal articles | 1992
    Professor Jeya Jeyakumar
    Jeyakumar V; Mond B, 1992, 'On generalized convexmathematical programming', Journal of Australian Mathematical Society, vol. 1, pp. 43 - 53, http://dx.doi.org/10.1017/S0334270000007372
    Journal articles | 1992
    Professor Jeya Jeyakumar
    Yang XQ; Jeyakumar V, 1992, 'Generalized second-order directional derivatives and optimization with C1,1 functions', Optimization, vol. 26, pp. 165 - 185, http://dx.doi.org/10.1080/02331939208843851
    Journal articles | 1992
    Professor Jeya Jeyakumar
    Jeyakumar V; Wolkowicz H, 1992, 'Generalizations of Slater's constraint qualification for infinite convex programs', Mathematical Programming, vol. 57, pp. 85 - 101, http://dx.doi.org/10.1007/BF01581074
    Journal articles | 1992
    Professor Jeya Jeyakumar
    Jeyakumar V, 1992, 'Infinite-dimensional convex programming with applications to constrained approximation', Journal of Optimization Theory and Applications, vol. 75, pp. 569 - 586, http://dx.doi.org/10.1007/BF00940493
    Journal articles | 1991
    Professor Jeya Jeyakumar
    Jeyakumar V, 1991, 'Composite Nonsmooth Programming with Gâteaux Differentiability', SIAM Journal on Optimization, vol. 1, pp. 30 - 41, http://dx.doi.org/10.1137/0801004
    Journal articles | 1991
    Professor Jeya Jeyakumar
    Jeyakumar V; Gwinner J, 1991, 'Inequality systems and optimization', Journal of Mathematical Analysis and Applications, vol. 159, pp. 51 - 71, http://dx.doi.org/10.1016/0022-247X(91)90221-K
    Journal articles | 1990
    Professor Jeya Jeyakumar
    Jeyakumar V; Wolkowicz H, 1990, 'Zero duality gaps in infinite-dimensional programming', Journal of Optimization Theory and Applications, vol. 67, pp. 87 - 108, http://dx.doi.org/10.1007/BF00939737
    Journal articles | 1990
    Professor Jeya Jeyakumar
    Jeyakumar V, 1990, 'Duality and infinite dimensional optimization', Nonlinear Analysis, vol. 15, pp. 1111 - 1122, http://dx.doi.org/10.1016/0362-546X(90)90047-K
    Journal articles | 1988
    Professor Jeya Jeyakumar
    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, vol. 130, pp. 334 - 343, http://dx.doi.org/10.1016/0022-247X(88)90309-5
    Journal articles | 1988
    Professor Jeya Jeyakumar
    WEIR T; JEYAKUMAR V, 1988, 'A CLASS OF NONCONVEX FUNCTIONS AND MATHEMATICAL-PROGRAMMING', BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY, vol. 38, pp. 177 - 189, http://dx.doi.org/10.1017/S0004972700027441
    Journal articles | 1988
    Professor Jeya Jeyakumar
    Weir T; Jeyakumar V, 1988, 'A class of nonconvex functions and mathematical programming', Bulletin of the Australian Mathematical Society, vol. 38, pp. 177 - 189, http://dx.doi.org/10.1017/S0004972700027441
    Journal articles | 1988
    Professor Jeya Jeyakumar
    Jeyakumar V, 1988, 'Non-convex infinite games', Optimization, vol. 19, pp. 289 - 296, http://dx.doi.org/10.1080/02331938808843344
    Journal articles | 1987
    Professor Jeya Jeyakumar
    Craven BD; Jeyakumar V; Gwinner J, 1987, 'Nonconvex Theorems of the Alternative and Minimization', Optimization, vol. 18, pp. 151 - 163, http://dx.doi.org/10.1080/02331938708843228
    Journal articles | 1987
    Professor Jeya Jeyakumar
    JEYAKUMAR V, 1987, 'NONDIFFERENTIABLE-PROGRAMMING AND DUALITY WITH MODIFIED CONVEXITY', BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY, vol. 35, pp. 309 - 313, http://dx.doi.org/10.1017/S0004972700013265
    Journal articles | 1987
    Professor Jeya Jeyakumar
    Jeyakumar V, 1987, 'A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processes', Journal of Optimization Theory and Applications, vol. 55, pp. 449 - 461, http://dx.doi.org/10.1007/BF00941180
    Journal articles | 1987
    Professor Jeya Jeyakumar
    Jeyakumar V, 1987, 'On optimality conditions in nonsmooth inequality constrained minimization', Numerical Functional Analysis and Optimization, vol. 9, pp. 535 - 546, http://dx.doi.org/10.1080/01630568708816246
    Journal articles | 1987
    Professor Jeya Jeyakumar
    Journal articles | 1986
    Professor Jeya Jeyakumar
    Jeyakumar V, 1986, 'A generalization of a minimax theorem of Fan via a theorem of the alternative', Journal of Optimization Theory and Applications, vol. 48, pp. 525 - 533, http://dx.doi.org/10.1007/BF00940575
    Journal articles | 1986
    Professor Jeya Jeyakumar
    Jeyakumar V, 1986, 'On subgradient duality with strong and weak convex functions', Journal of the Australian Mathematical Society, vol. 40, pp. 143 - 152, http://dx.doi.org/10.1017/S1446788700027130
    Journal articles | 1986
    Professor Jeya Jeyakumar
    Craven BD; Jeyakumar V, 1986, 'Equivalence of a Ky Fan type minimax theorem and a Gordan type alternative theorem', Operations Research Letters, vol. 5, pp. 99 - 102, http://dx.doi.org/10.1016/0167-6377(86)90111-2
    Journal articles | 1986
    Professor Jeya Jeyakumar
    Journal articles | 1985
    Professor Jeya Jeyakumar
    Jeyakumar V, 1985, 'Convexlike Alternative Theorems and Mathematical Programming', Optimization, vol. 16, pp. 643 - 652, http://dx.doi.org/10.1080/02331938508843061
    Journal articles | 1984
    Professor Jeya Jeyakumar
    Jeyakumar V, 1984, 'Nonlinear alternative theorems and nondifferentiable programming', Zeitschrift für Operations Research, vol. 28, pp. 175 - 187, http://dx.doi.org/10.1007/BF01920919
  • Conference Papers | 1989
    Professor Jeya Jeyakumar
    GWINNER J; JEYAKUMAR V, 1989, 'STABLE MINIMAX ON NONCOMPACT SETS', in THERA MA; BAILLON JB (ed.), FIXED POINT THEORY AND APPLICATIONS, LONGMAN SCIENTIFIC & TECHNICAL, CTR INT RECONTRES MATH, MARSEILLE, FRANCE, pp. 215 - 220, presented at INTERNATIONAL CONF ON FIXED POINT THEORY AND APPLICATIONS, CTR INT RECONTRES MATH, MARSEILLE, FRANCE, 05 June 1989 - 09 June 1989, http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:A1991BV44G00016&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=891bb5ab6ba270e68a29b250adbe88d1

Awards

Grants

Media