Jeyakumar V.

V. Jeyakumar

Information about the author V. Jeyakumar will soon be added to the site.
Found 12 papers in total
A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions
A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions
2008
A strong duality which states that the optimal values of the primal convex problem and...
Global optimality of quadratic minimization over symmetric polytopes
Global optimality of quadratic minimization over symmetric polytopes
2007
In this article, we establish necessary as well as sufficient conditions for a...
Knowledge-based semidefinite linear programming classifiers
Knowledge-based semidefinite linear programming classifiers
2006
In this paper, we present knowledge-based support vector machine (SVM) classifiers...
Dual characterizations of set containments with strict convex inequalities
Dual characterizations of set containments with strict convex inequalities
2006
Characterizations of the containment of a convex set either in an arbitrary convex set...
Nonlinear extensions of Farkas' lemma with applications to global optimization and least squares
Nonlinear extensions of Farkas' lemma with applications to global optimization and least squares
1995
A nonlinear extension of Farkas' lemma for systems involving the difference of...
Convex composite non-Lipschitz programming
Convex composite non-Lipschitz programming
2002
In this paper necessary and sufficient optimality conditions are established without...
Dual conditions characterizing optimality for convex multi-objective programs
Dual conditions characterizing optimality for convex multi-objective programs
1999
Asymptotic necessary and sufficient conditions for a point to be a Pareto minimum, and...
A Farkas lemma for difference sublinear systems and quasidifferentiable programming
A Farkas lemma for difference sublinear systems and quasidifferentiable programming
1994
A new generalized Farkas theorem of the alternative is presented for systems involving...
Convex composite multi-objective nonsmooth programming
Convex composite multi-objective nonsmooth programming
1993
This paper examines nonsmooth constrained multi-objective optimization problems where...
A solvability theorem and minimax fractional programming
A solvability theorem and minimax fractional programming
1993
This paper presents a stable solvability theorem for general inequality systems under...
Generalization of Slater’s constraint qualification for infinite convex programs
Generalization of Slater’s constraint qualification for infinite convex programs
1992
where g=(g 1 ,g 2 ) and S=S 1 ×S 2 , S i are convex cones, i=1,2 C is a convex...
An expert system scheduler: Some reflections on expert systems development
An expert system scheduler: Some reflections on expert systems development
1990
In constructing an expert system, the developers (i.e. the knowledge engineers) meet...
Papers per page: