Vaithilingam Jeyakumar

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Gue Myung Lee

> Home > Persons > Vaithilingam Jeyakumar

Publications

2024
[j87]
- view
  authority control:
- export record
  dblp key:
  - journals/jota/JeyakumarLLH24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jota/JeyakumarLLH24
Vaithilingam Jeyakumar, Gue Myung Lee, Jae-Hyoung Lee, Yingkun Huang:
Sum-of-Squares Relaxations in Robust DC Optimization and Feature Selection. J. Optim. Theory Appl. 200(1): 308-343 (2024)
2016
[j62]
- view
  authority control:
- export record
  dblp key:
  - journals/jgo/JeyakumarLL16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgo/JeyakumarLL16
Vaithilingam Jeyakumar, Gue Myung Lee, N. T. H. Linh:
Generalized Farkas' lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization. J. Glob. Optim. 64(4): 679-702 (2016)
[j61]
- view
  authority control:
- export record
  dblp key:
  - journals/jgo/JeyakumarKLL16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgo/JeyakumarKLL16
Vaithilingam Jeyakumar, S. Kim, Gue Myung Lee, Guoyin Li:
Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets. J. Glob. Optim. 65(2): 175-190 (2016)
2015
[j57]
- view
  authority control:
- export record
  dblp key:
  - journals/jota/JeyakumarLL15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jota/JeyakumarLL15
Vaithilingam Jeyakumar, Gue Myung Lee, Guoyin Li:
Characterizing Robust Solution Sets of Convex Programs under Data Uncertainty. J. Optim. Theory Appl. 164(2): 407-435 (2015)
2011
[j41]
- view
  authority control:
- export record
  dblp key:
  - journals/orl/JeyakumarLL11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/orl/JeyakumarLL11
Vaithilingam Jeyakumar, Guoyin Li, Gue Myung Lee:
A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty. Oper. Res. Lett. 39(2): 109-114 (2011)
2009
[j32]
- view
  authority control:
- export record
  dblp key:
  - journals/siamjo/JeyakumarLL09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamjo/JeyakumarLL09
Vaithilingam Jeyakumar, Gue Myung Lee, Guoyin Li:
Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization. SIAM J. Optim. 20(2): 983-1001 (2009)
2008
[j31]
- view
  authority control:
- export record
  dblp key:
  - journals/mp/JeyakumarL08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mp/JeyakumarL08
Vaithilingam Jeyakumar, Gue Myung Lee:
Complete characterizations of stable Farkas' lemma and cone-convex programming duality. Math. Program. 114(2): 335-347 (2008)
2006
[j25]
- view
  authority control:
- export record
  dblp key:
  - journals/eor/JeyakumarLD06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eor/JeyakumarLD06
Vaithilingam Jeyakumar, Gue Myung Lee, N. Dinh:
Characterizations of solution sets of convex vector minimization problems. Eur. J. Oper. Res. 174(3): 1380-1395 (2006)
[j23]
- view
  authority control:
- export record
  dblp key:
  - journals/jgo/JeyakumarWLD06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgo/JeyakumarWLD06
Vaithilingam Jeyakumar, Zhi-You Wu, Gue Myung Lee, N. Dinh:
Liberating the Subgradient Optimality Conditions from Constraint Qualifications. J. Glob. Optim. 36(1): 127-137 (2006)
2003
[j15]
- view
  authority control:
- export record
  dblp key:
  - journals/siamjo/JeyakumarLD03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamjo/JeyakumarLD03
Vaithilingam Jeyakumar, Gue Myung Lee, N. Dinh:
New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs. SIAM J. Optim. 14(2): 534-547 (2003)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.