Nonlinear alternative theorems and nondifferentiable programming. - Vaithilingam Jeyakumar (Z. Oper. Research, 1984)

Composite Nonsmooth Programming with Gâteaux Differentiability. - Vaithilingam Jeyakumar (SIAM J. Optim., 1991)

Generalizations of Slater's constraint qualification for infinite convex programs. - Vaithilingam Jeyakumar; Henry Wolkowicz (Math. Program., 1992)

A solvability theorem and minimax fractional programming. - Joachim Gwinner; Vaithilingam Jeyakumar (ZOR Methods Model. Oper. Res., 1993)

Convex composite multi-objective nonsmooth programming. - Vaithilingam Jeyakumar; Xiaoqi Yang 001 (Math. Program., 1993)

A Farkas lemma for difference sublinear systems and quasidifferentiable programming. - Bevil Milton Glover; Vaithilingam Jeyakumar; Werner Oettli (Math. Program., 1994)

Nonlinear Extensions of Farkas' Lemma with Applications to Global Optimization and Least Squares. - Vaithilingam Jeyakumar; Bevil Milton Glover (Math. Oper. Res., 1995)

Characterizing global optimality for DC optimization problems under convex inequality constraints. - Vaithilingam Jeyakumar; Bevil Milton Glover (J. Glob. Optim., 1996)

Complete Characterizations of Global Optimality for Problems Involving the Pointwise Minimum of Sublinear Functions. - Bevil Milton Glover; Y. Ishizuka; Vaithilingam Jeyakumar; H. D. Tuan (SIAM J. Optim., 1996)

Hunting for a Smaller Convex Subdifferential. - Vladimir F. Demyanov; Vaithilingam Jeyakumar (J. Glob. Optim., 1997)

Dual conditions characterizing optimality for convex multi-objective programs. - Bevil Milton Glover; Vaithilingam Jeyakumar; Alexander M. Rubinov (Math. Program., 1999)

A Sharp Lagrange Multiplier Rule for Nonsmooth Mathematical Programming Problems Involving Equality Constraints. - X. Wang; Vaithilingam Jeyakumar (SIAM J. Optim., 2000)

Convex composite non-Lipschitz programming. - Vaithilingam Jeyakumar; Dinh The Luc; Phan Nhat Tinh (Math. Program., 2002)

Sharp Variational Conditions for Convex Composite Nonsmooth Functions. - Vaithilingam Jeyakumar; Dinh The Luc (SIAM J. Optim., 2002)

Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints. - V. Jeyakumar 001 (SIAM J. Optim., 2003)

New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs. - Vaithilingam Jeyakumar; Gue Myung Lee; N. Dinh (SIAM J. Optim., 2003)

Solution Stability of Nonsmooth Continuous Systems with Applications to Cone-Constrained Optimization. - Vaithilingam Jeyakumar; Nguyen Dong Yen (SIAM J. Optim., 2004)

Limiting epsilon-subgradient characterizations of constrained best approximation. - Vaithilingam Jeyakumar; Hossein Mohebi (J. Approx. Theory, 2005)

A new geometric condition for Fenchel's duality in infinite dimensional spaces. - Regina Sandra Burachik; Vaithilingam Jeyakumar (Math. Program., 2005)

Characterizations of solution sets of convex vector minimization problems. - Vaithilingam Jeyakumar; Gue Myung Lee; N. Dinh (Eur. J. Oper. Res., 2006)

Dual Characterizations of Set Containments with Strict Convex Inequalities. - Miguel A. Goberna; Vaithilingam Jeyakumar; Nguyen Dinh (J. Glob. Optim., 2006)

Sufficient Global Optimality Conditions for Non-convex Quadratic Minimization Problems With Box Constraints. - Vaithilingam Jeyakumar; Alex M. Rubinov; Zhi-You Wu (J. Glob. Optim., 2006)

Liberating the Subgradient Optimality Conditions from Constraint Qualifications. - Vaithilingam Jeyakumar; Zhi-You Wu; Gue Myung Lee; N. Dinh (J. Glob. Optim., 2006)

The strong conical hull intersection property for convex programming. - V. Jeyakumar 001 (Math. Program., 2006)

Knowledge-based semidefinite linear programming classifiers. - Vaithilingam Jeyakumar; John T. Ormerod; Robert S. Womersley (Optim. Methods Softw., 2006)

Conditions for Global Optimality of Quadratic Minimization Problems with LMI Constraints. - Vaithilingam Jeyakumar; Zhi-You Wu (Asia Pac. J. Oper. Res., 2007)

Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions. - Vaithilingam Jeyakumar; Alex M. Rubinov; Zhi-You Wu (Math. Program., 2007)

Complete characterizations of stable Farkas' lemma and cone-convex programming duality. - Vaithilingam Jeyakumar; Gue Myung Lee (Math. Program., 2008)

A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions. - V. Jeyakumar 001 (Optim. Lett., 2008)

Global minimization of difference of quadratic and convex functions over box or binary constraints. - Vaithilingam Jeyakumar; N. Q. Huy (Optim. Lett., 2008)

Unified global optimality conditions for smooth minimization problems with mixed variables. - Vaithilingam Jeyakumar; Sivakolundu Srisatkunarajah; Nguyen Quang Huy (RAIRO Oper. Res., 2008)

A note on sufficient global optimality conditions for fixed charge quadratic programs. - Vaithilingam Jeyakumar; S. Srisatkunarajah (Appl. Math. Lett., 2009)

Geometric conditions for Kuhn-Tucker sufficiency of global optimality in mathematical programming. - Vaithilingam Jeyakumar; S. Srisatkunarajah (Eur. J. Oper. Res., 2009)

Farkas' lemma for separable sublinear inequalities without qualifications. - Vaithilingam Jeyakumar; Guoyin Li 001 (Optim. Lett., 2009)

Lagrange multiplier necessary conditions for global optimality for non-convex minimization over a quadratic constraint via S-lemma. - Vaithilingam Jeyakumar; S. Srisatkunarajah (Optim. Lett., 2009)

Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization. - Vaithilingam Jeyakumar; Gue Myung Lee; Guoyin Li 001 (SIAM J. Optim., 2009)

Composite Nonsmooth Optimization. - V. Jeyakumar 001 (Encyclopedia of Optimization, 2009)

Farkas Lemma: Generalizations. - V. Jeyakumar 001 (Encyclopedia of Optimization, 2009)

Simultaneous classification and feature selection via convex quadratic programming with application to HIV-associated neurocognitive disorder assessment. - Michelle Dunbar; John M. Murray; Lucette A. Cysique; Bruce J. Brew; Vaithilingam Jeyakumar (Eur. J. Oper. Res., 2010)

New strong duality results for convex programs with separable constraints. - Vaithilingam Jeyakumar; Guoyin Li 001 (Eur. J. Oper. Res., 2010)

Characterizing robust set containments and solutions of uncertain linear programs without qualifications. - Vaithilingam Jeyakumar; Guoyin Li 001 (Oper. Res. Lett., 2010)

Strong Duality in Robust Convex Programming: Complete Characterizations. - Vaithilingam Jeyakumar; Guoyin Li 001 (SIAM J. Optim., 2010)

Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems. - Vaithilingam Jeyakumar; Guoyin Li 001 (J. Glob. Optim., 2011)

Robust Duality for Fractional Programming Problems with Constraint-Wise Data Uncertainty. - Vaithilingam Jeyakumar; Guoyin Li 001 (J. Optim. Theory Appl., 2011)

Necessary global optimality conditions for nonlinear programming problems with polynomial constraints. - Vaithilingam Jeyakumar; Guoyin Li 001 (Math. Program., 2011)

A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty. - Vaithilingam Jeyakumar; Guoyin Li 001; Gue Myung Lee (Oper. Res. Lett., 2011)

Exact SDP relaxations for classes of nonlinear semidefinite programming problems. - Vaithilingam Jeyakumar; Guoyin Li 001 (Oper. Res. Lett., 2012)

Strong duality for robust minimax fractional programming problems. - Vaithilingam Jeyakumar; Guoyin Li 001; S. Srisatkunarajah (Eur. J. Oper. Res., 2013)

Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty. - Vaithilingam Jeyakumar; Guoyin Li 001 (J. Glob. Optim., 2013)

Robust linear semi-infinite programming duality under uncertainty. - Miguel A. Goberna; Vaithilingam Jeyakumar; Guoyin Li 001; Marco A. López 001 (Math. Program., 2013)

Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations. - Vaithilingam Jeyakumar; Guoyin Li 001; S. Srisatkunarajah (J. Glob. Optim., 2014)

On Polynomial Optimization Over Non-compact Semi-algebraic Sets. - Vaithilingam Jeyakumar; Jean B. Lasserre; Guoyin Li 001 (J. Optim. Theory Appl., 2014)

Dual Semidefinite Programs Without Duality Gaps for a Class of Convex Minimax Programs. - Vaithilingam Jeyakumar; José Vicente-Pérez (J. Optim. Theory Appl., 2014)

Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization. - Vaithilingam Jeyakumar; Guoyin Li 001 (Math. Program., 2014)

Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness. - Vaithilingam Jeyakumar; T. S. Pham; Guoyin Li 001 (Oper. Res. Lett., 2014)

Robust Solutions of MultiObjective Linear Semi-Infinite Programs under Constraint Data Uncertainty. - Miguel A. Goberna; Vaithilingam Jeyakumar; Guoyin Li 001; José Vicente-Pérez (SIAM J. Optim., 2014)

Robust solutions to multi-objective linear programs with uncertain data. - Miguel A. Goberna; Vaithilingam Jeyakumar; Guoyin Li 001; José Vicente-Pérez (Eur. J. Oper. Res., 2015)

Characterizing Robust Solution Sets of Convex Programs under Data Uncertainty. - Vaithilingam Jeyakumar; Gue Myung Lee; Guoyin Li 001 (J. Optim. Theory Appl., 2015)

Robust SOS-convex polynomial optimization problems: exact SDP relaxations. - Vaithilingam Jeyakumar; Guoyin Li 001; José Vicente-Pérez (Optim. Lett., 2015)

A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs. - Vaithilingam Jeyakumar; Guoyin Li 001 (Oper. Res. Lett., 2015)

Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets. - Vaithilingam Jeyakumar; S. Kim; Gue Myung Lee; Guoyin Li 001 (J. Glob. Optim., 2016)

Generalized Farkas' lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization. - Vaithilingam Jeyakumar; Gue Myung Lee; N. T. H. Linh (J. Glob. Optim., 2016)

Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints. - Miguel A. Goberna; Vaithilingam Jeyakumar; Guoyin Li 001; Linh Nguyen (Oper. Res. Lett., 2016)

Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems. - Vaithilingam Jeyakumar; Jean B. Lasserre; Guoyin Li 001; T. S. Pham (SIAM J. Optim., 2016)

Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications. - Thai Doan Chuong; Vaithilingam Jeyakumar (Appl. Math. Comput., 2017)

An Exact Formula for Radius of Robust Feasibility of Uncertain Linear Programs. - Thai Doan Chuong; Vaithilingam Jeyakumar (J. Optim. Theory Appl., 2017)

Finding Robust Global Optimal Values of Bilevel Polynomial Programs with Uncertain Linear Constraints. - Thai Doan Chuong; Vaithilingam Jeyakumar (J. Optim. Theory Appl., 2017)

Exact Conic Programming Relaxations for a Class of Convex Polynomial Cone Programs. - Vaithilingam Jeyakumar; Guoyin Li 001 (J. Optim. Theory Appl., 2017)

A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems. - N. H. Chieu; Vaithilingam Jeyakumar; Guoyin Li 001 (Oper. Res. Lett., 2017)

Convergent conic linear programming relaxations for cone convex polynomial programs. - Thai Doan Chuong; Vaithilingam Jeyakumar (Oper. Res. Lett., 2017)

Constraint qualifications for convex optimization without convexity of constraints : New connections and applications to best approximation. - N. H. Chieu; Vaithilingam Jeyakumar; Guoyin Li 001; Hossein Mohebi (Eur. J. Oper. Res., 2018)

Guaranteeing highly robust weakly efficient solutions for uncertain multi-objective convex programs. - Miguel A. Goberna; Vaithilingam Jeyakumar; Guoyin Li 001; José Vicente-Pérez (Eur. J. Oper. Res., 2018)

Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations. - Immanuel M. Bomze; Vaithilingam Jeyakumar; Guoyin Li 001 (J. Glob. Optim., 2018)

Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers. - Thai Doan Chuong; Vaithilingam Jeyakumar (J. Glob. Optim., 2018)

Exact Second-Order Cone Programming Relaxations for Some Nonconvex Minimax Quadratic Optimization Problems. - Vaithilingam Jeyakumar; Guoyin Li 001 (SIAM J. Optim., 2018)

Characterizing best approximation from a convex set without convex representation. - Vaithilingam Jeyakumar; Hossein Mohebi (J. Approx. Theory, 2019)

A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs. - Thai Doan Chuong; V. Jeyakumar 001; Guoyin Li 001 (J. Glob. Optim., 2019)

A copositive Farkas lemma and minimally exact conic relaxations for robust quadratic optimization with binary and quadratic constraints. - N. H. Chieu; Thai Doan Chuong; V. Jeyakumar 001; Guoyin Li 001 (Oper. Res. Lett., 2019)

Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality. - N. H. Chieu; V. Jeyakumar 001; Guoyin Li 001 (Eur. J. Oper. Res., 2020)

Generalized Farkas Lemma with Adjustable Variables and Two-Stage Robust Linear Programs. - Thai Doan Chuong; Vaithilingam Jeyakumar (J. Optim. Theory Appl., 2020)

Quadratically adjustable robust linear optimization with inexact data via generalized S-lemma: Exact second-order cone program reformulations. - V. Jeyakumar 001; Guoyin Li 001; Daniel Woolnough (EURO J. Comput. Optim., 2021)

Exact SDP reformulations of adjustable robust linear programs with box uncertainties under separable quadratic decision rules via SOS representations of non-negativity. - Thai Doan Chuong; V. Jeyakumar 001; Guoyin Li 001; Daniel Woolnough (J. Glob. Optim., 2021)

Calculating Radius of Robust Feasibility of Uncertain Linear Conic Programs via Semi-definite Programs. - Miguel A. Goberna; Vaithilingam Jeyakumar; Guoyin Li 001 (J. Optim. Theory Appl., 2021)

Exact conic programming reformulations of two-stage adjustable robust linear programs with new quadratic decision rules. - Daniel Woolnough; Vaithilingam Jeyakumar; Guoyin Li 001 (Optim. Lett., 2021)

The radius of robust feasibility of uncertain mathematical programs: A Survey and recent developments. - Miguel A. Goberna; Vaithilingam Jeyakumar; Guoyin Li 001; José Vicente-Pérez (Eur. J. Oper. Res., 2022)

Robust Optimization and Data Classification for Characterization of Huntington Disease Onset via Duality Methods. - Daniel Woolnough; Niroshan Jeyakumar; Guoyin Li 001; Clement T. Loy; Vaithilingam Jeyakumar (J. Optim. Theory Appl., 2022)

Piecewise SOS-convex moment optimization and applications via exact semi-definite programs. - Queenie Yingkun Huang; V. Jeyakumar 001; Guoyin Li 001 (EURO J. Comput. Optim., 2024)

Sum-of-Squares Relaxations in Robust DC Optimization and Feature Selection. - Vaithilingam Jeyakumar; Gue Myung Lee; Jae-Hyoung Lee; Yingkun Huang 001 (J. Optim. Theory Appl., 2024)

A distributional Farkas' lemma and moment optimization problems with no-gap dual semi-definite programs. - Queenie Yingkun Huang; Vaithilingam Jeyakumar (Optim. Lett., 2024)

The Stability of Robustness for Conic Linear Programs with Uncertain Data. - Miguel A. Goberna; Vaithilingam Jeyakumar; Guoyin Li 001 (J. Optim. Theory Appl., 2024)

Adjustable robust multiobjective linear optimization: Pareto optimal solutions via conic programming. - Thai Doan Chuong; V. Jeyakumar 001 (Ann. Oper. Res., 2025)

Convexifiable quadratic inequality systems: new minimax S-lemma and exact SOCPs for classes of distributionally robust optimization problems. - Queenie Yingkun Huang; Vaithilingam Jeyakumar; Guoyin Li 001; Duong Thi Kim Huyen (J. Glob. Optim., 2025)