Vaithilingam Jeyakumar
Computational Theory and Mathematics · 2004–2014
A researcher in the Science corpus: 7 papers; trusts 6 researchers and is trusted by 8 researchers here, as inferred from the citation graph.
Subfields
- Computational Theory and Mathematics — 16 citations into it; #5,025 of 12,182 by trust here, #6,463 by citations
- Numerical Analysis — 15 citations into it; #1,378 of 3,586 by trust here, #1,448 by citations
- Applied Mathematics — 6 citations into it
Whom Vaithilingam Jeyakumar trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Constantin Zalinescu
- Radu Ioan Bot
- Regina Sandra Burachik
- Claude Lemaréchal
- Heinz H. Bauschke
- Gert Wanka
- Nguyen Dinh
Who trusts Vaithilingam Jeyakumar overall
Papers from Vaithilingam Jeyakumar's perspective
Ordered by how strongly the researchers Vaithilingam Jeyakumar trusts endorse each paper. Same corpus, a different order for every researcher.
- A simple closure condition for the normal cone intersection formula
- Convex analysis and minimization algorithms
- On Projection Algorithms for Solving Convex Feasibility Problems
- Bounded Linear Regularity, Strong CHIP, and CHIP are Distinct Properties
- An alternative formulation for a new closed cone constraint qualification
- Monotone Operators and the Proximal Point Algorithm
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- A CONVEX REPRESENTATION OF MAXIMAL MONOTONE OPERATORS
- Convex analysis in general vector spaces
- The relevance of convex analysis for the study of monotonicity
Their papers
- A simple closure condition for the normal cone intersection formula (2004) — 48 citations
- Necessary and sufficient conditions for stable conjugate duality (2006) — 65 citations
- Constraint Qualifications Characterizing Lagrangian Duality in Convex Optimization (2008) — 60 citations
- Farkas’ lemma: three decades of generalizations for mathematical optimization (2014) — 76 citations
- Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities (2008) — 60 citations
- Nonsmooth vector functions and continuous optimization (2008) — 111 citations
- Lagrange Multiplier Conditions Characterizing the Optimal Solution Sets of Cone-Constrained Convex Programs (2004) — 53 citations