Vaithilingam Jeyakumar - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 36 from 36

2022

The radius of robust feasibility of uncertain mathematical programs: A Survey and recent developmentsMiguel A. Goberna, Vaithilingam Jeyakumar, Guoyin Li 0001, José Vicente-Pérez. eor, 296(3):749-763, 2022. [doi]

Robust Optimization and Data Classification for Characterization of Huntington Disease Onset via Duality MethodsDaniel Woolnough, Niroshan Jeyakumar, Guoyin Li 0001, Clement T. Loy, Vaithilingam Jeyakumar. jota, 193(1):649-675, 2022. [doi]

2021

Calculating Radius of Robust Feasibility of Uncertain Linear Conic Programs via Semi-definite ProgramsMiguel A. Goberna, Vaithilingam Jeyakumar, Guoyin Li 0001. jota, 189(2):597-622, 2021. [doi]

Exact conic programming reformulations of two-stage adjustable robust linear programs with new quadratic decision rulesD. Woolnough, Vaithilingam Jeyakumar, Guoyin Li 0001. ol, 15(1):25-44, 2021. [doi]

2020

Generalized Farkas Lemma with Adjustable Variables and Two-Stage Robust Linear ProgramsThai Doan Chuong, Vaithilingam Jeyakumar. jota, 187(2):488-519, 2020. [doi]

2019

Characterizing best approximation from a convex set without convex representationVaithilingam Jeyakumar, Hossein Mohebi. jat, 239:113-127, 2019. [doi]

2018

Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxationsImmanuel M. Bomze, Vaithilingam Jeyakumar, Guoyin Li. jgo, 71(3):551-569, 2018. [doi]

Constraint qualifications for convex optimization without convexity of constraints : New connections and applications to best approximationN. H. Chieu, Vaithilingam Jeyakumar, Guoyin Li, Hossein Mohebi. eor, 265(1):19-25, 2018. [doi]

Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliersThai Doan Chuong, Vaithilingam Jeyakumar. jgo, 72(4):655-678, 2018. [doi]

Guaranteeing highly robust weakly efficient solutions for uncertain multi-objective convex programsMiguel A. Goberna, Vaithilingam Jeyakumar, Guoyin Li, José Vicente-Pérez. eor, 270(1):40-50, 2018. [doi]

Exact Second-Order Cone Programming Relaxations for Some Nonconvex Minimax Quadratic Optimization ProblemsVaithilingam Jeyakumar, Guoyin Li. siamjo, 28(1):760-787, 2018. [doi]

2017

A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problemsN. H. Chieu, Vaithilingam Jeyakumar, Guoyin Li. orl, 45(4):325-333, 2017. [doi]

Convergent conic linear programming relaxations for cone convex polynomial programsThai Doan Chuong, Vaithilingam Jeyakumar. orl, 45(3):220-226, 2017. [doi]

An Exact Formula for Radius of Robust Feasibility of Uncertain Linear ProgramsThai Doan Chuong, Vaithilingam Jeyakumar. jota, 173(1):203-226, 2017. [doi]

Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applicationsThai Doan Chuong, Vaithilingam Jeyakumar. amc, 315:381-399, 2017. [doi]

Finding Robust Global Optimal Values of Bilevel Polynomial Programs with Uncertain Linear ConstraintsThai Doan Chuong, Vaithilingam Jeyakumar. jota, 173(2):683-703, 2017. [doi]

Exact Conic Programming Relaxations for a Class of Convex Polynomial Cone ProgramsVaithilingam Jeyakumar, Guoyin Li. jota, 172(1):156-178, 2017. [doi]

2016

2010

Simultaneous classification and feature selection via convex quadratic programming with application to HIV-associated neurocognitive disorder assessmentMichelle Dunbar, John M. Murray, Lucette A. Cysique, Bruce J. Brew, Vaithilingam Jeyakumar. eor, 206(2):470-478, 2010. [doi]

2008

Unified global optimality conditions for smooth minimization problems with mixed variablesVaithilingam Jeyakumar, Sivakolundu Srisatkunarajah, Nguyen Quang Huy. rairo, 42(3):361-370, 2008. [doi]

2007

Conditions for Global Optimality of Quadratic Minimization Problems with LMI ConstraintsVaithilingam Jeyakumar, Zhiyou Wu. apjor, 24(2):149-160, 2007. [doi]

2006

Knowledge-based semidefinite linear programming classifiersVaithilingam Jeyakumar, John T. Ormerod, Robert S. Womersley. oms, 21(5):693-706, 2006. [doi]

2005

A new geometric condition for Fenchel s duality in infinite dimensional spacesRegina Sandra Burachik, Vaithilingam Jeyakumar. mp, 104(2-3):229-233, 2005. [doi]

Limiting ::::epsilon::::-subgradient characterizations of constrained best approximationVaithilingam Jeyakumar, Hossein Mohebi. jat, 135(2):145-159, 2005. [doi]

1999

Dual conditions characterizing optimality for convex multi-objective programsBevil Milton Glover, Vaithilingam Jeyakumar, Alexander M. Rubinov. mp, 84(1):201-217, 1999. [doi]

1996

Complete Characterizations of Global Optimality for Problems Involving the Pointwise Minimum of Sublinear FunctionsBevil Milton Glover, Y. Ishizuka, Vaithilingam Jeyakumar, H. D. Tuan. siamjo, 6(2):362-372, 1996. [doi]

Characterizing global optimality for DC optimization problems under convex inequality constraintsVaithilingam Jeyakumar, Bevil Milton Glover. jgo, 8(2):171-187, 1996. [doi]

1995

Nonlinear Extensions of Farkas' Lemma with Applications to Global Optimization and Least SquaresVaithilingam Jeyakumar, Bevil Milton Glover. mor, 20(4):818-837, 1995. [doi]

1994

A Farkas lemma for difference sublinear systems and quasidifferentiable programmingB. M. Glover, Vaithilingam Jeyakumar, W. Oettli. mp, 63:109-125, 1994.

1993

Convex composite multi-objective nonsmooth programmingVaithilingam Jeyakumar, Xiaoqi Yang. mp, 59:325-343, 1993.

1992

Generalizations of Slater s constraint qualification for infinite convex programsVaithilingam Jeyakumar, Henry Wolkowicz. mp, 57:85-101, 1992.

1991

Composite Nonsmooth Programming with Gâteaux DifferentiabilityVaithilingam Jeyakumar. siamjo, 1(1):30-41, 1991. [doi]

1984

Nonlinear alternative theorems and nondifferentiable programmingVaithilingam Jeyakumar. mmor, 28(5):175-187, 1984. [doi]

Sign in or sign up to see more results.

runs on WebDSL