V. Jeyakumar

发表

Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality

N. H. Chieu, V. Jeyakumar, G. Li, 2020, Eur. J. Oper. Res..

The radius of robust feasibility of uncertain mathematical programs: A Survey and recent developments

V. Jeyakumar, M.A. Goberna, G. Li, 2021, Eur. J. Oper. Res..

Exact SDP reformulations of adjustable robust linear programs with box uncertainties under separable quadratic decision rules via SOS representations of non-negativity

V. Jeyakumar, T. D. Chuong, G. Li, 2021, Journal of Global Optimization.

Solution Point Characterizations and Convergence Analysis of a Descent Algorithm for Nonsmooth Continuous Complementarity Problems

V. Jeyakumar, A. Fischer, D. T. Luc, 2001 .

Complete Dual Characterizations of Optimality and Feasibility for Convex Semidefinite Programming 1

V. Jeyakumar, M. Nealon, 1999 .

Qualification-Free Optimality Conditions for Convex Programs with Separable Inequality Constraints∗

V. Jeyakumar, G. Y. Li, 2009 .

Farkas Lemma: Generalizations

V. Jeyakumar, V. Jeyakumar, 2009, Encyclopedia of Optimization.

A Dual Condition for the Convex Subdifferential Sum Formula with Applications

V. Jeyakumar, V. Jeyakumar, 2022 .

A Qualification Free Sequential Pshenichnyi-Rockafellar Lemma and Convex Semidefinite Programming∗

V. Jeyakumar, Z. Y. Wu, 2006 .

Approximate Jacobian Matrices for Nonsmooth Continuous Maps and C 1 -Optimization

V. Jeyakumar, D. T. Luc, D. Luc, 1998 .