Articles with public access mandates - Vaithilingam (Jeya) JeyakumarLearn more
Not available anywhere: 20
Support vector machine classifiers with uncertain knowledge sets via robust optimization
V Jeyakumar, G Li, S Suthaharan
Optimization 63 (7), 1099-1116, 2014
Mandates: Australian Research Council
Strong duality for robust minimax fractional programming problems
V Jeyakumar, GY Li, S Srisatkunarajah
European journal of operational research 228 (2), 331-336, 2013
Mandates: Australian Research Council
Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation
NH Chieu, V Jeyakumar, G Li, H Mohebi
European Journal of Operational Research 265 (1), 19-25, 2018
Mandates: Australian Research Council
An exact formula for radius of robust feasibility of uncertain linear programs
TD Chuong, V Jeyakumar
Journal of Optimization Theory and Applications 173, 203-226, 2017
Mandates: Australian Research Council
Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty
V Jeyakumar, GY Li
Journal of Global Optimization 55, 209-226, 2013
Mandates: Australian Research Council
A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs
TD Chuong, V Jeyakumar, G Li
Journal of Global Optimization 75 (4), 885-919, 2019
Mandates: Australian Research Council
Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications
TD Chuong, V Jeyakumar
Applied Mathematics and Computation 315, 381-399, 2017
Mandates: Australian Research Council
Convergent conic linear programming relaxations for cone convex polynomial programs
TD Chuong, V Jeyakumar
Operations Research Letters 45 (3), 220-226, 2017
Mandates: Australian Research Council
Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets
V Jeyakumar, S Kim, GM Lee, G Li
Journal of Global Optimization 65 (2), 175-190, 2016
Mandates: Australian Research Council
Exact dual semi-definite programs for affinely adjustable robust SOS-convex polynomial optimization problems
TD Chuong, V Jeyakumar, G Li, D Woolnough
Optimization 71 (12), 3539-3569, 2022
Mandates: Australian Research Council
Generalized farkas lemma with adjustable variables and two-stage robust linear programs
TD Chuong, V Jeyakumar
Journal of Optimization Theory and Applications 187, 488-519, 2020
Mandates: Australian Research Council
Finding robust global optimal values of bilevel polynomial programs with uncertain linear constraints
TD Chuong, V Jeyakumar
Journal of Optimization Theory and Applications 173, 683-703, 2017
Mandates: Australian Research Council
Generalized Farkas’ lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization
V Jeyakumar, GM Lee, NTH Linh
Journal of Global Optimization 64, 679-702, 2016
Mandates: Australian Research Council
Adjustable robust multiobjective linear optimization: Pareto optimal solutions via conic programming
TD Chuong, V Jeyakumar
Annals of Operations Research, 1-22, 2022
Mandates: Australian Research Council
A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs
V Jeyakumar, G Li
Operations Research Letters 43 (4), 405-410, 2015
Mandates: Australian Research Council
Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers
TD Chuong, V Jeyakumar
Journal of Global Optimization 72 (4), 655-678, 2018
Mandates: Australian Research Council
Sum-of-squares relaxations in robust DC optimization and feature selection
V Jeyakumar, GM Lee, JH Lee, Y Huang
Journal of Optimization Theory and Applications 200 (1), 308-343, 2024
Mandates: Australian Research Council
Exact SDP reformulations of adjustable robust linear programs with box uncertainties under separable quadratic decision rules via SOS representations of non-negativity
TD Chuong, V Jeyakumar, G Li, D Woolnough
Journal of Global Optimization 81, 1095-1117, 2021
Mandates: Australian Research Council
A copositive Farkas lemma and minimally exact conic relaxations for robust quadratic optimization with binary and quadratic constraints
NH Chieu, TD Chuong, V Jeyakumar, G Li
Operations Research Letters 47 (6), 530-536, 2019
Mandates: Australian Research Council
A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems
NH Chieu, V Jeyakumar, G Li
Operations Research Letters 45 (4), 325-333, 2017
Mandates: Australian Research Council
Publication and funding information is determined automatically by a computer program