On the complexity of Putinar's Positivstellensatz

Mathematics – Algebraic Geometry

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

10.1007/10.1016/j.jco.2006.07.00

We prove an upper bound on the degree complexity of Putinar's
Positivstellensatz. This bound is much worse than the one obtained previously
for Schm\"udgen's Positivstellensatz but it depends on the same parameters. As
a consequence, we get information about the convergence rate of Lasserre's
procedure for optimization of a polynomial subject to polynomial constraints.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

On the complexity of Putinar's Positivstellensatz does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the complexity of Putinar's Positivstellensatz, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the complexity of Putinar's Positivstellensatz will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-250374

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.