The following pages link to Vaithilingam Jeyakumar (Q425802):
Displaying 50 items.
- (Q235121) (redirect page) (← links)
- Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets (Q288220) (← links)
- Robust linear semi-infinite programming duality under uncertainty (Q353146) (← links)
- Necessary and sufficient conditions for \(S\)-lemma and~nonconvex quadratic optimization (Q374638) (← links)
- New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs (Q425803) (← links)
- Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty (Q432370) (← links)
- Dual semidefinite programs without duality gaps for a class of convex minimax programs (Q462995) (← links)
- Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization (Q463723) (← links)
- On polynomial optimization over non-compact semi-algebraic sets (Q481041) (← links)
- Robust duality in parametric convex optimization (Q491220) (← links)
- A generalized Farkas lemma with a numerical certificate and linear semi-infinite programs with SDP duals (Q501263) (← links)
- Exact conic programming relaxations for a class of convex polynomial cone programs (Q511965) (← links)
- Robust Farkas' lemma for uncertain linear systems with applications (Q548208) (← links)
- New strong duality results for convex programs with separable constraints (Q613429) (← links)
- Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems (Q620513) (← links)
- Necessary global optimality conditions for nonlinear programming problems with polynomial constraints (Q623367) (← links)
- Robust conjugate duality for convex optimization under uncertainty with application to data classification (Q631700) (← links)
- Robust duality for generalized convex programming problems under data uncertainty (Q654075) (← links)
- Robust duality for fractional programming problems with constraint-wise data uncertainty (Q658562) (← links)
- Convex composite multi-objective nonsmooth programming (Q687035) (← links)
- Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations (Q721169) (← links)
- Farkas' lemma for separable sublinear inequalities without qualifications (Q732779) (← links)
- Inequality systems and optimization (Q811410) (← links)
- Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs (Q837124) (← links)
- A note on sufficient global optimality conditions for fixed charge quadratic programs (Q845625) (← links)
- Characterizing robust local error bounds for linear inequality systems under data uncertainty (Q891541) (← links)
- Robust global error bounds for uncertain linear inequality systems with applications (Q905714) (← links)
- Complete characterizations of stable Farkas' lemma and cone-convex programming duality (Q927159) (← links)
- Global minimization of difference of quadratic and convex functions over box or binary constraints (Q928298) (← links)
- Generalized Fenchel's conjugation formulas and duality for abstract convex functions (Q946326) (← links)
- Characterizing robust set containments and solutions of uncertain linear programs without qualifications (Q974991) (← links)
- Simultaneous classification and feature selection via convex quadratic programming with application to HIV-associated neurocognitive disorder assessment (Q976339) (← links)
- Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions (Q985310) (← links)
- Lagrange multiplier necessary conditions for global optimality for non-convex minimization over a quadratic constraint via S-lemma (Q1001322) (← links)
- Geometric conditions for Kuhn-Tucker sufficiency of global optimality in mathematical programming (Q1002048) (← links)
- New sufficiency for global optimality and duality of mathematical programming problems via underestimators (Q1016384) (← links)
- New Kuhn-Tucker sufficiency for global optimality via convexification (Q1021733) (← links)
- A generalization of a minimax theorem of Fan via a theorem of the alternative (Q1057473) (← links)
- Equivalence of saddle-points and optima, and duality for a class of non- smooth non-convex problems (Q1101679) (← links)
- Equivalence of a Ky Fan type minimax theorem and a Gordan type alternative theorem (Q1117445) (← links)
- Generalizations of Slater's constraint qualification for infinite convex programs (Q1198330) (← links)
- Zero duality gaps in infinite-dimensional programming (Q1263531) (← links)
- Nonsmooth calculus, minimality, and monotonicity of convexificators (Q1301893) (← links)
- Infinite-dimensional convex programming with applications to constrained approximation (Q1321276) (← links)
- A solvability theorem for a class of quasiconvex mappings with applications to optimization (Q1323099) (← links)
- Hunting for a smaller convex subdifferential (Q1359128) (← links)
- First and second-order optimality conditions for convex composite multiobjective optimization (Q1372550) (← links)
- Asymptotic dual conditions characterizing optimality for infinite convex programs (Q1379971) (← links)
- Convex composite non-Lipschitz programming (Q1600101) (← links)
- An open mapping theorem using unbounded generalized Jacobians (Q1612598) (← links)
