| On generalised convex mathematical programming V Jeyakumar, B Mond The Anziam Journal 34 (1), 43-53, 1992 | 377 | 1992 |
| Strong and weak invexity in mathematical programming V Jeyakumar University of Melbourne, Department of Mathematics, 1984 | 226 | 1984 |
| A class of nonconvex functions and mathematical programming T Weir, V Jeyakumar Bulletin of the Australian Mathematical Society 38 (2), 177-189, 1988 | 219 | 1988 |
| Nonsmooth calculus, minimality, and monotonicity of convexificators V Jeyakumar, DT Luc Journal of Optimization Theory and Applications 101, 599-621, 1999 | 198 | 1999 |
| New sequential Lagrange multiplier conditions characterizing optimality without constraint qualification for convex programs V Jeyakumar, GM Lee, N Dinh SIAM Journal on Optimization 14 (2), 534-547, 2003 | 175 | 2003 |
| Approximate Jacobian Matrices for Nonsmooth Continuous Maps and C1-Optimization V Jeyakumar, DT Luc SIAM Journal on Control and Optimization 36 (5), 1815-1832, 1998 | 169 | 1998 |
| Strong duality in robust convex programming: complete characterizations V Jeyakumar, GY Li SIAM Journal on optimization 20 (6), 3384-3407, 2010 | 164 | 2010 |
| A dual condition for the convex subdifferential sum formula with applications RS Burachik, V Jeyakumar Journal of Convex Analysis 12 (2), 279, 2005 | 143 | 2005 |
| Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions V Jeyakumar, AM Rubinov, ZY Wu Mathematical programming 110, 521-541, 2007 | 134 | 2007 |
| A solvability theorem for a class of quasiconvex mappings with applications to optimization V Jeyakumar, W Oettli, M Natividad Journal of Mathematical Analysis and Applications 179 (2), 537-546, 1993 | 128 | 1993 |
| Generalizations of Slater's constraint qualification for infinite convex programs V Jeyakumar, H Wolkowicz Mathematical Programming 57, 85-101, 1992 | 126 | 1992 |
| Nonsmooth vector functions and continuous optimization V Jeyakumar Springer Science & Business Media, 2007 | 121 | 2007 |
| Hunting for a smaller convex subdifferential VF Demyanov, V Jeyakumar Journal of Global Optimization 10, 305-326, 1997 | 118 | 1997 |
| A generalization of a minimax theorem of Fan via a theorem of the alternative V Jeyakumar Journal of Optimization Theory and Applications 48, 525-533, 1986 | 118 | 1986 |
| Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization V Jeyakumar, GY Li Mathematical Programming 147, 171-206, 2014 | 116 | 2014 |
| Convexlike alternative theorems and mathematical programming V Jeyakumar Optimization 16 (5), 643-652, 1985 | 116 | 1985 |
| A new closed cone constraint qualification for convex optimization V Jeyakumar, N Dinh, GM Lee Applied Mathematics Report AMR 4 (8), 2004 | 108 | 2004 |
| Convex composite multi-objective nonsmooth programming V Jeyakumar, XQ Yang Mathematical programming 59 (1), 325-343, 1993 | 106 | 1993 |
| Robust solutions to multi-objective linear programs with uncertain data MA Goberna, V Jeyakumar, G Li, J Vicente-Pérez European Journal of Operational Research 242 (3), 730-743, 2015 | 105 | 2015 |
| On characterizing the solution sets of pseudolinear programs V Jeyakumar, XQ Yang Journal of Optimization Theory and Applications 87 (3), 747-755, 1995 | 101 | 1995 |
Guoyin LiProfessor, School of Mathematics and Statistics, University of New South WalesVerified email at unsw.edu.au
