V. Jeyakumar

发表

Strong duality in robust semi-definite linear programming under data uncertainty

Vaithilingam Jeyakumar, Guoyin Li, Guoyin Li, 2014 .

Robust duality for generalized convex programming problems under data uncertainty

Vaithilingam Jeyakumar, Guoyin Li, Guoyin Li, 2012 .

Robust Farkas’ lemma for uncertain linear systems with applications

Vaithilingam Jeyakumar, Guoyin Li, Guoyin Li, 2011 .

Robust conjugate duality for convex optimization under uncertainty with application to data classifi

Vaithilingam Jeyakumar, Gue Myung Lee, Guoyin Li, 2011 .

Solving Global Optimization Problems with Sparse Polynomials and Unbounded Semialgebraic Feasible Sets

Sunyoung Kim, V. Jeyakumar, G. M. Lee, 2014 .

A Bounded Degree Lasserre Hierarchy with SOCP Relaxations for Global Polynomial Optimization and Applications.

T. D. Chuong, V. Jeyakumar, G. Li, 2017, 1710.06598.

Support vector machine classifiers with uncertain knowledge sets via robust optimization

Guoyin Li, V. Jeyakumar, G. Li, 2014 .

Asymptotic conditions for weak and proper optimality in infinite dimensional convex vector optimization

A. Zaffaroni, V. Jeyakumar, 1996 .

Robust best approximation with interpolation constraints under ellipsoidal uncertainty: Strong duality and nonsmooth Newton methods☆

J. H. Wang, B. Mordukhovich, Guoyin Li, 2013 .

Equivalence of saddle-points and optima, and duality for a class of non-smooth non-convex problems

V. Jeyakumar, 1988 .

Nonsmooth vector functions and continuous optimization

D. Luc, V. Jeyakumar, 2008 .

A new class of alternative theorems for SOS-convex inequalities and robust optimization

Vaithilingam Jeyakumar, Guoyin Li, Guoyin Li, 2015 .

Stability, stabilization and duality for linear time-varying systems

Vaithilingam Jeyakumar, Vu Ngoc Phat, V. Phat, 2010 .

New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs

Guoyin Li, V. Jeyakumar, 2009 .

Some Robust Convex Programs without a Duality Gap ∗

J. H. Wang, V. Jeyakumar, G. Li, 2012 .

First-and Second-order Optimality Conditions for Convex Composite Multi-objective Optimization

V. Jeyakumar, Q. Yang, Q. YANG, 1997 .

Approximate Jacobian Matrices for Nonsmooth Continuous Maps and C 1 -Optimization

V. Jeyakumar, D. T. Luc, D. Luc, 1998 .

Kuhn-Tucker sufficiency for global minimum of multi-extremal mathematical programming problems

N. Q. Huy, Vaithilingam Jeyakumar, V. Jeyakumar, 2007 .

Global Optimality Principles for Polynomial Optimization Problems over Box or Bivalent Constraints by Separable Polynomial Approximations ∗

V. Jeyakumar, G. Li, S. Srisatkunarajah, 2012 .

New Kuhn–Tucker sufficiency for global optimality via convexification

G. Lee, V. Jeyakumar, S. Srisatkunarajah, 2009 .

New Sufficiency for Global Optimality and Duality of Mathematical Programming Problems via Underestimators

V. Jeyakumar, S. Srisatkunarajah, 2009 .

Lagrange Multiplier Conditions Characterizing the Optimal Solution Sets of Cone-Constrained Convex Programs

Vaithilingam Jeyakumar, Nguyen Nang Dinh, V. Jeyakumar, 2004 .

Convexlike alternative theorems and mathematical programming

Vaithilingam Jeyakumar, V. Jeyakumar, 1985 .

A Dual Criterion for Maximal Monotonicity of Composition Operators

Zhiyou Wu, V. Jeyakumar, 2007 .

Approximate generalized Hessians and Taylor's expansions for continuously Gâteaux differentiable functions

Xiaoqi Yang, V. Jeyakumar, 1999 .

Solvability theorems for classes of difference convex functions

B. M. Glover, W. Oettli, V. Jeyakumar, 1994 .

Global Optimality Conditions for Classes of Non-convex Multi-objective Quadratic Optimization Problems

Guoyin Li, V. Jeyakumar, G. M. Lee, 2010 .

Sums of Squares Polynomial Program Reformulations for Adjustable Robust Linear Optimization Problems with Separable Polynomial Decision Rules

V. Jeyakumar, G. M. Lee, G. Li, 2022, Set-Valued and Variational Analysis.

On subgradient duality with strong and weak convex functions

V. Jeyakumar, 1986, Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics.

Finding Robust Global Optimal Values of Bilevel Polynomial Programs with Uncertain Linear Constraints

V. Jeyakumar, T. D. Chuong, 2017, Journal of Optimization Theory and Applications.

Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization

V. Jeyakumar, G. Li, 2013, Mathematical Programming.

Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty

V. Jeyakumar, G. Li, 2012, Journal of Global Optimization.

Dual Semidefinite Programs Without Duality Gaps for a Class of Convex Minimax Programs

V. Jeyakumar, J. Vicente-Pérez, 2013, Journal of Optimization Theory and Applications.

Exact conic programming reformulations of two-stage adjustable robust linear programs with new quadratic decision rules

V. Jeyakumar, G. Li, D. Woolnough, 2020, Optimization Letters.

Characterizing Robust Solution Sets of Convex Programs under Data Uncertainty

V. Jeyakumar, G. M. Lee, G. Li, 2014, Journal of Optimization Theory and Applications.

Generalized Farkas’ lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization

V. Jeyakumar, G. M. Lee, N. T. H. Linh, 2015, Journal of Global Optimization.

Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality

N. H. Chieu, V. Jeyakumar, G. Li, 2017, Eur. J. Oper. Res..

Zero duality gaps in infinite-dimensional programming

Henry Wolkowicz, Vaithilingam Jeyakumar, V. Jeyakumar, 1990 .

Classes of Nonnegative Quadratic Optimization Problems with Exact Copositive Relaxation

N. H. Chieu, V. Jeyakumar, G. Li, 2017 .

Farkas’ lemma: three decades of generalizations for mathematical optimization

V. Jeyakumar, N. Dinh, 2014, TOP.

Two-Stage Adjustable Robust Linear Optimization with New Quadratic Decision Rules: Exact SDP Reformulations

V. Jeyakumar, D. Woolnough, 2020 .

Dual Semidefinite Programs Without Duality Gaps for a Class of Convex Minimax Programs

Vaithilingam Jeyakumar, José Vicente-Pérez, V. Jeyakumar, 2013, Journal of Optimization Theory and Applications.

Robust linear semi-infinite programming duality under uncertainty

Marco A. López, Miguel A. Goberna, Vaithilingam Jeyakumar, 2013, Math. Program..

Exact SDP relaxations for classes of nonlinear semidefinite programming problems

Vaithilingam Jeyakumar, Guoyin Li, Guoyin Li, 2012, Oper. Res. Lett..

Dual conditions characterizing optimality for convex multi-objective programs

Vaithilingam Jeyakumar, Alexander M. Rubinov, Bevil Milton Glover, 1999, Math. Program..

Sufficient Global Optimality Conditions for Non-convex Quadratic Minimization Problems With Box Constraints

Zhi-You Wu, Vaithilingam Jeyakumar, Alexander M. Rubinov, 2006, J. Glob. Optim..

Generalized convex relations with applications to optimization and models of economic dynamics

B. M. Glover, A. Rubinov, V. Jeyakumar, 1996 .

A general approach to dual characterizations of solvability of inequality systems with applications.

Vaithilingam Jeyakumar, B. M. Glover, A. Rubinov, 1995 .

Nonlinear alternative theorems and nondifferentiable programming

Vaithilingam Jeyakumar, V. Jeyakumar, 1984, Z. Oper. Research.

A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions

V. Jeyakumar, V. Jeyakumar, 2007, Optim. Lett..

Limiting epsilon-subgradient characterizations of constrained best approximation

Vaithilingam Jeyakumar, Hossein Mohebi, V. Jeyakumar, 2005, J. Approx. Theory.

Convex composite multi-objective nonsmooth programming

Xiaoqi Yang, Vaithilingam Jeyakumar, Xiaoqi Yang, 1993, Math. Program..

Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions

Zhi-You Wu, Vaithilingam Jeyakumar, Alexander M. Rubinov, 2007, Math. Program..

Guaranteeing highly robust weakly efficient solutions for uncertain multi-objective convex programs

Vaithilingam Jeyakumar, Miguel A. Goberna, Guoyin Li, 2018, Eur. J. Oper. Res..

An Exact Formula for Radius of Robust Feasibility of Uncertain Linear Programs

Vaithilingam Jeyakumar, Thai Doan Chuong, T. D. Chuong, 2017, J. Optim. Theory Appl..

A generalized Farkas lemma with a numerical certificate and linear semi-infinite programs with SDP duals

Vaithilingam Jeyakumar, Thai Doan Chuong, T. D. Chuong, 2017 .

Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints

Miguel A. Goberna, Vaithilingam Jeyakumar, Guoyin Li, 2016, Oper. Res. Lett..

Robust solutions to multi-objective linear programs with uncertain data

Vaithilingam Jeyakumar, Miguel A. Goberna, Guoyin Li, 2014, Eur. J. Oper. Res..

Robust Solutions of MultiObjective Linear Semi-Infinite Programs under Constraint Data Uncertainty

Vaithilingam Jeyakumar, Miguel A. Goberna, Guoyin Li, 2014, SIAM J. Optim..

Robust linear semi-infinite programming duality under uncertainty

M. Goberna, Guoyin Li, V. Jeyakumar, 2013, Math. Program..

A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty

Vaithilingam Jeyakumar, Guoyin Li, G. M. Lee, 2011, Oper. Res. Lett..

Farkas’ lemma: three decades of generalizations for mathematical optimization

Vaithilingam Jeyakumar, Nguyen Nang Dinh, V. Jeyakumar, 2014 .

Nonlinear Extensions of Farkas' Lemma with Applications to Global Optimization and Least Squares

Vaithilingam Jeyakumar, Bevil Milton Glover, B. M. Glover, 1995, Math. Oper. Res..

Inequality systems and optimization

Vaithilingam Jeyakumar, J. Gwinner, J. Gwinner, 1991 .

Duality and infinite dimensional optimization

Vaithilingam Jeyakumar, V. Jeyakumar, 1990 .

A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processes

Vaithilingam Jeyakumar, V. Jeyakumar, 1987 .

On characterizing the solution sets of pseudolinear programs

Xiaoqi Yang, Vaithilingam Jeyakumar, Xiaoqi Yang, 1995 .

Strong duality for robust minimax fractional programming problems

Vaithilingam Jeyakumar, Guoyin Li, S. Srisatkunarajah, 2013, Eur. J. Oper. Res..

On generalised convex mathematical programming

Vaithilingam Jeyakumar, B. Mond, B. Mond, 1992, The Journal of the Australian Mathematical Society. Series B. Applied Mathematics.

Lagrange multiplier necessary conditions for global optimality for non-convex minimization over a quadratic constraint via S-lemma

Vaithilingam Jeyakumar, S. Srisatkunarajah, V. Jeyakumar, 2009, Optim. Lett..

Quadratically adjustable robust linear optimization with inexact data via generalized S-lemma: Exact second-order cone program reformulations

V. Jeyakumar, G. Li, D. Woolnough, 2021, EURO J. Comput. Optim..

Exact conic programming reformulations of two-stage adjustable robust linear programs with new quadratic decision rules

Guoyin Li, V. Jeyakumar, D. Woolnough, 2020, Optim. Lett..

Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations

Vaithilingam Jeyakumar, Guoyin Li, Immanuel M. Bomze, 2017, J. Glob. Optim..

A Sharp Lagrange Multiplier Rule for Nonsmooth Mathematical Programming Problems Involving Equality Constraints

Vaithilingam Jeyakumar, X. Wang, X. Wang, 1999, SIAM J. Optim..

Nonsmooth Calculus, Minimality, and Monotonicity of Convexificators

Vaithilingam Jeyakumar, D. T. Luc, D. Luc, 1999 .

Hunting for a Smaller Convex Subdifferential

Vladimir F. Demyanov, V. Jeyakumar, V. Demyanov, 1997, J. Glob. Optim..

Farkas’ lemma for separable sublinear inequalities without qualifications

Vaithilingam Jeyakumar, Guoyin Li, Guoyin Li, 2009, Optim. Lett..

Strong Duality in Robust Convex Programming: Complete Characterizations

Vaithilingam Jeyakumar, Guoyin Li, Guoyin Li, 2010, SIAM J. Optim..

Characterizing robust set containments and solutions of uncertain linear programs without qualifications

Vaithilingam Jeyakumar, Guoyin Li, Guoyin Li, 2010, Oper. Res. Lett..

New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs

Vaithilingam Jeyakumar, G. M. Lee, N. Dinh, 2003, SIAM J. Optim..

Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints

V. Jeyakumar, V. Jeyakumar, 2002, SIAM J. Optim..

Dual Characterizations of Set Containments with Strict Convex Inequalities

Nguyen Dinh, Miguel A. Goberna, Vaithilingam Jeyakumar, 2006, J. Glob. Optim..

Continuous optimization : current trends and modern applications

Vaithilingam Jeyakumar, A. Rubinov, V. Jeyakumar, 2005 .

An open mapping theorem using unbounded generalized jacobians

Vaithilingam Jeyakumar, D. T. Luc, D. Luc, 2002 .

Robust Duality in Parametric Convex Optimization

V. Jeyakumar, G. Li, R. Boț, 2012, Set-Valued and Variational Analysis.

On optimality conditions in nonsmooth inequality constrained minimization

Vaithilingam Jeyakumar, V. Jeyakumar, 1987 .

The radius of robust feasibility of uncertain mathematical programs: A Survey and recent developments

V. Jeyakumar, M.A. Goberna, G. Li, 2021, Eur. J. Oper. Res..

A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs

Vaithilingam Jeyakumar, G. Li, T. D. Chuong, 2019, Journal of Global Optimization.

Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems

Vaithilingam Jeyakumar, Guoyin Li, Jean B. Lasserre, 2015, SIAM J. Optim..

Robust Duality for Fractional Programming Problems with Constraint-Wise Data Uncertainty

G. Y. Li, V. Jeyakumar, Guoyin Li, 2011, J. Optim. Theory Appl..

A simple closure condition for the normal cone intersection formula

Vaithilingam Jeyakumar, Regina S. Burachik, R. Burachik, 2004 .

Exact dual semi-definite programs for affinely adjustable robust SOS-convex polynomial optimization problems

Vaithilingam Jeyakumar, Thai Doan Chuong, Guoyin Li, 2021 .

Robust Optimization and Data Classification for Characterization of Huntington Disease Onset via Duality Methods

Vaithilingam Jeyakumar, Guoyin Li, Clement T Loy, 2021, Journal of Optimization Theory and Applications.

Robust Optimization and Data Classification for Characterization of Huntington Disease Onset via Duality Methods

C. Loy, Guoyin Li, V. Jeyakumar, 2021, Journal of Optimization Theory and Applications.

Calculating Radius of Robust Feasibility of Uncertain Linear Conic Programs via Semi-definite Programs

Vaithilingam Jeyakumar, Miguel A. Goberna, Guoyin Li, 2020, Journal of Optimization Theory and Applications.

A copositive Farkas lemma and minimally exact conic relaxations for robust quadratic optimization with binary and quadratic constraints

Thai Doan Chuong, N. H. Chieu, N. H. Chieu, 2019, Oper. Res. Lett..

Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers

Vaithilingam Jeyakumar, Thai Doan Chuong, T. D. Chuong, 2018, J. Glob. Optim..

Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers

T. D. Chuong, V. Jeyakumar, 2018, Journal of Global Optimization.

Exact Second-Order Cone Programming Relaxations for Some Nonconvex Minimax Quadratic Optimization Problems

Vaithilingam Jeyakumar, Guoyin Li, Guoyin Li, 2018, SIAM J. Optim..

Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications

Vaithilingam Jeyakumar, Thai Doan Chuong, T. D. Chuong, 2017, Appl. Math. Comput..

An Exact Formula for Radius of Robust Feasibility of Uncertain Linear Programs

T. D. Chuong, V. Jeyakumar, 2017, Journal of Optimization Theory and Applications.

Robust Global Solutions of Bilevel Polynomial Optimization Problems with Uncertain Linear Constraints

T. D. Chuong, V. Jeyakumar, 2016, 1601.06464.

A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs

Vaithilingam Jeyakumar, Guoyin Li, Guoyin Li, 2015, Oper. Res. Lett..

Characterizing Robust Solution Sets of Convex Programs under Data Uncertainty

Vaithilingam Jeyakumar, Guoyin Li, G. M. Lee, 2015, J. Optim. Theory Appl..

Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization

Vaithilingam Jeyakumar, Guoyin Li, Guoyin Li, 2013, Mathematical Programming.

Robust SOS-convex polynomial optimization problems: exact SDP relaxations

Vaithilingam Jeyakumar, José Vicente-Pérez, Guoyin Li, 2013, Optimization Letters.

Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty

Vaithilingam Jeyakumar, Guoyin Li, Guoyin Li, 2013, J. Glob. Optim..

Global optimality conditions for nonlinear programming problems with bounds via quadratic underestimators

V. Jeyakumar, N. Q. Huy, 2010 .

Necessary and sufficient conditions for S-lemma and nonconvex quadratic optimization

N. Q. Huy, Vaithilingam Jeyakumar, Guoyin Li, 2009 .

Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization

Vaithilingam Jeyakumar, Guoyin Li, G. M. Lee, 2009, SIAM J. Optim..

Global minimization of difference of quadratic and convex functions over box or binary constraints

N. Q. Huy, Vaithilingam Jeyakumar, V. Jeyakumar, 2008, Optim. Lett..

Sufficient global optimality conditions for multi-extremal smooth minimisation problems with bounds and linear matrix inequality constraints

N. Q. Huy, Vaithilingam Jeyakumar, Gue Myung Lee, 2006, The ANZIAM Journal.

Second Order Conditions for Kuhn-Tucker Sufficient Optimality for Optimization Problems with Linear Matrix Inequality Constraints

V. Jeyakumar, S. Srisatkunrajah, 2020 .

Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems

Vaithilingam Jeyakumar, Guoyin Li, Guoyin Li, 2011, J. Glob. Optim..

Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities

Marco A. López, Miguel A. Goberna, Vaithilingam Jeyakumar, 2008 .

A new geometric condition for Fenchel's duality in infinite dimensional spaces

Regina Sandra Burachik, Vaithilingam Jeyakumar, R. Burachik, 2005, Math. Program..

Robust global error bounds for uncertain linear inequality systems with applications

Vaithilingam Jeyakumar, Thai Doan Chuong, T. D. Chuong, 2016 .

O C ] 7 O ct 2 01 3 Robust SOS-Convex Polynomial Programs : Exact SDP Relaxations ∗

V. Jeyakumar, G. Li, J. Vicente-Pérez, 2013 .

Convergent conic linear programming relaxations for cone convex polynomial programs

Vaithilingam Jeyakumar, Thai Doan Chuong, T. D. Chuong, 2017, Oper. Res. Lett..

On Polynomial Optimization Over Non-compact Semi-algebraic Sets

Vaithilingam Jeyakumar, Guoyin Li, Jean B. Lasserre, 2013, J. Optim. Theory Appl..

A Dual Condition for the Convex Subdifferential Sum Formula with Applications

V. Jeyakumar, V. Jeyakumar, 2022 .

Simultaneous classification and feature selection via convex quadratic programming with application to HIV-associated neurocognitive disorder assessment

Vaithilingam Jeyakumar, John M. Murray, Michelle Dunbar, 2010, Eur. J. Oper. Res..

On Polynomial Optimization Over Non-compact Semi-algebraic Sets

J. Lasserre, V. Jeyakumar, G. Li, 2014, Journal of Optimization Theory and Applications.

Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness

Vaithilingam Jeyakumar, Guoyin Li, T. S. Pham, 2013, Oper. Res. Lett..

Stable zero duality gaps in convex programming: Complete dual characterisations with applications to semidefinite programs

Vaithilingam Jeyakumar, Guoyin Li, Guoyin Li, 2009 .

Characterizing global optimality for DC optimization problems under convex inequality constraints

Vaithilingam Jeyakumar, Bevil Milton Glover, V. Jeyakumar, 1996, J. Glob. Optim..

On Global Optimality Conditions for D.C. Programming Problems

石塚陽, V. F. Jeyakumar, 石塚陽, 1994 .

Generalized Fenchel’s Conjugation Formulas and Duality for Abstract Convex Functions

A. Rubinov, V. Jeyakumar, Z. Wu, 2007 .

Generalized Farkas Lemma with Adjustable Variables and Two-Stage Robust Linear Programs

Vaithilingam Jeyakumar, Thai Doan Chuong, T. D. Chuong, 2020, Journal of Optimization Theory and Applications.

Equivalence of a Ky Fan type minimax theorem and a Gordan type alternative theorem

Vaithilingam Jeyakumar, B. D. Craven, B. Craven, 1986 .

Asymptotic Dual Conditions Characterizing Optimality for Infinite Convex Programs

Vaithilingam Jeyakumar, V. Jeyakumar, 1997 .

Generalized second-order directional derivatives and optimization with C

Xiaoqi Yang, Vaithilingam Jeyakumar, Xiaoqi Yang, 1992 .

Necessary global optimality conditions for nonlinear programming problems with polynomial constraints

Vaithilingam Jeyakumar, Guoyin Li, Guoyin Li, 2011, Math. Program..

A class of nonconvex functions and mathematical programming

Vaithilingam Jeyakumar, T. Weir, V. Jeyakumar, 1988, Bulletin of the Australian Mathematical Society.

A generalization of a minimax theorem of Fan via a theorem of the alternative

Vaithilingam Jeyakumar, V. Jeyakumar, 1986 .

A generalized mean-value theorem and optimality conditions in composite nonsmooth minimization

Vaithilingam Jeyakumar, M. Studniarski, V. Jeyakumar, 1995 .

Piecewise SOS-convex moment optimization and applications via exact semi-definite programs

Guoyin Li, V. Jeyakumar, Queenie Yingkun Huang, 2024, EURO Journal on Computational Optimization.

Exact Semi-Definite Programs for Piecewise SOS-Convex Moment Optimization and Applications

Guoyin Li, V. Jeyakumar, Queenie Yingkun Huang, 2022 .

A distributional Farkas' lemma and moment optimization problems with no-gap dual semi-definite programs

V. Jeyakumar, Queenie Yingkun Huang, 2024, Optim. Lett..

Sum-of-Squares Relaxations in Robust DC Optimization and Feature Selection

Jae Hyoung Lee, V. Jeyakumar, Gue Myung Lee, 2023, J. Optim. Theory Appl..

Affinely adjustable robust optimization for radiation therapy under evolving data uncertainty via semi-definite programming

V. Jeyakumar, G. Li, H. Wu, 2023, Optimization.

Constraint qualifications for convex optimization without convexity of constraints : New connections and applications to best approximation

Vaithilingam Jeyakumar, Guoyin Li, Hossein Mohebi, 2018, Eur. J. Oper. Res..

Solution Stability of Nonsmooth Continuous Systems with Applications to Cone-Constrained Optimization

Vaithilingam Jeyakumar, Nguyen Dong Yen, N. D. Yen, 2004, SIAM J. Optim..

A screening algorithm for HIV‐associated neurocognitive disorders

V. Jeyakumar, L. Cysique, V. Jeyakumar, 2010, HIV medicine.

Nonconvex theorems of the alternative and minimization

B. Craven, J. Gwinner, V. Jeyakumar, 1987 .

Finding Robust Global Optimal Values of Bilevel Polynomial Programs with Uncertain Linear Constraints

Vaithilingam Jeyakumar, Thai Doan Chuong, T. D. Chuong, 2017, J. Optim. Theory Appl..