Vaithilingam Jeyakumar

Publication Activity (10 Years)

Years Active: 1984-2024
Publications (10 Years): 23

Top Topics

Optimization Problems

Top Venues

J. Optim. Theory Appl.

Oper. Res. Lett.

J. Glob. Optim.

Eur. J. Oper. Res.

Publications

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) (2024)
Queenie Yingkun Huang, Vaithilingam Jeyakumar
A distributional Farkas' lemma and moment optimization problems with no-gap dual semi-definite programs. Optim. Lett. 18 (5) (2024)
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) (2022)
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) (2022)
D. 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) (2021)
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) (2021)
Thai Doan Chuong, Vaithilingam Jeyakumar
Generalized Farkas Lemma with Adjustable Variables and Two-Stage Robust Linear Programs. J. Optim. Theory Appl. 187 (2) (2020)
Vaithilingam Jeyakumar, Hossein Mohebi
Characterizing best approximation from a convex set without convex representation. J. Approx. Theory 239 (2019)
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) (2018)
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) (2018)
Thai Doan Chuong, Vaithilingam Jeyakumar
Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers. J. Glob. Optim. 72 (4) (2018)
Vaithilingam Jeyakumar, Guoyin Li
Exact Second-Order Cone Programming Relaxations for Some Nonconvex Minimax Quadratic Optimization Problems. SIAM J. Optim. 28 (1) (2018)
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) (2018)
Thai Doan Chuong, Vaithilingam Jeyakumar
Finding Robust Global Optimal Values of Bilevel Polynomial Programs with Uncertain Linear Constraints. J. Optim. Theory Appl. 173 (2) (2017)
Vaithilingam Jeyakumar, Guoyin Li
Exact Conic Programming Relaxations for a Class of Convex Polynomial Cone Programs. J. Optim. Theory Appl. 172 (1) (2017)
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 (2017)
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) (2017)
Thai Doan Chuong, Vaithilingam Jeyakumar
An Exact Formula for Radius of Robust Feasibility of Uncertain Linear Programs. J. Optim. Theory Appl. 173 (1) (2017)
Thai Doan Chuong, Vaithilingam Jeyakumar
Convergent conic linear programming relaxations for cone convex polynomial programs. Oper. Res. Lett. 45 (3) (2017)
Vaithilingam Jeyakumar, G. M. 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) (2016)
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) (2016)
Vaithilingam Jeyakumar, S. Kim, G. M. Lee, Guoyin Li
Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets. J. Glob. Optim. 65 (2) (2016)
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) (2016)
Vaithilingam Jeyakumar, Guoyin Li
A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs. Oper. Res. Lett. 43 (4) (2015)
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) (2015)
Vaithilingam Jeyakumar, Guoyin Li, José Vicente-Pérez
Robust SOS-convex polynomial optimization problems: exact SDP relaxations. Optim. Lett. 9 (1) (2015)
Vaithilingam Jeyakumar, G. M. Lee, Guoyin Li
Characterizing Robust Solution Sets of Convex Programs under Data Uncertainty. J. Optim. Theory Appl. 164 (2) (2015)
Vaithilingam Jeyakumar, Guoyin Li
Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization. Math. Program. 147 (1-2) (2014)
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) (2014)
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) (2014)
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) (2014)
Vaithilingam Jeyakumar, Jean B. Lasserre, Guoyin Li
On Polynomial Optimization Over Non-compact Semi-algebraic Sets. J. Optim. Theory Appl. 163 (3) (2014)
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) (2014)
Vaithilingam Jeyakumar, Guoyin Li
Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty. J. Glob. Optim. 55 (2) (2013)
Miguel A. Goberna, Vaithilingam Jeyakumar, Guoyin Li, Marco A. López
Robust linear semi-infinite programming duality under uncertainty. Math. Program. 139 (1-2) (2013)
Vaithilingam Jeyakumar, Guoyin Li, S. Srisatkunarajah
Strong duality for robust minimax fractional programming problems. Eur. J. Oper. Res. 228 (2) (2013)
Vaithilingam Jeyakumar, Guoyin Li
Exact SDP relaxations for classes of nonlinear semidefinite programming problems. Oper. Res. Lett. 40 (6) (2012)
Vaithilingam Jeyakumar, Guoyin Li, G. M. Lee
A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty. Oper. Res. Lett. 39 (2) (2011)
Vaithilingam Jeyakumar, Guoyin Li
Robust Duality for Fractional Programming Problems with Constraint-Wise Data Uncertainty. J. Optim. Theory Appl. 151 (2) (2011)
Vaithilingam Jeyakumar, Guoyin Li
Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems. J. Glob. Optim. 49 (1) (2011)
Vaithilingam Jeyakumar, Guoyin Li
Necessary global optimality conditions for nonlinear programming problems with polynomial constraints. Math. Program. 126 (2) (2011)
Vaithilingam Jeyakumar, Guoyin Li
New strong duality results for convex programs with separable constraints. Eur. J. Oper. Res. 207 (3) (2010)
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) (2010)
Vaithilingam Jeyakumar, Guoyin Li
Strong Duality in Robust Convex Programming: Complete Characterizations. SIAM J. Optim. 20 (6) (2010)
Vaithilingam Jeyakumar, Guoyin Li
Characterizing robust set containments and solutions of uncertain linear programs without qualifications. Oper. Res. Lett. 38 (3) (2010)
Vaithilingam Jeyakumar, G. M. Lee, Guoyin Li
Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization. SIAM J. Optim. 20 (2) (2009)
Vaithilingam Jeyakumar, Guoyin Li
Farkas' lemma for separable sublinear inequalities without qualifications. Optim. Lett. 3 (4) (2009)
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) (2009)
Vaithilingam Jeyakumar, S. Srisatkunarajah
A note on sufficient global optimality conditions for fixed charge quadratic programs. Appl. Math. Lett. 22 (7) (2009)
Vaithilingam Jeyakumar, S. Srisatkunarajah
Geometric conditions for Kuhn-Tucker sufficiency of global optimality in mathematical programming. Eur. J. Oper. Res. 194 (2) (2009)
Vaithilingam Jeyakumar, G. M. Lee
Complete characterizations of stable Farkas' lemma and cone-convex programming duality. Math. Program. 114 (2) (2008)
Vaithilingam Jeyakumar, N. Q. Huy
Global minimization of difference of quadratic and convex functions over box or binary constraints. Optim. Lett. 2 (2) (2008)
Vaithilingam Jeyakumar, Sivakolundu Srisatkunarajah, Nguyen Quang Huy
Unified global optimality conditions for smooth minimization problems with mixed variables. RAIRO Oper. Res. 42 (3) (2008)
Vaithilingam Jeyakumar, Zhi-You Wu
Conditions for Global Optimality of Quadratic Minimization Problems with LMI Constraints. Asia Pac. J. Oper. Res. 24 (2) (2007)
Vaithilingam Jeyakumar, Alex M. Rubinov, Zhi-You Wu
Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions. Math. Program. 110 (3) (2007)
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) (2006)
Vaithilingam Jeyakumar, John T. Ormerod, Robert S. Womersley
Knowledge-based semidefinite linear programming classifiers. Optim. Methods Softw. 21 (5) (2006)
Miguel A. Goberna, Vaithilingam Jeyakumar, Nguyen Dinh
Dual Characterizations of Set Containments with Strict Convex Inequalities. J. Glob. Optim. 34 (1) (2006)
Vaithilingam Jeyakumar, G. M. Lee, N. Dinh
Characterizations of solution sets of convex vector minimization problems. Eur. J. Oper. Res. 174 (3) (2006)
Vaithilingam Jeyakumar, Zhi-You Wu, G. M. Lee, N. Dinh
Liberating the Subgradient Optimality Conditions from Constraint Qualifications. J. Glob. Optim. 36 (1) (2006)
Regina Sandra Burachik, Vaithilingam Jeyakumar
A new geometric condition for Fenchel's duality in infinite dimensional spaces. Math. Program. 104 (2-3) (2005)
Vaithilingam Jeyakumar, Hossein Mohebi
-subgradient characterizations of constrained best approximation. J. Approx. Theory 135 (2) (2005)
Vaithilingam Jeyakumar, Nguyen Dong Yen
Solution Stability of Nonsmooth Continuous Systems with Applications to Cone-Constrained Optimization. SIAM J. Optim. 14 (4) (2004)
Vaithilingam Jeyakumar, G. M. Lee, N. Dinh
New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs. SIAM J. Optim. 14 (2) (2003)
Vaithilingam Jeyakumar, Dinh The Luc
Sharp Variational Conditions for Convex Composite Nonsmooth Functions. SIAM J. Optim. 13 (3) (2002)
Vaithilingam Jeyakumar, Dinh The Luc, Phan Nhat Tinh
Convex composite non-Lipschitz programming. Math. Program. 92 (1) (2002)
X. Wang, Vaithilingam Jeyakumar
A Sharp Lagrange Multiplier Rule for Nonsmooth Mathematical Programming Problems Involving Equality Constraints. SIAM J. Optim. 10 (4) (2000)
Bevil Milton Glover, Vaithilingam Jeyakumar, Alexander M. Rubinov
Dual conditions characterizing optimality for convex multi-objective programs. Math. Program. 84 (1) (1999)
Vladimir F. Demyanov, Vaithilingam Jeyakumar
Hunting for a Smaller Convex Subdifferential. J. Glob. Optim. 10 (3) (1997)
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) (1996)
Vaithilingam Jeyakumar, Bevil Milton Glover
Characterizing global optimality for DC optimization problems under convex inequality constraints. J. Glob. Optim. 8 (2) (1996)
Vaithilingam Jeyakumar, Bevil Milton Glover
Nonlinear Extensions of Farkas' Lemma with Applications to Global Optimization and Least Squares. Math. Oper. Res. 20 (4) (1995)
Bevil Milton Glover, Vaithilingam Jeyakumar, Werner Oettli
A Farkas lemma for difference sublinear systems and quasidifferentiable programming. Math. Program. 63 (1994)
Vaithilingam Jeyakumar, Xiaoqi Yang
Convex composite multi-objective nonsmooth programming. Math. Program. 59 (1993)
Joachim Gwinner, Vaithilingam Jeyakumar
A solvability theorem and minimax fractional programming. ZOR Methods Model. Oper. Res. 37 (1) (1993)
Vaithilingam Jeyakumar, Henry Wolkowicz
Generalizations of Slater's constraint qualification for infinite convex programs. Math. Program. 57 (1992)
Vaithilingam Jeyakumar
Composite Nonsmooth Programming with Gâteaux Differentiability. SIAM J. Optim. 1 (1) (1991)
Vaithilingam Jeyakumar
Nonlinear alternative theorems and nondifferentiable programming. Z. Oper. Research 28 (5) (1984)