Donghui Fang

Computational Theory and Mathematics · 2010

A researcher in the Science corpus: 1 paper; trusts 3 researchers and is trusted by 0 researchers here, as inferred from the citation graph.

Subfields

Whom Donghui Fang trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

  1. Radu Ioan Bot
  2. Vaithilingam Jeyakumar
  3. Nguyen Dinh
  4. Gert Wanka
  5. Constantin Zalinescu
  6. Miguel Angel Goberna

Papers from Donghui Fang's perspective

Ordered by how strongly the researchers Donghui Fang trusts endorse each paper. Same corpus, a different order for every researcher.

  1. Convex analysis in general vector spaces
  2. An alternative formulation for a new closed cone constraint qualification
  3. New Farkas-type constraint qualifications in convex infinite programming
  4. From linear to convex systems: consistency, Farkas' Lemma and applications
  5. New regularity conditions for strong and total Fenchel–Lagrange duality in infinite dimensional spaces
  6. A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces
  7. Constraint Qualifications Characterizing Lagrangian Duality in Convex Optimization
  8. Necessary and sufficient conditions for stable conjugate duality
  9. A simple closure condition for the normal cone intersection formula
  10. Convex analysis and minimization algorithms

Their papers