| 2009 |
| 12 | EE | V. Jeyakumar:
Composite Nonsmooth Optimization.
Encyclopedia of Optimization 2009: 454-457 |
| 11 | EE | V. Jeyakumar:
Farkas Lemma: Generalizations.
Encyclopedia of Optimization 2009: 998-1001 |
| 10 | EE | V. Jeyakumar,
S. Srisatkunarajah:
A note on sufficient global optimality conditions for fixed charge quadratic programs.
Appl. Math. Lett. 22(7): 1016-1020 (2009) |
| 9 | EE | 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) |
| 2008 |
| 8 | EE | V. Jeyakumar,
G. M. Lee:
Complete characterizations of stable Farkas' lemma and cone-convex programming duality.
Math. Program. 114(2): 335-347 (2008) |
| 7 | EE | V. Jeyakumar:
A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions.
Optimization Letters 2(1): 15-25 (2008) |
| 6 | EE | 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 |
| 5 | EE | 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 |
| 4 | EE | 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) |
| 3 | EE | V. Jeyakumar:
The strong conical hull intersection property for convex programming.
Math. Program. 106(1): 81-92 (2006) |
| 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 | EE | 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) |