Gert Wanka

Computational Theory and Mathematics · 2002–2009

A researcher in the Science corpus: 7 papers; trusts 6 researchers and is trusted by 9 researchers here, as inferred from the citation graph.

Subfields

Whom Gert Wanka trusts overall

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

  1. Ivar Ekeland
  2. Constantin Zalinescu
  3. Radu Ioan Bot
  4. M. Seethharama Gowda
  5. Regina Sandra Burachik

Who trusts Gert Wanka overall

  1. Radu Ioan Bot
  2. Nguyen Dinh
  3. Donghui Fang
  4. Vaithilingam Jeyakumar

Papers from Gert Wanka's perspective

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

  1. A simple closure condition for the normal cone intersection formula
  2. Necessary and sufficient conditions for stable conjugate duality
  3. Convex analysis in general vector spaces
  4. On the Relations Between Different Dual Problems in Convex Mathematical Programming
  5. A comparison of constraint quali cations in in nite-dimensional convex programming
  6. A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spaces
  7. Monotone Operators and the Proximal Point Algorithm
  8. A CONVEX REPRESENTATION OF MAXIMAL MONOTONE OPERATORS
  9. Convex measures of risk and trading constraints (Finance and Stochastics)
  10. Solving monotone inclusions via compositions of nonexpansive averaged operators

Their papers