Vaithilingam Jeyakumar

According to our database1, Vaithilingam Jeyakumar authored at least 80 papers between 1984 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Generalized Farkas Lemma with Adjustable Variables and Two-Stage Robust Linear Programs.
J. Optim. Theory Appl., 2020

Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality.
Eur. J. Oper. Res., 2020

2019
A copositive Farkas lemma and minimally exact conic relaxations for robust quadratic optimization with binary and quadratic constraints.
Oper. Res. Lett., 2019

A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs.
J. Glob. Optim., 2019

Characterizing best approximation from a convex set without convex representation.
J. Approx. Theory, 2019

2018
Exact Second-Order Cone Programming Relaxations for Some Nonconvex Minimax Quadratic Optimization Problems.
SIAM J. Optim., 2018

Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers.
J. Glob. Optim., 2018

Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations.
J. Glob. Optim., 2018

Guaranteeing highly robust weakly efficient solutions for uncertain multi-objective convex programs.
Eur. J. Oper. Res., 2018

Constraint qualifications for convex optimization without convexity of constraints : New connections and applications to best approximation.
Eur. J. Oper. Res., 2018

2017
Convergent conic linear programming relaxations for cone convex polynomial programs.
Oper. Res. Lett., 2017

A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems.
Oper. Res. Lett., 2017

Exact Conic Programming Relaxations for a Class of Convex Polynomial Cone Programs.
J. Optim. Theory Appl., 2017

Finding Robust Global Optimal Values of Bilevel Polynomial Programs with Uncertain Linear Constraints.
J. Optim. Theory Appl., 2017

An Exact Formula for Radius of Robust Feasibility of Uncertain Linear Programs.
J. Optim. Theory Appl., 2017

Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications.
Appl. Math. Comput., 2017

2016
Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems.
SIAM J. Optim., 2016

Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints.
Oper. Res. Lett., 2016

Generalized Farkas' lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization.
J. Glob. Optim., 2016

Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets.
J. Glob. Optim., 2016

2015
A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs.
Oper. Res. Lett., 2015

Robust SOS-convex polynomial optimization problems: exact SDP relaxations.
Optim. Lett., 2015

Characterizing Robust Solution Sets of Convex Programs under Data Uncertainty.
J. Optim. Theory Appl., 2015

Robust solutions to multi-objective linear programs with uncertain data.
Eur. J. Oper. Res., 2015

2014
Robust Solutions of MultiObjective Linear Semi-Infinite Programs under Constraint Data Uncertainty.
SIAM J. Optim., 2014

Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness.
Oper. Res. Lett., 2014

Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization.
Math. Program., 2014

Dual Semidefinite Programs Without Duality Gaps for a Class of Convex Minimax Programs.
J. Optim. Theory Appl., 2014

On Polynomial Optimization Over Non-compact Semi-algebraic Sets.
J. Optim. Theory Appl., 2014

Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations.
J. Glob. Optim., 2014

2013
Robust linear semi-infinite programming duality under uncertainty.
Math. Program., 2013

Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty.
J. Glob. Optim., 2013

Strong duality for robust minimax fractional programming problems.
Eur. J. Oper. Res., 2013

2012
Exact SDP relaxations for classes of nonlinear semidefinite programming problems.
Oper. Res. Lett., 2012

2011
A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty.
Oper. Res. Lett., 2011

Necessary global optimality conditions for nonlinear programming problems with polynomial constraints.
Math. Program., 2011

Robust Duality for Fractional Programming Problems with Constraint-Wise Data Uncertainty.
J. Optim. Theory Appl., 2011

Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems.
J. Glob. Optim., 2011

2010
Strong Duality in Robust Convex Programming: Complete Characterizations.
SIAM J. Optim., 2010

Characterizing robust set containments and solutions of uncertain linear programs without qualifications.
Oper. Res. Lett., 2010

New strong duality results for convex programs with separable constraints.
Eur. J. Oper. Res., 2010

Simultaneous classification and feature selection via convex quadratic programming with application to HIV-associated neurocognitive disorder assessment.
Eur. J. Oper. Res., 2010

2009
Farkas Lemma: Generalizations.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Composite Nonsmooth Optimization.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization.
SIAM J. Optim., 2009

Lagrange multiplier necessary conditions for global optimality for non-convex minimization over a quadratic constraint via S-lemma.
Optim. Lett., 2009

Farkas' lemma for separable sublinear inequalities without qualifications.
Optim. Lett., 2009

Geometric conditions for Kuhn-Tucker sufficiency of global optimality in mathematical programming.
Eur. J. Oper. Res., 2009

A note on sufficient global optimality conditions for fixed charge quadratic programs.
Appl. Math. Lett., 2009

2008
Unified global optimality conditions for smooth minimization problems with mixed variables.
RAIRO Oper. Res., 2008

Global minimization of difference of quadratic and convex functions over box or binary constraints.
Optim. Lett., 2008

A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions.
Optim. Lett., 2008

Complete characterizations of stable Farkas' lemma and cone-convex programming duality.
Math. Program., 2008

2007
Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions.
Math. Program., 2007

Conditions for Global Optimality of Quadratic Minimization Problems with LMI Constraints.
Asia Pac. J. Oper. Res., 2007

2006
Knowledge-based semidefinite linear programming classifiers.
Optim. Methods Softw., 2006

The strong conical hull intersection property for convex programming.
Math. Program., 2006

Liberating the Subgradient Optimality Conditions from Constraint Qualifications.
J. Glob. Optim., 2006

Sufficient Global Optimality Conditions for Non-convex Quadratic Minimization Problems With Box Constraints.
J. Glob. Optim., 2006

Dual Characterizations of Set Containments with Strict Convex Inequalities.
J. Glob. Optim., 2006

Characterizations of solution sets of convex vector minimization problems.
Eur. J. Oper. Res., 2006

2005
A new geometric condition for Fenchel's duality in infinite dimensional spaces.
Math. Program., 2005

Limiting <i>epsilon</i>-subgradient characterizations of constrained best approximation.
J. Approx. Theory, 2005

2004
Solution Stability of Nonsmooth Continuous Systems with Applications to Cone-Constrained Optimization.
SIAM J. Optim., 2004

2003
New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs.
SIAM J. Optim., 2003

Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints.
SIAM J. Optim., 2003

2002
Sharp Variational Conditions for Convex Composite Nonsmooth Functions.
SIAM J. Optim., 2002

Convex composite non-Lipschitz programming.
Math. Program., 2002

2000
A Sharp Lagrange Multiplier Rule for Nonsmooth Mathematical Programming Problems Involving Equality Constraints.
SIAM J. Optim., 2000

1999
Dual conditions characterizing optimality for convex multi-objective programs.
Math. Program., 1999

1997
Hunting for a Smaller Convex Subdifferential.
J. Glob. Optim., 1997

1996
Complete Characterizations of Global Optimality for Problems Involving the Pointwise Minimum of Sublinear Functions.
SIAM J. Optim., 1996

Characterizing global optimality for DC optimization problems under convex inequality constraints.
J. Glob. Optim., 1996

1995
Nonlinear Extensions of Farkas' Lemma with Applications to Global Optimization and Least Squares.
Math. Oper. Res., 1995

1994
A Farkas lemma for difference sublinear systems and quasidifferentiable programming.
Math. Program., 1994

1993
Convex composite multi-objective nonsmooth programming.
Math. Program., 1993

A solvability theorem and minimax fractional programming.
ZOR Methods Model. Oper. Res., 1993

1992
Generalizations of Slater's constraint qualification for infinite convex programs.
Math. Program., 1992

1991
Composite Nonsmooth Programming with Gâteaux Differentiability.
SIAM J. Optim., 1991

1984
Nonlinear alternative theorems and nondifferentiable programming.
Z. Oper. Research, 1984


  Loading...