Search results for "V. Jeyakumar"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	V. Jeyakumar, G. Y. Li, G. M. Lee	A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty.	Oper. Res. Lett.	2011	DBLP DOI BibTeX RDF
1	V. Jeyakumar, Guoyin Li	Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems.	J. Global Optimization	2011	DBLP DOI BibTeX RDF
1	V. Jeyakumar, G. Y. Li	Robust Duality for Fractional Programming Problems with Constraint-Wise Data Uncertainty.	J. Optimization Theory and Applications	2011	DBLP DOI BibTeX RDF
1	V. Jeyakumar, G. Y. Li	Necessary global optimality conditions for nonlinear programming problems with polynomial constraints.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	K. Sundaravadivu, V. Jeyakumar, K. Saravanan	Design of Fractional Order PI controller for liquid level control of spherical tank modeled as Fractional Order System.	ICCSCE	2011	DBLP DOI BibTeX RDF
1	V. Jeyakumar, Guoyin Li	Characterizing robust set containments and solutions of uncertain linear programs without qualifications.	Oper. Res. Lett.	2010	DBLP DOI BibTeX RDF
1	V. Jeyakumar, G. Y. Li	Strong Duality in Robust Convex Programming: Complete Characterizations.	SIAM Journal on Optimization	2010	DBLP DOI BibTeX RDF
1	V. Jeyakumar, Guoyin Li	New strong duality results for convex programs with separable constraints.	European Journal of Operational Research	2010	DBLP DOI BibTeX RDF
1	V. Jeyakumar, G. M. Lee, Guoyin Li	Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization.	SIAM Journal on Optimization	2009	DBLP DOI BibTeX RDF
1	V. Jeyakumar, S. Srisatkunarajah	Lagrange multiplier necessary conditions for global optimality for non-convex minimization over a quadratic constraint via S-lemma.	Optimization Letters	2009	DBLP DOI BibTeX RDF	Smooth non-convex minimization, Difference of quadratic and convex functions, Single quadratic constraint, Global optimality, Lagrange multipliers, Fractional programs
1	V. Jeyakumar, Guoyin Li	Farkas' lemma for separable sublinear inequalities without qualifications.	Optimization Letters	2009	DBLP DOI BibTeX RDF	Generalized Farkas’ lemma, Separable sublinear inequalities, Robust linear programming, Duality, Optimality conditions
1	V. Jeyakumar, S. Srisatkunarajah	Geometric conditions for Kuhn-Tucker sufficiency of global optimality in mathematical programming.	European Journal of Operational Research	2009	DBLP DOI BibTeX RDF
1	V. Jeyakumar, S. Srisatkunarajah	A note on sufficient global optimality conditions for fixed charge quadratic programs.	Appl. Math. Lett.	2009	DBLP DOI BibTeX RDF
1	V. Jeyakumar	Composite Nonsmooth Optimization.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Convex composite programming, Optimality conditions, Nonsmooth optimization, Nonsmooth analysis, Vector optimization
1	V. Jeyakumar	Farkas Lemma: Generalizations.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	?-subdifferential, D.c. function, Convex inequality systems, Convex-like systems, Alternative theorem, Global optimization, Semidefinite programming, Nonsmooth optimization, Inequality systems
1	V. Jeyakumar	A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions.	Optimization Letters	2008	DBLP DOI BibTeX RDF	Semidefinite optimization, Strong duality, Convex programming, Constraint qualifications
1	V. Jeyakumar, N. Q. Huy	Global minimization of difference of quadratic and convex functions over box or binary constraints.	Optimization Letters	2008	DBLP DOI BibTeX RDF	Quadratic non-convex minimization, Box constraints, 0/1 Constraints, Sufficient conditions, Necessary optimality conditions, Concave minimization
1	V. Jeyakumar, G. M. Lee	Complete characterizations of stable Farkas' lemma and cone-convex programming duality.	Math. Program.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 41A65, 90C30, 41A29
1	V. Jeyakumar, Alex M. Rubinov, Z. Y. Wu	Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions.	Math. Program.	2007	DBLP DOI BibTeX RDF	AMS Subject Classification 41A65, 90C30, 41A29
1	V. Jeyakumar, G. M. Lee, N. Dinh	Characterizations of solution sets of convex vector minimization problems.	European Journal of Operational Research	2006	DBLP DOI BibTeX RDF
1	V. Jeyakumar	The strong conical hull intersection property for convex programming.	Math. Program.	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classification 41A65, 90C30, 41A29
1	V. Jeyakumar, N. D. Yen	Solution Stability of Nonsmooth Continuous Systems with Applications to Cone-Constrained Optimization.	SIAM Journal on Optimization	2004	DBLP DOI BibTeX RDF
1	V. Jeyakumar, G. M. Lee, N. Dinh	New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs.	SIAM Journal on Optimization	2003	DBLP DOI BibTeX RDF
1	V. Jeyakumar	Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints.	SIAM Journal on Optimization	2003	DBLP DOI BibTeX RDF
1	V. Jeyakumar, D. T. Luc	Sharp Variational Conditions for Convex Composite Nonsmooth Functions.	SIAM Journal on Optimization	2002	DBLP DOI BibTeX RDF
1	V. Jeyakumar, D. T. Luc, P. N. Tinh	Convex composite non-Lipschitz programming.	Math. Program.	2002	DBLP DOI BibTeX RDF
1	X. Wang, V. Jeyakumar	A Sharp Lagrange Multiplier Rule for Nonsmooth Mathematical Programming Problems Involving Equality Constraints.	SIAM Journal on Optimization	2000	DBLP DOI BibTeX RDF
1	Hans-Hellmut Nagel, Michael Haag, V. Jeyakumar, Amitabha Mukerjee	Visualisation of Conceptual Descriptions Derived from Image Sequences.	DAGM-Symposium	1999	DBLP BibTeX RDF
1	Don E. Deal, Jen-Gwo Chen, James P. Ignizio, V. Jeyakumar	An expert system scheduler: Some reflections on expert systems development.	Computers & OR	1990	DBLP DOI BibTeX RDF

Publications of "V. Jeyakumar" ( http://dblp.L3S.de/Authors/V._Jeyakumar )