default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVaithilingam Jeyakumar
V. Jeyakumar 0001
Person information
- affiliation: University of New South Wales, Sydney, NSW, Australia
- affiliation (PhD 1986): University of Melbourne, VIC, Australia
Other persons with the same name
- V. Jeyakumar 0002 — University of Houston, Department of Industrial Engineering, TX, USA
- V. Jeyakumar 0003 — Indian Institute of Technology Kanpur, Center for Robotics, India
- V. Jeyakumar 0004 — Anna University, St. Joseph's College of Engineering, Chennai, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j87]Queenie Yingkun Huang, V. Jeyakumar, Guoyin Li:
Piecewise SOS-convex moment optimization and applications via exact semi-definite programs. EURO J. Comput. Optim. 12: 100094 (2024)- [j86]Vaithilingam Jeyakumar
, Gue Myung Lee, Jae-Hyoung Lee, Yingkun Huang:
Sum-of-Squares Relaxations in Robust DC Optimization and Feature Selection. J. Optim. Theory Appl. 200(1): 308-343 (2024) - [j85]Queenie Yingkun Huang, Vaithilingam Jeyakumar:
A distributional Farkas' lemma and moment optimization problems with no-gap dual semi-definite programs. Optim. Lett. 18(5): 1095-1110 (2024) - 2022
- [j84]Miguel A. Goberna, Vaithilingam Jeyakumar, Guoyin Li, José Vicente-Pérez:
The radius of robust feasibility of uncertain mathematical programs: A Survey and recent developments. Eur. J. Oper. Res. 296(3): 749-763 (2022) - [j83]Daniel Woolnough, Niroshan Jeyakumar, Guoyin Li, Clement T. Loy, Vaithilingam Jeyakumar:
Robust Optimization and Data Classification for Characterization of Huntington Disease Onset via Duality Methods. J. Optim. Theory Appl. 193(1): 649-675 (2022) - 2021
- [j82]V. Jeyakumar, Guoyin Li, Daniel Woolnough:
Quadratically adjustable robust linear optimization with inexact data via generalized S-lemma: Exact second-order cone program reformulations. EURO J. Comput. Optim. 9: 100019 (2021) - [j81]Thai Doan Chuong, V. Jeyakumar, Guoyin Li, Daniel Woolnough:
Exact SDP reformulations of adjustable robust linear programs with box uncertainties under separable quadratic decision rules via SOS representations of non-negativity. J. Glob. Optim. 81(4): 1095-1117 (2021) - [j80]Miguel A. Goberna, Vaithilingam Jeyakumar, Guoyin Li:
Calculating Radius of Robust Feasibility of Uncertain Linear Conic Programs via Semi-definite Programs. J. Optim. Theory Appl. 189(2): 597-622 (2021) - [j79]Daniel Woolnough, Vaithilingam Jeyakumar, Guoyin Li:
Exact conic programming reformulations of two-stage adjustable robust linear programs with new quadratic decision rules. Optim. Lett. 15(1): 25-44 (2021) - 2020
- [j78]N. H. Chieu, V. Jeyakumar, Guoyin Li:
Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality. Eur. J. Oper. Res. 280(2): 441-452 (2020) - [j77]Thai Doan Chuong, Vaithilingam Jeyakumar:
Generalized Farkas Lemma with Adjustable Variables and Two-Stage Robust Linear Programs. J. Optim. Theory Appl. 187(2): 488-519 (2020)
2010 – 2019
- 2019
- [j76]Vaithilingam Jeyakumar, Hossein Mohebi:
Characterizing best approximation from a convex set without convex representation. J. Approx. Theory 239: 113-127 (2019) - [j75]Thai Doan Chuong, V. Jeyakumar, Guoyin Li:
A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs. J. Glob. Optim. 75(4): 885-919 (2019) - [j74]N. H. Chieu, Thai Doan Chuong, V. Jeyakumar, Guoyin Li:
A copositive Farkas lemma and minimally exact conic relaxations for robust quadratic optimization with binary and quadratic constraints. Oper. Res. Lett. 47(6): 530-536 (2019) - 2018
- [j73]N. H. Chieu, Vaithilingam Jeyakumar, Guoyin Li, Hossein Mohebi:
Constraint qualifications for convex optimization without convexity of constraints : New connections and applications to best approximation. Eur. J. Oper. Res. 265(1): 19-25 (2018) - [j72]Miguel A. Goberna, Vaithilingam Jeyakumar, Guoyin Li, José Vicente-Pérez:
Guaranteeing highly robust weakly efficient solutions for uncertain multi-objective convex programs. Eur. J. Oper. Res. 270(1): 40-50 (2018) - [j71]Immanuel M. Bomze, Vaithilingam Jeyakumar, Guoyin Li:
Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations. J. Glob. Optim. 71(3): 551-569 (2018) - [j70]Thai Doan Chuong, Vaithilingam Jeyakumar:
Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers. J. Glob. Optim. 72(4): 655-678 (2018) - [j69]Vaithilingam Jeyakumar, Guoyin Li:
Exact Second-Order Cone Programming Relaxations for Some Nonconvex Minimax Quadratic Optimization Problems. SIAM J. Optim. 28(1): 760-787 (2018) - 2017
- [j68]Thai Doan Chuong, Vaithilingam Jeyakumar:
Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications. Appl. Math. Comput. 315: 381-399 (2017) - [j67]Vaithilingam Jeyakumar, Guoyin Li:
Exact Conic Programming Relaxations for a Class of Convex Polynomial Cone Programs. J. Optim. Theory Appl. 172(1): 156-178 (2017) - [j66]Thai Doan Chuong, Vaithilingam Jeyakumar:
An Exact Formula for Radius of Robust Feasibility of Uncertain Linear Programs. J. Optim. Theory Appl. 173(1): 203-226 (2017) - [j65]Thai Doan Chuong, Vaithilingam Jeyakumar:
Finding Robust Global Optimal Values of Bilevel Polynomial Programs with Uncertain Linear Constraints. J. Optim. Theory Appl. 173(2): 683-703 (2017) - [j64]Thai Doan Chuong, Vaithilingam Jeyakumar:
Convergent conic linear programming relaxations for cone convex polynomial programs. Oper. Res. Lett. 45(3): 220-226 (2017) - [j63]N. H. Chieu, Vaithilingam Jeyakumar, Guoyin Li:
A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems. Oper. Res. Lett. 45(4): 325-333 (2017) - 2016
- [j62]Vaithilingam Jeyakumar, Gue Myung Lee, N. T. H. Linh:
Generalized Farkas' lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization. J. Glob. Optim. 64(4): 679-702 (2016) - [j61]Vaithilingam Jeyakumar, S. Kim, Gue Myung Lee, Guoyin Li:
Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets. J. Glob. Optim. 65(2): 175-190 (2016) - [j60]Miguel A. Goberna, Vaithilingam Jeyakumar, Guoyin Li, Linh Nguyen:
Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints. Oper. Res. Lett. 44(1): 67-73 (2016) - [j59]Vaithilingam Jeyakumar, Jean B. Lasserre, Guoyin Li, T. S. Pham:
Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems. SIAM J. Optim. 26(1): 753-780 (2016) - 2015
- [j58]Miguel A. Goberna, Vaithilingam Jeyakumar, Guoyin Li, José Vicente-Pérez:
Robust solutions to multi-objective linear programs with uncertain data. Eur. J. Oper. Res. 242(3): 730-743 (2015) - [j57]Vaithilingam Jeyakumar, Gue Myung Lee, Guoyin Li:
Characterizing Robust Solution Sets of Convex Programs under Data Uncertainty. J. Optim. Theory Appl. 164(2): 407-435 (2015) - [j56]Vaithilingam Jeyakumar, Guoyin Li, José Vicente-Pérez:
Robust SOS-convex polynomial optimization problems: exact SDP relaxations. Optim. Lett. 9(1): 1-18 (2015) - [j55]Vaithilingam Jeyakumar, Guoyin Li:
A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs. Oper. Res. Lett. 43(4): 405-410 (2015) - 2014
- [j54]Vaithilingam Jeyakumar, Guoyin Li, S. Srisatkunarajah:
Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations. J. Glob. Optim. 58(1): 31-50 (2014) - [j53]Vaithilingam Jeyakumar, José Vicente-Pérez:
Dual Semidefinite Programs Without Duality Gaps for a Class of Convex Minimax Programs. J. Optim. Theory Appl. 162(3): 735-753 (2014) - [j52]Vaithilingam Jeyakumar, Jean B. Lasserre, Guoyin Li:
On Polynomial Optimization Over Non-compact Semi-algebraic Sets. J. Optim. Theory Appl. 163(3): 707-718 (2014) - [j51]Vaithilingam Jeyakumar, Guoyin Li:
Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization. Math. Program. 147(1-2): 171-206 (2014) - [j50]Vaithilingam Jeyakumar, T. S. Pham, Guoyin Li:
Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness. Oper. Res. Lett. 42(1): 34-40 (2014) - [j49]Miguel A. Goberna, Vaithilingam Jeyakumar, Guoyin Li, José Vicente-Pérez:
Robust Solutions of MultiObjective Linear Semi-Infinite Programs under Constraint Data Uncertainty. SIAM J. Optim. 24(3): 1402-1419 (2014) - 2013
- [j48]Vaithilingam Jeyakumar, Guoyin Li, S. Srisatkunarajah:
Strong duality for robust minimax fractional programming problems. Eur. J. Oper. Res. 228(2): 331-336 (2013) - [j47]Vaithilingam Jeyakumar, Guoyin Li:
Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty. J. Glob. Optim. 55(2): 209-226 (2013) - [j46]Miguel A. Goberna, Vaithilingam Jeyakumar, Guoyin Li, Marco A. López:
Robust linear semi-infinite programming duality under uncertainty. Math. Program. 139(1-2): 185-203 (2013) - 2012
- [j45]Vaithilingam Jeyakumar, Guoyin Li:
Exact SDP relaxations for classes of nonlinear semidefinite programming problems. Oper. Res. Lett. 40(6): 529-536 (2012) - 2011
- [j44]Vaithilingam Jeyakumar, Guoyin Li:
Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems. J. Glob. Optim. 49(1): 1-14 (2011) - [j43]Vaithilingam Jeyakumar, Guoyin Li:
Robust Duality for Fractional Programming Problems with Constraint-Wise Data Uncertainty. J. Optim. Theory Appl. 151(2): 292-303 (2011) - [j42]Vaithilingam Jeyakumar, Guoyin Li:
Necessary global optimality conditions for nonlinear programming problems with polynomial constraints. Math. Program. 126(2): 393-399 (2011) - [j41]Vaithilingam Jeyakumar, Guoyin Li, Gue Myung Lee:
A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty. Oper. Res. Lett. 39(2): 109-114 (2011) - 2010
- [j40]Michelle Dunbar, John M. Murray, Lucette A. Cysique, Bruce J. Brew, Vaithilingam Jeyakumar:
Simultaneous classification and feature selection via convex quadratic programming with application to HIV-associated neurocognitive disorder assessment. Eur. J. Oper. Res. 206(2): 470-478 (2010) - [j39]Vaithilingam Jeyakumar, Guoyin Li:
New strong duality results for convex programs with separable constraints. Eur. J. Oper. Res. 207(3): 1203-1209 (2010) - [j38]Vaithilingam Jeyakumar, Guoyin Li:
Characterizing robust set containments and solutions of uncertain linear programs without qualifications. Oper. Res. Lett. 38(3): 188-194 (2010) - [j37]Vaithilingam Jeyakumar, Guoyin Li:
Strong Duality in Robust Convex Programming: Complete Characterizations. SIAM J. Optim. 20(6): 3384-3407 (2010)
2000 – 2009
- 2009
- [j36]Vaithilingam Jeyakumar, S. Srisatkunarajah:
A note on sufficient global optimality conditions for fixed charge quadratic programs. Appl. Math. Lett. 22(7): 1016-1020 (2009) - [j35]Vaithilingam Jeyakumar, S. Srisatkunarajah:
Geometric conditions for Kuhn-Tucker sufficiency of global optimality in mathematical programming. Eur. J. Oper. Res. 194(2): 363-367 (2009) - [j34]Vaithilingam Jeyakumar, S. Srisatkunarajah:
Lagrange multiplier necessary conditions for global optimality for non-convex minimization over a quadratic constraint via S-lemma. Optim. Lett. 3(1): 23-33 (2009) - [j33]Vaithilingam Jeyakumar, Guoyin Li:
Farkas' lemma for separable sublinear inequalities without qualifications. Optim. Lett. 3(4): 537-545 (2009) - [j32]Vaithilingam Jeyakumar, Gue Myung Lee, Guoyin Li:
Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization. SIAM J. Optim. 20(2): 983-1001 (2009) - [r2]V. Jeyakumar:
Composite Nonsmooth Optimization. Encyclopedia of Optimization 2009: 454-457 - [r1]V. Jeyakumar:
Farkas Lemma: Generalizations. Encyclopedia of Optimization 2009: 998-1001 - 2008
- [j31]Vaithilingam Jeyakumar, Gue Myung Lee:
Complete characterizations of stable Farkas' lemma and cone-convex programming duality. Math. Program. 114(2): 335-347 (2008) - [j30]V. Jeyakumar:
A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions. Optim. Lett. 2(1): 15-25 (2008) - [j29]Vaithilingam Jeyakumar, N. Q. Huy:
Global minimization of difference of quadratic and convex functions over box or binary constraints. Optim. Lett. 2(2): 223-238 (2008) - [j28]Vaithilingam Jeyakumar, Sivakolundu Srisatkunarajah, Nguyen Quang Huy:
Unified global optimality conditions for smooth minimization problems with mixed variables. RAIRO Oper. Res. 42(3): 361-370 (2008) - 2007
- [j27]Vaithilingam Jeyakumar, Zhi-You Wu:
Conditions for Global Optimality of Quadratic Minimization Problems with LMI Constraints. Asia Pac. J. Oper. Res. 24(2): 149-160 (2007) - [j26]Vaithilingam Jeyakumar, Alex M. Rubinov, Zhi-You Wu:
Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions. Math. Program. 110(3): 521-541 (2007) - 2006
- [j25]Vaithilingam Jeyakumar, Gue Myung Lee, N. Dinh:
Characterizations of solution sets of convex vector minimization problems. Eur. J. Oper. Res. 174(3): 1380-1395 (2006) - [j24]Miguel A. Goberna, Vaithilingam Jeyakumar, Nguyen Dinh:
Dual Characterizations of Set Containments with Strict Convex Inequalities. J. Glob. Optim. 34(1): 33-54 (2006) - [j23]Vaithilingam Jeyakumar, Zhi-You Wu, Gue Myung Lee, N. Dinh:
Liberating the Subgradient Optimality Conditions from Constraint Qualifications. J. Glob. Optim. 36(1): 127-137 (2006) - [j22]Vaithilingam Jeyakumar, Alex M. Rubinov, Zhi-You Wu:
Sufficient Global Optimality Conditions for Non-convex Quadratic Minimization Problems With Box Constraints. J. Glob. Optim. 36(3): 471-481 (2006) - [j21]V. Jeyakumar:
The strong conical hull intersection property for convex programming. Math. Program. 106(1): 81-92 (2006) - [j20]Vaithilingam Jeyakumar, John T. Ormerod, Robert S. Womersley:
Knowledge-based semidefinite linear programming classifiers. Optim. Methods Softw. 21(5): 693-706 (2006) - 2005
- [j19]Vaithilingam Jeyakumar, Hossein Mohebi:
Limiting epsilon-subgradient characterizations of constrained best approximation. J. Approx. Theory 135(2): 145-159 (2005) - [j18]Regina Sandra Burachik, Vaithilingam Jeyakumar:
A new geometric condition for Fenchel's duality in infinite dimensional spaces. Math. Program. 104(2-3): 229-233 (2005) - 2004
- [j17]Vaithilingam Jeyakumar, Nguyen Dong Yen:
Solution Stability of Nonsmooth Continuous Systems with Applications to Cone-Constrained Optimization. SIAM J. Optim. 14(4): 1106-1127 (2004) - 2003
- [j16]V. Jeyakumar:
Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints. SIAM J. Optim. 13(4): 947-959 (2003) - [j15]Vaithilingam Jeyakumar, Gue Myung Lee, N. Dinh:
New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs. SIAM J. Optim. 14(2): 534-547 (2003) - 2002
- [j14]Vaithilingam Jeyakumar, Dinh The Luc, Phan Nhat Tinh:
Convex composite non-Lipschitz programming. Math. Program. 92(1): 177-195 (2002) - [j13]Vaithilingam Jeyakumar, Dinh The Luc:
Sharp Variational Conditions for Convex Composite Nonsmooth Functions. SIAM J. Optim. 13(3): 904-920 (2002) - 2000
- [j12]X. Wang, Vaithilingam Jeyakumar:
A Sharp Lagrange Multiplier Rule for Nonsmooth Mathematical Programming Problems Involving Equality Constraints. SIAM J. Optim. 10(4): 1136-1148 (2000)
1990 – 1999
- 1999
- [j11]Bevil Milton Glover, Vaithilingam Jeyakumar, Alexander M. Rubinov:
Dual conditions characterizing optimality for convex multi-objective programs. Math. Program. 84(1): 201-217 (1999) - 1997
- [j10]Vladimir F. Demyanov, Vaithilingam Jeyakumar:
Hunting for a Smaller Convex Subdifferential. J. Glob. Optim. 10(3): 305-326 (1997) - 1996
- [j9]Vaithilingam Jeyakumar, Bevil Milton Glover:
Characterizing global optimality for DC optimization problems under convex inequality constraints. J. Glob. Optim. 8(2): 171-187 (1996) - [j8]Bevil Milton Glover, Y. Ishizuka, Vaithilingam Jeyakumar, H. D. Tuan:
Complete Characterizations of Global Optimality for Problems Involving the Pointwise Minimum of Sublinear Functions. SIAM J. Optim. 6(2): 362-372 (1996) - 1995
- [j7]Vaithilingam Jeyakumar, Bevil Milton Glover:
Nonlinear Extensions of Farkas' Lemma with Applications to Global Optimization and Least Squares. Math. Oper. Res. 20(4): 818-837 (1995) - 1994
- [j6]Bevil Milton Glover, Vaithilingam Jeyakumar, Werner Oettli:
A Farkas lemma for difference sublinear systems and quasidifferentiable programming. Math. Program. 63: 109-125 (1994) - 1993
- [j5]Joachim Gwinner, Vaithilingam Jeyakumar:
A solvability theorem and minimax fractional programming. ZOR Methods Model. Oper. Res. 37(1): 1-12 (1993) - [j4]Vaithilingam Jeyakumar, Xiaoqi Yang:
Convex composite multi-objective nonsmooth programming. Math. Program. 59: 325-343 (1993) - 1992
- [j3]Vaithilingam Jeyakumar, Henry Wolkowicz:
Generalizations of Slater's constraint qualification for infinite convex programs. Math. Program. 57: 85-101 (1992) - 1991
- [j2]Vaithilingam Jeyakumar:
Composite Nonsmooth Programming with Gâteaux Differentiability. SIAM J. Optim. 1(1): 30-41 (1991)
1980 – 1989
- 1984
- [j1]Vaithilingam Jeyakumar:
Nonlinear alternative theorems and nondifferentiable programming. Z. Oper. Research 28(5): 175-187 (1984)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
