V
Vaithilingam Jeyakumar
Researcher at University of New South Wales
Publications - 179
Citations - 5105
Vaithilingam Jeyakumar is an academic researcher from University of New South Wales. The author has contributed to research in topics: Convex analysis & Convex optimization. The author has an hindex of 39, co-authored 176 publications receiving 4671 citations. Previous affiliations of Vaithilingam Jeyakumar include University of Kentucky & University of Mannheim.
Papers
More filters
Journal ArticleDOI
A generalization of a minimax theorem of Fan via a theorem of the alternative
TL;DR: In this paper, a modified version of Fan's minimax theorem with weakened convexity is presented, and the main result is obtained with the use of a generalized Gordan theorem, which is proved using a separation theorem.
Journal ArticleDOI
Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
TL;DR: In this paper, dual characterizations of the containment of a closed convex set, defined by infinite convex constraints, in an arbitrary polyhedral set, in a reverse-convex set defined by convex constraint, and in another convex subset defined by finite constraint are given.
Journal ArticleDOI
Convexlike alternative theorems and mathematical programming
TL;DR: In this paper, alternative theorems for convex-like functions are presented and applied to obtain global and local optimality conditions for constrained minimization problems, where the objective function is to minimize a convex function.
Journal ArticleDOI
A new geometric condition for Fenchel's duality in infinite dimensional spaces
TL;DR: A necessary and sufficient condition is established for the ε-subdifferential sum formula in terms of the sum of the epigraphs of conjugate functions in Fenchel's duality by presenting a simple geometric condition.
Journal ArticleDOI
Convex composite multi-objective nonsmooth programming
TL;DR: This paper examines nonsmooth constrained multi-objective optimization problems where the objective function and the constraints are compositions of convex functions, and locally Lipschitz and Gâteaux differentiable functions.