Nguyen Dinh
Computational Theory and Mathematics · 2006–2014
A researcher in the Science corpus: 5 papers; trusts 13 researchers and is trusted by 4 researchers here, as inferred from the citation graph.
Subfields
- Computational Theory and Mathematics — 19 citations into it; #8,361 of 12,182 by trust here, #6,798 by citations
- Numerical Analysis — 15 citations into it; #2,410 of 3,586 by trust here, #1,659 by citations
- Applied Mathematics — 7 citations into it
- Control and Systems Engineering — 6 citations into it; #7,437 of 8,257 by trust here, #7,140 by citations
Whom Nguyen Dinh trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Constantin Zalinescu
- Radu Ioan Bot
- Stephan Dempe
- Miguel Angel Goberna
- Regina Sandra Burachik
- Vaithilingam Jeyakumar
- Gert Wanka
- M. A. L. Cerdá
- Marco A. López
- Aharon Ben-Tal
Who trusts Nguyen Dinh overall
- Stephan Dempe
- Nader Kanzi
- Tran Thai An Nghia
- Donghui Fang
- Guy Vallet
- Soghra Nobakhtian
- Vaithilingam Jeyakumar
- Joydeep Dutta
- Chong Li
Papers from Nguyen Dinh's perspective
Ordered by how strongly the researchers Nguyen Dinh trusts endorse each paper. Same corpus, a different order for every researcher.
- Convex analysis in general vector spaces
- Convex analysis and minimization algorithms
- Necessary and sufficient conditions for stable conjugate duality
- Asymptotic cones and functions in optimization and variational inequalities
- Foundations of Bilevel Programming
- New necessary optimality conditions in optimistic bilevel programming
- A closedness condition and its applications to DC programs with convex constraints
- An alternative formulation for a new closed cone constraint qualification
- Marktform und Gleichgewicht
- Monotone Operators and the Proximal Point Algorithm
Their papers
- A closedness condition and its applications to DC programs with convex constraints (2010) — 81 citations
- New Farkas-type constraint qualifications in convex infinite programming (2007) — 139 citations
- Optimality Conditions for a Simple Convex Bilevel Programming Problem (2010) — 49 citations
- Farkas’ lemma: three decades of generalizations for mathematical optimization (2014) — 76 citations
- From linear to convex systems: consistency, Farkas' Lemma and applications (2006) — 110 citations