( en | de | ru )

 

Disambiguation of "Jeyakumar, Vaithilingam"

Author of the publication

copydeleteadd this publication to your clipboard
Generalizations of Slater's constraint qualification for infinite convex programs.

, and . Math. Program., (1992)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Jeyakumar, Vaithilingam
add a person with the name Jeyakumar, Vaithilingam
 

Other publications of authors with the same name

Nonlinear Extensions of Farkas' Lemma with Applications to Global Optimization and Least Squares., and . Math. Oper. Res., 20 (4): 818-837 (1995)Conditions for Global Optimality of Quadratic Minimization Problems with LMI Constraints., and . Asia Pac. J. Oper. Res., 24 (2): 149-160 (2007)A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty., , and . Oper. Res. Lett., 39 (2): 109-114 (2011)Liberating the Subgradient Optimality Conditions from Constraint Qualifications., , , and . J. Glob. Optim., 36 (1): 127-137 (2006)A new geometric condition for Fenchel's duality in infinite dimensional spaces., and . Math. Program., 104 (2-3): 229-233 (2005)Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions., , and . Math. Program., 110 (3): 521-541 (2007)Convex composite multi-objective nonsmooth programming., and . Math. Program., (1993)Robust Duality for Fractional Programming Problems with Constraint-Wise Data Uncertainty., and . J. Optimization Theory and Applications, 151 (2): 292-303 (2011)Simultaneous classification and feature selection via convex quadratic programming with application to HIV-associated neurocognitive disorder assessment., , , , and . Eur. J. Oper. Res., 206 (2): 470-478 (2010)Global minimization of difference of quadratic and convex functions over box or binary constraints., and . Optim. Lett., 2 (2): 223-238 (2008)