 | 2011 |
| 29 |  | K. Sundaravadivu,
V. Jeyakumar,
K. Saravanan:
Design of Fractional Order PI controller for liquid level control of spherical tank modeled as Fractional Order System.
ICCSCE 2011: 522-525 |
| 28 |  | V. Jeyakumar,
Guoyin Li:
Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems.
J. Global Optimization 49(1): 1-14 (2011) |
| 27 |  | V. Jeyakumar,
G. Y. Li:
Robust Duality for Fractional Programming Problems with Constraint-Wise Data Uncertainty.
J. Optimization Theory and Applications 151(2): 292-303 (2011) |
| 26 |  | V. Jeyakumar,
G. Y. Li:
Necessary global optimality conditions for nonlinear programming problems with polynomial constraints.
Math. Program. 126(2): 393-399 (2011) |
| 25 |  | V. Jeyakumar,
G. Y. Li,
G. M. Lee:
A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty.
Oper. Res. Lett. 39(2): 109-114 (2011) |
| 2010 |
| 24 |  | V. Jeyakumar,
Guoyin Li:
New strong duality results for convex programs with separable constraints.
European Journal of Operational Research 207(3): 1203-1209 (2010) |
| 23 |  | V. Jeyakumar,
Guoyin Li:
Characterizing robust set containments and solutions of uncertain linear programs without qualifications.
Oper. Res. Lett. 38(3): 188-194 (2010) |
| 22 |  | V. Jeyakumar,
G. Y. Li:
Strong Duality in Robust Convex Programming: Complete Characterizations.
SIAM Journal on Optimization 20(6): 3384-3407 (2010) |
| 2009 |
| 21 |  | V. Jeyakumar:
Composite Nonsmooth Optimization.
Encyclopedia of Optimization 2009: 454-457 |
| 20 |  | V. Jeyakumar:
Farkas Lemma: Generalizations.
Encyclopedia of Optimization 2009: 998-1001 |
| 19 |  | V. Jeyakumar,
S. Srisatkunarajah:
A note on sufficient global optimality conditions for fixed charge quadratic programs.
Appl. Math. Lett. 22(7): 1016-1020 (2009) |
| 18 |  | V. Jeyakumar,
S. Srisatkunarajah:
Geometric conditions for Kuhn-Tucker sufficiency of global optimality in mathematical programming.
European Journal of Operational Research 194(2): 363-367 (2009) |
| 17 |  | V. Jeyakumar,
S. Srisatkunarajah:
Lagrange multiplier necessary conditions for global optimality for non-convex minimization over a quadratic constraint via S-lemma.
Optimization Letters 3(1): 23-33 (2009) |
| 16 |  | V. Jeyakumar,
Guoyin Li:
Farkas' lemma for separable sublinear inequalities without qualifications.
Optimization Letters 3(4): 537-545 (2009) |
| 15 |  | V. Jeyakumar,
G. M. Lee,
Guoyin Li:
Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization.
SIAM Journal on Optimization 20(2): 983-1001 (2009) |
| 2008 |
| 14 |  | V. Jeyakumar,
G. M. Lee:
Complete characterizations of stable Farkas' lemma and cone-convex programming duality.
Math. Program. 114(2): 335-347 (2008) |
| 13 |  | V. Jeyakumar:
A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions.
Optimization Letters 2(1): 15-25 (2008) |
| 12 |  | V. Jeyakumar,
N. Q. Huy:
Global minimization of difference of quadratic and convex functions over box or binary constraints.
Optimization Letters 2(2): 223-238 (2008) |
| 2007 |
| 11 |  | V. Jeyakumar,
Alex M. Rubinov,
Z. Y. Wu:
Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions.
Math. Program. 110(3): 521-541 (2007) |
| 2006 |
| 10 |  | V. Jeyakumar,
G. M. Lee,
N. Dinh:
Characterizations of solution sets of convex vector minimization problems.
European Journal of Operational Research 174(3): 1380-1395 (2006) |
| 9 |  | V. Jeyakumar:
The strong conical hull intersection property for convex programming.
Math. Program. 106(1): 81-92 (2006) |
| 2004 |
| 8 |  | V. Jeyakumar,
N. D. Yen:
Solution Stability of Nonsmooth Continuous Systems with Applications to Cone-Constrained Optimization.
SIAM Journal on Optimization 14(4): 1106-1127 (2004) |
| 2003 |
| 7 |  | V. Jeyakumar:
Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints.
SIAM Journal on Optimization 13(4): 947-959 (2003) |
| 6 |  | V. Jeyakumar,
G. M. Lee,
N. Dinh:
New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs.
SIAM Journal on Optimization 14(2): 534-547 (2003) |
| 2002 |
| 5 |  | V. Jeyakumar,
D. T. Luc,
P. N. Tinh:
Convex composite non-Lipschitz programming.
Math. Program. 92(1): 177-195 (2002) |
| 4 |  | V. Jeyakumar,
D. T. Luc:
Sharp Variational Conditions for Convex Composite Nonsmooth Functions.
SIAM Journal on Optimization 13(3): 904-920 (2002) |
| 2000 |
| 3 |  | X. Wang,
V. Jeyakumar:
A Sharp Lagrange Multiplier Rule for Nonsmooth Mathematical Programming Problems Involving Equality Constraints.
SIAM Journal on Optimization 10(4): 1136-1148 (2000) |
| 1999 |
| 2 |  | Hans-Hellmut Nagel,
Michael Haag,
V. Jeyakumar,
Amitabha Mukerjee:
Visualisation of Conceptual Descriptions Derived from Image Sequences.
DAGM-Symposium 1999: 364-371 |
| 1990 |
| 1 |  | Don E. Deal,
Jen-Gwo Chen,
James P. Ignizio,
V. Jeyakumar:
An expert system scheduler: Some reflections on expert systems development.
Computers & OR 17(6): 571-580 (1990) |