Vaithilingam Jeyakumar

81 papers Journal 81

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	A distributionally robust machine learning model of simultaneous classification and feature selection under data uncertainty: Theory, methods, and application to the identification of Alzheimer's disease using handwriting. EURO J. Comput. Optim. Queenie Yingkun Huang, Neil D. Dizon, Niroshan Jeyakumar, Vaithilingam Jeyakumar
2025	J	`jnl`	Convexifiable quadratic inequality systems: new minimax S-lemma and exact SOCPs for classes of distributionally robust optimization problems. J. Glob. Optim. Queenie Yingkun Huang, Vaithilingam Jeyakumar, Guoyin Li, Duong Thi Kim Huyen
2024	J	`jnl`	A distributional Farkas' lemma and moment optimization problems with no-gap dual semi-definite programs. Optim. Lett. Queenie Yingkun Huang, Vaithilingam Jeyakumar
2024	J	`jnl`	Sum-of-Squares Relaxations in Robust DC Optimization and Feature Selection. J. Optim. Theory Appl. Vaithilingam Jeyakumar, Gue Myung Lee, Jae Hyoung Lee, Yingkun Huang
2024	J	`jnl`	The Stability of Robustness for Conic Linear Programs with Uncertain Data. J. Optim. Theory Appl. Miguel A. Goberna, Vaithilingam Jeyakumar, Guoyin Li
2022	J	`jnl`	Robust Optimization and Data Classification for Characterization of Huntington Disease Onset via Duality Methods. J. Optim. Theory Appl. Daniel Woolnough, Niroshan Jeyakumar, Guoyin Li, Clement T. Loy, Vaithilingam Jeyakumar
2022	J	`jnl`	The radius of robust feasibility of uncertain mathematical programs: A Survey and recent developments. Eur. J. Oper. Res. Miguel A. Goberna, Vaithilingam Jeyakumar, Guoyin Li, José Vicente-Pérez
2021	J	`jnl`	Calculating Radius of Robust Feasibility of Uncertain Linear Conic Programs via Semi-definite Programs. J. Optim. Theory Appl. Miguel A. Goberna, Vaithilingam Jeyakumar, Guoyin Li
2021	J	`jnl`	Exact conic programming reformulations of two-stage adjustable robust linear programs with new quadratic decision rules. Optim. Lett. Daniel Woolnough, Vaithilingam Jeyakumar, Guoyin Li
2020	J	`jnl`	Generalized Farkas Lemma with Adjustable Variables and Two-Stage Robust Linear Programs. J. Optim. Theory Appl. Thai Doan Chuong, Vaithilingam Jeyakumar
2019	J	`jnl`	Characterizing best approximation from a convex set without convex representation. J. Approx. Theory Vaithilingam Jeyakumar, Hossein Mohebi
2018	J	`jnl`	Constraint qualifications for convex optimization without convexity of constraints : New connections and applications to best approximation. Eur. J. Oper. Res. N. H. Chieu, Vaithilingam Jeyakumar, Guoyin Li, Hossein Mohebi
2018	J	`jnl`	Exact Second-Order Cone Programming Relaxations for Some Nonconvex Minimax Quadratic Optimization Problems. SIAM J. Optim. Vaithilingam Jeyakumar, Guoyin Li
2018	J	`jnl`	Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations. J. Glob. Optim. Immanuel M. Bomze, Vaithilingam Jeyakumar, Guoyin Li
2018	J	`jnl`	Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers. J. Glob. Optim. Thai Doan Chuong, Vaithilingam Jeyakumar
2018	J	`jnl`	Guaranteeing highly robust weakly efficient solutions for uncertain multi-objective convex programs. Eur. J. Oper. Res. Miguel A. Goberna, Vaithilingam Jeyakumar, Guoyin Li, José Vicente-Pérez
2017	J	`jnl`	A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems. Oper. Res. Lett. N. H. Chieu, Vaithilingam Jeyakumar, Guoyin Li
2017	J	`jnl`	An Exact Formula for Radius of Robust Feasibility of Uncertain Linear Programs. J. Optim. Theory Appl. Thai Doan Chuong, Vaithilingam Jeyakumar
2017	J	`jnl`	Convergent conic linear programming relaxations for cone convex polynomial programs. Oper. Res. Lett. Thai Doan Chuong, Vaithilingam Jeyakumar
2017	J	`jnl`	Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications. Appl. Math. Comput. Thai Doan Chuong, Vaithilingam Jeyakumar
2017	J	`jnl`	Exact Conic Programming Relaxations for a Class of Convex Polynomial Cone Programs. J. Optim. Theory Appl. Vaithilingam Jeyakumar, Guoyin Li
2017	J	`jnl`	Finding Robust Global Optimal Values of Bilevel Polynomial Programs with Uncertain Linear Constraints. J. Optim. Theory Appl. Thai Doan Chuong, Vaithilingam Jeyakumar
2016	J	`jnl`	Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems. SIAM J. Optim. Vaithilingam Jeyakumar, Jean B. Lasserre, Guoyin Li, T. S. Pham
2016	J	`jnl`	Generalized Farkas' lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization. J. Glob. Optim. Vaithilingam Jeyakumar, Gue Myung Lee, N. T. H. Linh
2016	J	`jnl`	Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints. Oper. Res. Lett. Miguel A. Goberna, Vaithilingam Jeyakumar, Guoyin Li, Linh Nguyen
2016	J	`jnl`	Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets. J. Glob. Optim. Vaithilingam Jeyakumar, S. Kim, Gue Myung Lee, Guoyin Li
2015	J	`jnl`	A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs. Oper. Res. Lett. Vaithilingam Jeyakumar, Guoyin Li
2015	J	`jnl`	Characterizing Robust Solution Sets of Convex Programs under Data Uncertainty. J. Optim. Theory Appl. Vaithilingam Jeyakumar, Gue Myung Lee, Guoyin Li
2015	J	`jnl`	Robust SOS-convex polynomial optimization problems: exact SDP relaxations. Optim. Lett. Vaithilingam Jeyakumar, Guoyin Li, José Vicente-Pérez
2015	J	`jnl`	Robust solutions to multi-objective linear programs with uncertain data. Eur. J. Oper. Res. Miguel A. Goberna, Vaithilingam Jeyakumar, Guoyin Li, José Vicente-Pérez
2014	J	`jnl`	Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness. Oper. Res. Lett. Vaithilingam Jeyakumar, T. S. Pham, Guoyin Li
2014	J	`jnl`	Dual Semidefinite Programs Without Duality Gaps for a Class of Convex Minimax Programs. J. Optim. Theory Appl. Vaithilingam Jeyakumar, José Vicente-Pérez
2014	J	`jnl`	Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations. J. Glob. Optim. Vaithilingam Jeyakumar, Guoyin Li, S. Srisatkunarajah
2014	J	`jnl`	On Polynomial Optimization Over Non-compact Semi-algebraic Sets. J. Optim. Theory Appl. Vaithilingam Jeyakumar, Jean B. Lasserre, Guoyin Li
2014	J	`jnl`	Robust Solutions of MultiObjective Linear Semi-Infinite Programs under Constraint Data Uncertainty. SIAM J. Optim. Miguel A. Goberna, Vaithilingam Jeyakumar, Guoyin Li, José Vicente-Pérez
2014	J	`jnl`	Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization. Math. Program. Vaithilingam Jeyakumar, Guoyin Li
2013	J	`jnl`	Robust linear semi-infinite programming duality under uncertainty. Math. Program. Miguel A. Goberna, Vaithilingam Jeyakumar, Guoyin Li, Marco A. López
2013	J	`jnl`	Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty. J. Glob. Optim. Vaithilingam Jeyakumar, Guoyin Li
2013	J	`jnl`	Strong duality for robust minimax fractional programming problems. Eur. J. Oper. Res. Vaithilingam Jeyakumar, Guoyin Li, S. Srisatkunarajah
2012	J	`jnl`	Exact SDP relaxations for classes of nonlinear semidefinite programming problems. Oper. Res. Lett. Vaithilingam Jeyakumar, Guoyin Li
2011	J	`jnl`	A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty. Oper. Res. Lett. Vaithilingam Jeyakumar, Guoyin Li, Gue Myung Lee
2011	J	`jnl`	Necessary global optimality conditions for nonlinear programming problems with polynomial constraints. Math. Program. Vaithilingam Jeyakumar, Guoyin Li
2011	J	`jnl`	Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems. J. Glob. Optim. Vaithilingam Jeyakumar, Guoyin Li
2011	J	`jnl`	Robust Duality for Fractional Programming Problems with Constraint-Wise Data Uncertainty. J. Optim. Theory Appl. Vaithilingam Jeyakumar, Guoyin Li
2010	J	`jnl`	Characterizing robust set containments and solutions of uncertain linear programs without qualifications. Oper. Res. Lett. Vaithilingam Jeyakumar, Guoyin Li
2010	J	`jnl`	New strong duality results for convex programs with separable constraints. Eur. J. Oper. Res. Vaithilingam Jeyakumar, Guoyin Li
2010	J	`jnl`	Simultaneous classification and feature selection via convex quadratic programming with application to HIV-associated neurocognitive disorder assessment. Eur. J. Oper. Res. Michelle Dunbar, John M. Murray, Lucette A. Cysique, Bruce J. Brew, Vaithilingam Jeyakumar
2010	J	`jnl`	Strong Duality in Robust Convex Programming: Complete Characterizations. SIAM J. Optim. Vaithilingam Jeyakumar, Guoyin Li
2009	J	`jnl`	A note on sufficient global optimality conditions for fixed charge quadratic programs. Appl. Math. Lett. Vaithilingam Jeyakumar, S. Srisatkunarajah
2009	J	`jnl`	Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization. SIAM J. Optim. Vaithilingam Jeyakumar, Gue Myung Lee, Guoyin Li
2009	J	`jnl`	Farkas' lemma for separable sublinear inequalities without qualifications. Optim. Lett. Vaithilingam Jeyakumar, Guoyin Li
2009	J	`jnl`	Geometric conditions for Kuhn-Tucker sufficiency of global optimality in mathematical programming. Eur. J. Oper. Res. Vaithilingam Jeyakumar, S. Srisatkunarajah
2009	J	`jnl`	Lagrange multiplier necessary conditions for global optimality for non-convex minimization over a quadratic constraint via S-lemma. Optim. Lett. Vaithilingam Jeyakumar, S. Srisatkunarajah
2008	J	`jnl`	Complete characterizations of stable Farkas' lemma and cone-convex programming duality. Math. Program. Vaithilingam Jeyakumar, Gue Myung Lee
2008	J	`jnl`	Global minimization of difference of quadratic and convex functions over box or binary constraints. Optim. Lett. Vaithilingam Jeyakumar, N. Q. Huy
2008	J	`jnl`	Unified global optimality conditions for smooth minimization problems with mixed variables. RAIRO Oper. Res. Vaithilingam Jeyakumar, Sivakolundu Srisatkunarajah, Nguyen Quang Huy
2007	J	`jnl`	Conditions for Global Optimality of Quadratic Minimization Problems with LMI Constraints. Asia Pac. J. Oper. Res. Vaithilingam Jeyakumar, Zhi-You Wu
2007	J	`jnl`	Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions. Math. Program. Vaithilingam Jeyakumar, Alex M. Rubinov, Zhi-You Wu
2006	J	`jnl`	Characterizations of solution sets of convex vector minimization problems. Eur. J. Oper. Res. Vaithilingam Jeyakumar, Gue Myung Lee, N. Dinh
2006	J	`jnl`	Dual Characterizations of Set Containments with Strict Convex Inequalities. J. Glob. Optim. Miguel A. Goberna, Vaithilingam Jeyakumar, Nguyen Dinh
2006	J	`jnl`	Knowledge-based semidefinite linear programming classifiers. Optim. Methods Softw. Vaithilingam Jeyakumar, John T. Ormerod, Robert S. Womersley
2006	J	`jnl`	Liberating the Subgradient Optimality Conditions from Constraint Qualifications. J. Glob. Optim. Vaithilingam Jeyakumar, Zhi-You Wu, Gue Myung Lee, N. Dinh
2006	J	`jnl`	Sufficient Global Optimality Conditions for Non-convex Quadratic Minimization Problems With Box Constraints. J. Glob. Optim. Vaithilingam Jeyakumar, Alex M. Rubinov, Zhi-You Wu
2005	J	`jnl`	A new geometric condition for Fenchel's duality in infinite dimensional spaces. Math. Program. Regina Sandra Burachik, Vaithilingam Jeyakumar
2005	J	`jnl`	Limiting J. Approx. Theory Vaithilingam Jeyakumar, Hossein Mohebi
2004	J	`jnl`	Solution Stability of Nonsmooth Continuous Systems with Applications to Cone-Constrained Optimization. SIAM J. Optim. Vaithilingam Jeyakumar, Nguyen Dong Yen
2003	J	`jnl`	New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs. SIAM J. Optim. Vaithilingam Jeyakumar, Gue Myung Lee, N. Dinh
2002	J	`jnl`	Convex composite non-Lipschitz programming. Math. Program. Vaithilingam Jeyakumar, Dinh The Luc, Phan Nhat Tinh
2002	J	`jnl`	Sharp Variational Conditions for Convex Composite Nonsmooth Functions. SIAM J. Optim. Vaithilingam Jeyakumar, Dinh The Luc
2000	J	`jnl`	A Sharp Lagrange Multiplier Rule for Nonsmooth Mathematical Programming Problems Involving Equality Constraints. SIAM J. Optim. X. Wang, Vaithilingam Jeyakumar
1999	J	`jnl`	Dual conditions characterizing optimality for convex multi-objective programs. Math. Program. Bevil Milton Glover, Vaithilingam Jeyakumar, Alexander M. Rubinov
1997	J	`jnl`	Hunting for a Smaller Convex Subdifferential. J. Glob. Optim. Vladimir F. Demyanov, Vaithilingam Jeyakumar
1996	J	`jnl`	Characterizing global optimality for DC optimization problems under convex inequality constraints. J. Glob. Optim. Vaithilingam Jeyakumar, Bevil Milton Glover
1996	J	`jnl`	Complete Characterizations of Global Optimality for Problems Involving the Pointwise Minimum of Sublinear Functions. SIAM J. Optim. Bevil Milton Glover, Y. Ishizuka, Vaithilingam Jeyakumar, H. D. Tuan
1995	J	`jnl`	Nonlinear Extensions of Farkas' Lemma with Applications to Global Optimization and Least Squares. Math. Oper. Res. Vaithilingam Jeyakumar, Bevil Milton Glover
1994	J	`jnl`	A Farkas lemma for difference sublinear systems and quasidifferentiable programming. Math. Program. Bevil Milton Glover, Vaithilingam Jeyakumar, Werner Oettli
1993	J	`jnl`	A solvability theorem and minimax fractional programming. ZOR Methods Model. Oper. Res. Joachim Gwinner, Vaithilingam Jeyakumar
1993	J	`jnl`	Convex composite multi-objective nonsmooth programming. Math. Program. Vaithilingam Jeyakumar, Xiaoqi Yang
1992	J	`jnl`	Generalizations of Slater's constraint qualification for infinite convex programs. Math. Program. Vaithilingam Jeyakumar, Henry Wolkowicz
1991	J	`jnl`	Composite Nonsmooth Programming with Gâteaux Differentiability. SIAM J. Optim. Vaithilingam Jeyakumar
1984	J	`jnl`	Nonlinear alternative theorems and nondifferentiable programming. Z. Oper. Research Vaithilingam Jeyakumar