Vaithilingam Jeyakumar

From MaRDI portal
Person:425802

Available identifiers

zbMath Open jeyakumar.vaithilingamMaRDI QIDQ425802

List of research outcomes

PublicationDate of PublicationType
Sum-of-squares relaxations in robust DC optimization and feature selection2024-01-25Paper
Quadratically adjustable robust linear optimization with inexact data via generalized S-lemma: exact second-order cone program reformulations2023-07-12Paper
Sums of squares polynomial program reformulations for adjustable robust linear optimization problems with separable polynomial decision rules2023-01-05Paper
Exact dual semi-definite programs for affinely adjustable robust SOS-convex polynomial optimization problems2022-11-04Paper
Robust optimization and data classification for characterization of Huntington disease onset via duality methods2022-05-17Paper
Exact SDP reformulations of adjustable robust linear programs with box uncertainties under separable quadratic decision rules via SOS representations of non-negativity2021-11-26Paper
The radius of robust feasibility of uncertain mathematical programs: a survey and recent developments2021-11-09Paper
Calculating radius of robust feasibility of uncertain linear conic programs via semi-definite programs2021-06-15Paper
Generalized Farkas lemma with adjustable variables and two-stage robust linear programs2021-05-11Paper
Exact conic programming reformulations of two-stage adjustable robust linear programs with new quadratic decision rules2021-02-26Paper
A copositive Farkas lemma and minimally exact conic relaxations for robust quadratic optimization with binary and quadratic constraints2020-02-10Paper
A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs2019-12-03Paper
Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality2019-09-18Paper
Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications2019-04-29Paper
Convergent conic linear programming relaxations for cone convex polynomial programs2019-02-22Paper
A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems2019-02-22Paper
Characterizing best approximation from a convex set without convex representation2019-02-07Paper
Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers2018-12-27Paper
https://portal.mardi4nfdi.de/entity/Q45579332018-11-27Paper
A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs2018-09-28Paper
Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness2018-08-27Paper
Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations2018-07-18Paper
Guaranteeing highly robust weakly efficient solutions for uncertain multi-objective convex programs2018-05-31Paper
Exact Second-Order Cone Programming Relaxations for Some Nonconvex Minimax Quadratic Optimization Problems2018-04-03Paper
Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation2017-11-23Paper
A Bounded Degree Lasserre Hierarchy with SOCP Relaxations for Global Polynomial Optimization and Applications2017-10-18Paper
An exact formula for radius of robust feasibility of uncertain linear programs2017-09-01Paper
Finding robust global optimal values of bilevel polynomial programs with uncertain linear constraints2017-07-20Paper
Exact conic programming relaxations for a class of convex polynomial cone programs2017-02-23Paper
A generalized Farkas lemma with a numerical certificate and linear semi-infinite programs with SDP duals2016-12-29Paper
Robust solutions to multi-objective linear programs with uncertain data2016-07-26Paper
Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets2016-05-25Paper
Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems2016-03-30Paper
https://portal.mardi4nfdi.de/entity/Q27891572016-02-26Paper
https://portal.mardi4nfdi.de/entity/Q27892322016-02-26Paper
Robust global error bounds for uncertain linear inequality systems with applications2016-01-28Paper
Robust Global Solutions of Bilevel Polynomial Optimization Problems with Uncertain Linear Constraints2016-01-24Paper
Characterizing robust local error bounds for linear inequality systems under data uncertainty2015-11-17Paper
Robust duality in parametric convex optimization2015-08-24Paper
Strong duality for robust minimax fractional programming problems2015-07-28Paper
Characterizing robust solution sets of convex programs under data uncertainty2015-03-11Paper
Robust SOS-convex polynomial optimization problems: exact SDP relaxations2015-02-23Paper
A new class of alternative theorems for SOS-convex inequalities and robust optimization2015-02-20Paper
On polynomial optimization over non-compact semi-algebraic sets2014-12-12Paper
Robust Solutions of MultiObjective Linear Semi-Infinite Programs under Constraint Data Uncertainty2014-12-12Paper
Dual semidefinite programs without duality gaps for a class of convex minimax programs2014-10-23Paper
Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization2014-10-17Paper
Support vector machine classifiers with uncertain knowledge sets via robust optimization2014-08-05Paper
Strong duality in robust semi-definite linear programming under data uncertainty2014-07-10Paper
Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations2014-04-01Paper
Necessary and sufficient conditions for \(S\)-lemma and~nonconvex quadratic optimization2013-10-24Paper
https://portal.mardi4nfdi.de/entity/Q28410722013-07-24Paper
Robust linear semi-infinite programming duality under uncertainty2013-07-12Paper
Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty2013-03-11Paper
Exact SDP relaxations for classes of nonlinear semidefinite programming problems2013-03-05Paper
Robust best approximation with interpolation constraints under ellipsoidal uncertainty: strong duality and nonsmooth Newton methods2013-03-04Paper
Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty2012-07-04Paper
New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs2012-06-09Paper
Robust duality for fractional programming problems with constraint-wise data uncertainty2012-01-12Paper
Robust duality for generalized convex programming problems under data uncertainty2011-12-21Paper
A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty2011-08-09Paper
Robust Farkas' lemma for uncertain linear systems with applications2011-06-28Paper
Global Optimality Conditions for Classes of Non-convex Multi-objective Quadratic Optimization Problems2011-04-20Paper
Strong Duality in Robust Convex Programming: Complete Characterizations2011-03-21Paper
Robust conjugate duality for convex optimization under uncertainty with application to data classification2011-03-14Paper
Necessary global optimality conditions for nonlinear programming problems with polynomial constraints2011-02-14Paper
Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems2011-01-19Paper
New strong duality results for convex programs with separable constraints2010-12-20Paper
Constraint qualifications characterizing Lagrangian duality in convex optimization2010-09-22Paper
Stability, stabilization and duality for linear time-varying systems2010-07-26Paper
Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions2010-07-21Paper
Simultaneous classification and feature selection via convex quadratic programming with application to HIV-associated neurocognitive disorder assessment2010-06-11Paper
Characterizing robust set containments and solutions of uncertain linear programs without qualifications2010-06-08Paper
Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization2010-06-01Paper
https://portal.mardi4nfdi.de/entity/Q35630232010-05-28Paper
Global optimality conditions for nonlinear programming problems with bounds via quadratic underestimators2010-04-21Paper
A note on sufficient global optimality conditions for fixed charge quadratic programs2010-01-29Paper
https://portal.mardi4nfdi.de/entity/Q58520662010-01-26Paper
Farkas' lemma for separable sublinear inequalities without qualifications2009-10-15Paper
Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs2009-09-10Paper
https://portal.mardi4nfdi.de/entity/Q36324632009-06-11Paper
New Kuhn-Tucker sufficiency for global optimality via convexification2009-06-09Paper
New sufficiency for global optimality and duality of mathematical programming problems via underestimators2009-05-05Paper
Geometric conditions for Kuhn-Tucker sufficiency of global optimality in mathematical programming2009-02-23Paper
Lagrange multiplier necessary conditions for global optimality for non-convex minimization over a quadratic constraint via S-lemma2009-02-17Paper
Unified global optimality conditions for smooth minimization problems with mixed variables2009-01-29Paper
Generalized Fenchel's conjugation formulas and duality for abstract convex functions2008-09-23Paper
Global minimization of difference of quadratic and convex functions over box or binary constraints2008-06-11Paper
Complete characterizations of stable Farkas' lemma and cone-convex programming duality2008-06-04Paper
Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities2008-03-06Paper
Sufficient conditions for global optimality of bivalent nonconvex quadratic programs with inequality constraints2008-02-18Paper
A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions2008-01-04Paper
Nonsmooth vector functions and continuous optimization2007-12-19Paper
A dual criterion for maximal monotonicity of composition operators2007-11-19Paper
Global optimality of quadratic minimization over symmetric polytopes2007-11-16Paper
Kuhn-Tucker sufficiency for global minimum of multi-extremal mathematical programming problems2007-08-20Paper
CONDITIONS FOR GLOBAL OPTIMALITY OF QUADRATIC MINIMIZATION PROBLEMS WITH LMI CONSTRAINTS2007-05-21Paper
Sufficient global optimality conditions for multi-extremal smooth minimisation problems with bounds and linear matrix inequality constraints2007-03-20Paper
https://portal.mardi4nfdi.de/entity/Q34225022007-02-13Paper
https://portal.mardi4nfdi.de/entity/Q34120682006-12-05Paper
Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints2006-10-31Paper
https://portal.mardi4nfdi.de/entity/Q54800772006-07-25Paper
Necessary and sufficient conditions for stable conjugate duality2006-06-09Paper
The strong conical hull intersection property for convex programming2006-05-02Paper
A new geometric condition for Fenchel's duality in infinite dimensional spaces2005-12-14Paper
Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation2005-09-22Paper
A Global Approach to Nonlinearly Constrained Best Approximation2005-07-27Paper
A simple closure condition for the normal cone intersection formula2005-03-01Paper
Solution Stability of Nonsmooth Continuous Systems with Applications to Cone-Constrained Optimization2005-02-23Paper
Sharp Variational Conditions for Convex Composite Nonsmooth Functions2004-01-19Paper
Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints2004-01-19Paper
An open mapping theorem using unbounded generalized Jacobians2002-08-25Paper
Convex composite non-Lipschitz programming2002-06-12Paper
https://portal.mardi4nfdi.de/entity/Q48018212002-01-01Paper
https://portal.mardi4nfdi.de/entity/Q45245222001-07-03Paper
Approximate Hessian matrices and second-order optimality conditions for nonlinear programming problems with C1-data2001-02-09Paper
Solution point characterizations and convergence analysis of a descent algorithm for nonsmooth continuous complementarity problems.2001-01-01Paper
A Sharp Lagrange Multiplier Rule for Nonsmooth Mathematical Programming Problems Involving Equality Constraints2000-10-19Paper
Approximate generalized Hessians and Taylor’s expansions for continuously Gâteaux differentiable functions2000-02-14Paper
Nonsmooth calculus, minimality, and monotonicity of convexificators1999-09-12Paper
https://portal.mardi4nfdi.de/entity/Q42162431999-04-28Paper
Approximate Jacobian Matrices for Nonsmooth Continuous Maps and C1-Optimization1998-09-21Paper
First and second-order optimality conditions for convex composite multiobjective optimization1998-06-22Paper
Asymptotic dual conditions characterizing optimality for infinite convex programs1998-03-05Paper
Hunting for a smaller convex subdifferential1997-10-05Paper
Asymptotic conditions for weak and proper optimality in infinite dimensional convex vector optimization1997-03-23Paper
Convex composite minimization with \(C^{1,1}\) functions1996-05-30Paper
A generalized mean-value theorem and optimality conditions in composite nonsmooth minimization1996-02-13Paper
On characterizing the solution sets of pseudolinear programs1996-01-07Paper
Generalized second-order directional derivatives and optimization with C1,1 functions1995-06-18Paper
A Nonnegativity Criterion for Biconvex Functions1995-04-02Paper
Infinite-dimensional convex programming with applications to constrained approximation1994-10-30Paper
A solvability theorem for a class of quasiconvex mappings with applications to optimization1994-05-09Paper
Convex composite multi-objective nonsmooth programming1993-12-20Paper
A solvability theorem and minimax fractional programming1993-05-03Paper
Composite Nonsmooth Programming with Gâteaux Differentiability1993-01-16Paper
On generalised convex mathematical programming1993-01-16Paper
Generalizations of Slater's constraint qualification for infinite convex programs1993-01-16Paper
https://portal.mardi4nfdi.de/entity/Q39760801992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39767831992-06-26Paper
Inequality systems and optimization1991-01-01Paper
Duality and infinite dimensional optimization1990-01-01Paper
Zero duality gaps in infinite-dimensional programming1990-01-01Paper
A class of nonconvex functions and mathematical programming1988-01-01Paper
Non-convex infinite games1988-01-01Paper
Equivalence of saddle-points and optima, and duality for a class of non- smooth non-convex problems1988-01-01Paper
Nondifferentiable programming and duality with modified convexity1987-01-01Paper
On optimality conditions in nonsmooth inequality constrained minimization1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37823191987-01-01Paper
Nonconvex theorems of the alternative and minimization1987-01-01Paper
A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processes1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32217631986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37341901986-01-01Paper
A generalization of a minimax theorem of Fan via a theorem of the alternative1986-01-01Paper
Equivalence of a Ky Fan type minimax theorem and a Gordan type alternative theorem1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36822651985-01-01Paper
Convexlike alternative theorems and mathematical programming1985-01-01Paper
First and second order fractional programming duality1985-01-01Paper
Nonlinear alternative theorems and nondifferentiable programming1984-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Vaithilingam Jeyakumar