Tim Netzer
Computational Theory and Mathematics · 2005–2010
A researcher in the Science corpus: 3 papers; trusts 6 researchers and is trusted by 3 researchers here, as inferred from the citation graph.
Subfields
- Computational Theory and Mathematics — 10 citations into it; #5,333 of 12,182 by trust here, #6,798 by citations
- Numerical Analysis — 9 citations into it; #1,484 of 3,586 by trust here, #1,659 by citations
- Applied Mathematics — 7 citations into it
Whom Tim Netzer trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Petter Brand'en
- J. William Helton
- Jean B. Lasserre
- Scott McCullough
- Victor Vinnikov
- Pablo A. Parrilo
Who trusts Tim Netzer overall
Papers from Tim Netzer's perspective
Ordered by how strongly the researchers Tim Netzer trusts endorse each paper. Same corpus, a different order for every researcher.
- Global Optimization with Polynomials and the Problem of Moments (SIAM Journal on Optimization)
- Distinguished representations of strictly positive polynomials
- NONCOMMUTATIVE CONVEXITY ARISES FROM LINEAR MATRIX INEQUALITIES.
- Semidefinite programming relaxations for semialgebraic problems
- Obstructions to determinantal representability
- Minimizing Polynomial Functions (Algorithmic and Quantitative Aspects of Real Algebraic Geometry in Mathematics and Computer Science)
- Hyperbolic Polynomials and Convex Analysis (Canadian Journal of Mathematics - Journal Canadien de Mathematiques)
- Linear matrix inequality representation of sets
- Topics in Matrix Analysis
- The lax conjecture is true
Their papers
- A note on the representation of positive polynomials with structured sparsity (2006) — 47 citations
- Polynomials with and without determinantal representations (2010) — 62 citations
- SOS approximations of nonnegative polynomials via simple high degree perturbations (2005) — 80 citations