#### Filter Results:

- Full text PDF available (24)

#### Publication Year

1982

2015

- This year (0)
- Last 5 years (4)
- Last 10 years (20)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

We show that every real polynomial f nonnegative on [âˆ’1, 1]n can be approximated in the l1-norm of coefficients, by a sequence of polynomials {fÎµr} that are sums of squares. This complements theâ€¦ (More)

We consider real polynomials in finitely many variables. Let the variables consist of finitely many blocks that are allowed to overlap in a certain way. Let the solution set of a finite system ofâ€¦ (More)

- Tim Netzer, Andreas Thom
- 2010

The problem of writing real zero polynomials as determinants of linear matrix polynomials has recently attracted a lot of attention. Helton and Vinnikov [9] have proved that any real zero polynomialâ€¦ (More)

- JoÃ£o Gouveia, Tim Netzer
- SIAM Journal on Optimization
- 2011

This work is concerned with different aspects of spectrahedra and their projections, sets that are important in semidefinite optimization. We prove results on the limitations of so called Lasserreâ€¦ (More)

- Thomas Mairinger, Tim Netzer, W. Schoner, Andreas Gschwendtner
- Journal of telemedicine and telecare
- 1998

If pathologists will benefit so much from using telepathology, why is it taking so long to be introduced? This question has been discussed between experts, but the potential users are rarely askedâ€¦ (More)

- Tim Netzer, Daniel Plaumann, Markus Schweighofer
- SIAM Journal on Optimization
- 2010

A linear matrix inequality (LMI) is a condition stating that a symmetric matrix whose entries are affine-linear combinations of variable,; is positive semidefinite. :dotiv11ted by the fact thatâ€¦ (More)

- Tim Netzer, Daniel Plaumann, Andreas Berthold Thom
- ArXiv
- 2011

We consider the problem of writing real polynomials as determinants of symmetric linear matrix polynomials. This problem of algebraic geometry, whose roots go back to the nineteenth century, hasâ€¦ (More)

- Tim Netzer
- 2008

A finitely generated quadratic module or preordering in the real polynomial ring is called stable, if it admits a certain degree bound on the sums of squares in the representation of polynomials.â€¦ (More)

- Tim Netzer
- 2009

Spectrahedra are sets defined by linear matrix inequalities. Projections of spectrahedra are called semidefinite representable sets. Both kinds of sets are of practical use in polynomialâ€¦ (More)

- PINAKI MONDAL, Tim Netzer
- 2013

We study the growth of polynomials on semialgebraic sets. For this purpose we associate a graded algebra to the set, and address all kinds of questions about finite generation. We show that for aâ€¦ (More)