V. Jeyakumar - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 45 from 45

2015

2014

Robust Solutions of MultiObjective Linear Semi-Infinite Programs under Constraint Data UncertaintyMiguel A. Goberna, V. Jeyakumar, G. Y. Li, J. Vicente-Pérez. siamjo, 24(3):1402-1419, 2014. [doi]

Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactnessV. Jeyakumar, T. S. Pham, Guoyin Li. orl, 42(1):34-40, 2014. [doi]

Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximationsV. Jeyakumar, Guoyin Li, S. Srisatkunarajah. jgo, 58(1):31-50, 2014. [doi]

Dual Semidefinite Programs Without Duality Gaps for a Class of Convex Minimax ProgramsV. Jeyakumar, J. Vicente-Pérez. jota, 162(3):735-753, 2014. [doi]

Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimizationV. Jeyakumar, G. Y. Li. mp, 147(1-2):171-206, 2014. [doi]

On Polynomial Optimization Over Non-compact Semi-algebraic SetsV. Jeyakumar, J. B. Lasserre, G. Y. Li. jota, 163(3):707-718, 2014. [doi]

2013

Robust linear semi-infinite programming duality under uncertaintyMiguel A. Goberna, V. Jeyakumar, Guoyin Li, Marco A. López. mp, 139(1-2):185-203, 2013. [doi]

Strong duality for robust minimax fractional programming problemsV. Jeyakumar, G. Y. Li, S. Srisatkunarajah. eor, 228(2):331-336, 2013. [doi]

Robust solutions of quadratic optimization over single quadratic constraint under interval uncertaintyV. Jeyakumar, G. Y. Li. jgo, 55(2):209-226, 2013. [doi]

2012

Exact SDP relaxations for classes of nonlinear semidefinite programming problemsV. Jeyakumar, Guoyin Li. orl, 40(6):529-536, 2012. [doi]

2011

2010

Characterizing robust set containments and solutions of uncertain linear programs without qualificationsV. Jeyakumar, Guoyin Li. orl, 38(3):188-194, 2010. [doi]

New strong duality results for convex programs with separable constraintsV. Jeyakumar, Guoyin Li. eor, 207(3):1203-1209, 2010. [doi]

Strong Duality in Robust Convex Programming: Complete CharacterizationsV. Jeyakumar, G. Y. Li. siamjo, 20(6):3384-3407, 2010. [doi]

2009

2008

Complete characterizations of stable Farkas lemma and cone-convex programming dualityV. Jeyakumar, G. M. Lee. mp, 114(2):335-347, 2008. [doi]

A note on strong duality in convex semidefinite optimization: necessary and sufficient conditionsV. Jeyakumar. ol, 2(1):15-25, 2008. [doi]

Global minimization of difference of quadratic and convex functions over box or binary constraintsV. Jeyakumar, N. Q. Huy. ol, 2(2):223-238, 2008. [doi]

2007

Non-convex quadratic minimization problems with quadratic constraints: global optimality conditionsV. Jeyakumar, Alex M. Rubinov, Z. Y. Wu. mp, 110(3):521-541, 2007. [doi]

2006

2004

Solution Stability of Nonsmooth Continuous Systems with Applications to Cone-Constrained OptimizationV. Jeyakumar, N. D. Yen. siamjo, 14(4):1106-1127, 2004. [doi]

2003

Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex ConstraintsV. Jeyakumar. siamjo, 13(4):947-959, 2003. [doi]

New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex ProgramsV. Jeyakumar, G. M. Lee, N. Dinh. siamjo, 14(2):534-547, 2003. [doi]

2002

Sharp Variational Conditions for Convex Composite Nonsmooth FunctionsV. Jeyakumar, D. T. Luc. siamjo, 13(3):904-920, 2002. [doi]

Convex composite non-Lipschitz programmingV. Jeyakumar, D. T. Luc, P. N. Tinh. mp, 92(1):177-195, 2002. [doi]

2000

A Sharp Lagrange Multiplier Rule for Nonsmooth Mathematical Programming Problems Involving Equality ConstraintsX. Wang, V. Jeyakumar. siamjo, 10(4):1136-1148, 2000. [doi]

1999

Visualisation of Conceptual Descriptions Derived from Image SequencesHans-Hellmut Nagel, Michael Haag, V. Jeyakumar, Amitabha Mukerjee. dagm 1999: 364-371

1997

Hunting for a Smaller Convex SubdifferentialVladimir F. Demyanov, V. Jeyakumar. jgo, 10(3):305-326, 1997. [doi]

1993

A solvability theorem and minimax fractional programmingJ. Gwinner, V. Jeyakumar. mmor, 37(1):1-12, 1993. [doi]

1990

An expert system scheduler: Some reflections on expert systems developmentDon E. Deal, Jen-Gwo Chen, James P. Ignizio, V. Jeyakumar. cor, 17(6):571-580, 1990. [doi]

All Publications

Filter by Year
OR AND NOT 1

Filter by Type
OR AND NOT 1

Filter by Tag
OR AND NOT 1

Filter by Venue
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top Terms

[+]
OR AND NOT 1

Researchr

Publications by 'V. Jeyakumar'

Viewing Publication 1 - 45 from 45

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2004

2003

2002

2000

1999

1997

1993

1990

All Publications

Filter by YearOR AND NOT 1

Filter by TypeOR AND NOT 1

Filter by TagOR AND NOT 1

Filter by VenueOR AND NOT 1

Filter by Author [+]OR AND NOT 1

Filter by Top Terms [+]OR AND NOT 1

Researchr

Publications by 'V. Jeyakumar'

Viewing Publication 1 - 45 from 45

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2004

2003

2002

2000

1999

1997

1993

1990

Filter by Year
OR AND NOT 1

Filter by Type
OR AND NOT 1

Filter by Tag
OR AND NOT 1

Filter by Venue
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top Terms

[+]
OR AND NOT 1