Sorin-Mihai Grad

Computational Theory and Mathematics · 2007–2009

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

Subfields

Whom Sorin-Mihai Grad trusts overall

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

  1. Radu Ioan Bot
  2. Constantin Zalinescu

Papers from Sorin-Mihai Grad's perspective

Ordered by how strongly the researchers Sorin-Mihai Grad trusts endorse each paper. Same corpus, a different order for every researcher.

  1. Necessary and sufficient conditions for stable conjugate duality
  2. Convex analysis in general vector spaces
  3. A comparison of constraint quali cations in in nite-dimensional convex programming
  4. A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spaces
  5. A simple closure condition for the normal cone intersection formula
  6. Monotone Operators and the Proximal Point Algorithm
  7. On the Relations Between Different Dual Problems in Convex Mathematical Programming
  8. Solving monotone inclusions via compositions of nonexpansive averaged operators
  9. Splitting Algorithms for the Sum of Two Nonlinear Operators
  10. From Hahn-Banach to monotonicity

Their papers