Jeyakumar V

V Jeyakumar

Information about the author V Jeyakumar will soon be added to the site.
Found 5 papers in total
Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets
Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets
2016
We propose a hierarchy of semidefinite programming (SDP) relaxations for polynomial...
A robust von Neumann minimax theorem for zero‐sum games under bounded payoff uncertainty
A robust von Neumann minimax theorem for zero‐sum games under bounded payoff uncertainty
2011
The celebrated von Neumann minimax theorem is a fundamental theorem in...
Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty
Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty
2013
In this paper we examine non‐convex quadratic optimization problems over a...
Exact SDP relaxations for classes of nonlinear semidefinite programming problems
Exact SDP relaxations for classes of nonlinear semidefinite programming problems
2012
This paper addresses the issue of which nonlinear semidefinite linear programming...
Robust Duality for Fractional Programming Problems with Constraint‐Wise Data Uncertainty
Robust Duality for Fractional Programming Problems with Constraint‐Wise Data Uncertainty
2011
In this paper, we examine duality for fractional programming problems in the face of...
Papers per page: