By Professor Jeya Jeyakumar

Journal articles

Jeyakumar V; Li G, 2009, 'New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs', Nonlinear Analysis - Theory Methods and Applications, 71, pp. e2239 - e2249

Jeyakumar V; Lee GM; Srisatkunarajah S, 2009, 'New Kuhn-Tucker sufficiency for global optimality via convexification', Nonlinear Analysis - Theory Methods and Applications, 71, pp. 373 - 381

Jeyakumar V; Srisatkunarajah S, 2009, 'New sufficiency for global optimality and duality of mathematical programming problems via underestimators', Journal of Optimization Theory and Applications, 140, pp. 239 - 247

Jeyakumar V; Li G, 2009, 'Qualification-free optimality conditions for convex programs with separable inequality constraints', Journal of Convex Analysis, 16, pp. 845 - 856

Jeyakumar V; Li G, 2009, 'Stable zero duality gaps in convex programming: Complete dual characterisations with applications to semidefinite programs', Journal of Mathematical Analysis and Applications, 360, pp. 156 - 167

Jeyakumar V, 2008, 'Constraint qualifications characterizing lagrangian duality in convex optimization', Journal of Optimization Theory and Applications, 136, pp. 31 - 41, http://dx.doi.org/10.1007/s10957-007-9294-x

Jeyakumar V, 2008, 'A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions', Optimization Letters, 2, pp. 15 - 25

Jeyakumar V; Lee GM, 2008, 'Complete characterizations of stable Farkas` lemma and cone-convex programming duality', Mathematical Programming, 114, pp. 335 - 347, http://dx.doi.org/10.1007/s10107-007-0104-x

Jeyakumar V, 2008, 'Constraint qualifications characterizing Lagrangian duality in convex optimization', Journal of Optimization Theory and Applications, 136, pp. 369 - 391

Jeyakumar V; Huy N, 2008, 'Global minimization of difference of quadratic and convex functions over box or binary constraints', Optimization Letters, 2, pp. 223 - 238

Jeyakumar V; Kum S; Lee G, 2008, 'Necessary and sufficient conditions for Farkas` lemma for cone systems and second-order cone programming duality', Journal of Convex Analysis, 15, pp. 63 - 71

Gwinner J; Jeyakumar V; Lee GM, 2008, 'Necessary and sufficient conditions for globally stable convex minimax theorems', Pacific Journal of Optimization, 4, pp. 483 - 491

Goberna MA; Jeyakumar V; Lopez MA, 2008, 'Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities', Nonlinear Analysis - Theory Methods and Applications, 68, pp. 1184 - 1194

Jeyakumar V; Srisatkunarajah S; Nguyen H, 2008, 'Unified global optimality conditions for smooth minimization problems with mixed variables', Rairo-Operations Research, 42, pp. 361 - 370

Jeyakumar V; Wu Z, 2007, 'A dual criterion for maximal monotonicity of composition operators', Set - Valued Analysis, 15, pp. 265 - 273

Jeyakumar V; Wu ZY, 2007, 'Conditions for global optimality of quadratic minimization problems with LMI constraints', Asia-Pacific Journal of Operational Research, 24, pp. 149 - 160, http://dx.doi.org/10.1142/S021759590700119X

Jeyakumar V; Rubinov A; Wu ZY, 2007, 'Generalized Fenchel`s conjugation formulas and duality for abstract convex functions', Journal of Optimization Theory and Applications, 132, pp. 441 - 458

Jeyakumar V; Huy N, 2007, 'Global minimization of difference of quadratic and convex functions over box or binary constraints', Optimization Letters

Jeyakumar V; Huy N, 2007, 'Global optimality of quadratic minimization over symmetric polytopes', Optimization, 56, pp. 633 - 640

Jeyakumar V; Srisatkunarajah S; Huy N, 2007, 'Kuhn-Tucker sufficiency for global minimum of multi-extremal mathematical programming problems', Journal of Mathematical Analysis and Applications, 335, pp. 779 - 788

Jeyakumar V; Rubinov A; Wu ZY, 2007, 'Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions', Mathematical Programming, 110, pp. 521 - 541

Wu ZY; Jeyakumar V; Rubinov A, 2007, 'Sufficient conditions for global optimality of bivalent non-convex quadratic programs with inequality constraints', Journal of Optimization Theory and Applications, 133, pp. 123 - 130

Jeyakumar V; Wu Z, 2006, 'A qualification free sequential Pshenichnyi-Rockafellar Lemma and convex semidefinite programming', Journal of Convex Analysis, 13, pp. 773 - 784

Jeyakumar V; Thera M; Wu Z, 2006, 'Asymptotic sums of monotone operators', Pacific Journal of Optimization, 2, pp. 591 - 598

Jeyakumar V; Lee GM; Dinh N, 2006, 'Characterizations of solution sets of convex vector minimization problems', European Journal of Operational Research, 174, pp. 1380 - 1395

Goberna MA; Jeyakumar V; Dinh N, 2006, 'Dual characterizations of set containments with strict convex inequalities', Journal of Global Optimization, 34, pp. 33 - 54

Jeyakumar V; Ormerod JT; Womersley RS, 2006, 'Knowledge-based semidefinite linear programming classifiers', Optimization Methods and Software, 21, pp. 693 - 706

Dinh N; Jeyakumar V; Lee G, 2006, 'Lagrange multiplier characterizations of solution sets of constrained pseudolinear optimization problems', Optimization, 55, pp. 241 - 250

Jeyakumar V; Wu ZY; Lee GM; Dinh N, 2006, 'Liberating the subgradient optimality conditions from constraint qualifications', Journal of Global Optimization, 36, pp. 127 - 137

Burachik RS; Jeyakumar V; Wu Z, 2006, 'Necessary and sufficient conditions for stable conjugate duality', Nonlinear Analysis - Theory Methods and Applications, 64, pp. 1998 - 2006

Huy N; Jeyakumar V; Lee G, 2006, 'Sufficient global optimality conditions for multi-extremal smooth minimisation problems with bounds and linear matrix inequality constraints', ANZIAM Journal, 47, pp. 439 - 450

Jeyakumar V; Rubinov A; Wu ZY, 2006, 'Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints', Journal of Global Optimization, 36, pp. 471 - 481

Jeyakumar V, 2006, 'The strong conical hull intersection property for convex programming', Mathematical Programming, 106, pp. 81 - 92, http://dx.doi.org/10.1007/s10107-005-0605-4

Burachik RS; Jeyakumar V, 2005, 'A dual condition for the convex subdifferential sum formula with applications', Journal of Convex Analysis, 12, pp. 279 - 290

Jeyakumar V; Mohebi H, 2005, 'A global approach to nonlinearly constrained best approximation', Numerical Functional Analysis and Optimization, 26, pp. 205 - 227

Burachik RS; Jeyakumar V, 2005, 'A new geometric condition for Fenchel`s duality in infinite dimensional spaces', Mathematical Programming, 104, pp. 229 - 233

Burachik RS; Jeyakumar V, 2005, 'A simple closure condition for the normal cone intersection formula', Proceedings of the American Mathematical Society, 133, pp. 1741 - 1748

Jeyakumar V; Mohebi H, 2005, 'Limiting epsilon-subgradient characterizations of constrained best approximations', Journal of Approximation Theory, 135, pp. 145 - 159

Dinh N; Jeyakumar V; Lee GM, 2005, 'Sequential lagrangian conditions for convex programs with applications to semidefinite programming', Journal of Optimization Theory and Applications, 125, pp. 85 - 112

Jeyakumar V; Lee GM; Dinh N, 2004, 'Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex-programs', Journal of Optimization Theory and Applications, 123, pp. 83 - 103

Jeyakumar V; Yen ND, 2004, 'Solution stability of nonsmooth continuous systems with applications to cone-constrained optimization', Journal of Optimization Theory and Applications, 14, pp. 1106 - 1127

Jeyakumar V, 2003, 'Characterizing set containments involving infinite convex constraints and reverse-convex constraints', SIAM Journal on Optimization, 13, pp. 947 - 959, http://dx.doi.org/10.1137/S1052623402401944

Jeyakumar V, 2003, 'Characterizing set containments involving infinite convex constraints', SIAM Journal on Optimization, 13, pp. 947 - 959

Jeyakumar V; Lee GM; Dinh N, 2003, 'New sequential Lagrange multiplier conditions characterizing optimality without constraint qualification for convex programs', SIAM Journal on Optimization, 14, pp. 534 - 547

Jeyakumar V; Lee GM; Dinh N, 2003, 'New sequential Lagrange multiplier conditions characterizing optimality without constraint qualification for convex programs', SIAM JOURNAL ON OPTIMIZATION, 14, pp. 534 - 547, http://dx.doi.org/10.1137/S1052623402417699

Jeyakumar V; Luc DT, 2003, 'Sharp variational conditions for convex composite nonsmooth functions', SIAM Journal on Optimization, 13, pp. 904 - 920

Jeyakumar V; Luc DT, 2002, 'An open mapping theorem using unbounded generalized Jacobians', Nonlinear Analysis - Theory Methods and Applications, 50, pp. 647 - 663

Jeyakumar V; Luc DT; Tinh PN, 2002, 'Convex composite non-Lipschitz programming', Mathematical Programming, 92, pp. 177 - 195

Jeyakumar V; Luc DT, 2002, 'Convex interior mapping theorems for continuous nonsmooth functions and optimization', Journal of Nonlinear and Convex Analysis, 3, pp. 251 - 266

Fischer A; Jeyakumar V; Luc DT, 2001, 'Solution point characterizations and convergence analysis of a descent algorithm for nonsmooth continuous complementarity problems', Journal of Optimization Theory and Applications, 110, pp. 493 - 513

Back to profile page