A note on the representation of positive polynomials with structured sparsity

Details A note on the representation of positive polynomials with structured sparsity A note on the representation of positive polynomials with structured sparsity

2006-11-16

arxiv.org/abs/math/0611498v1

Mathematics

Optimization and Control

4 pages

Scientific paper

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 polynomial inequalities be given where each inequality involves only variables of one block. We investigate polynomials that are positive on such a set and sparse in the sense that each monomial involves only variables of one block. In particular, we derive a short and direct proof for Lasserre's theorem of the existence of sums of squares certificates respecting the block structure. The motivation for the results can be found in the literature and stems from numerical methods using semidefinite programming to simulate or control discrete-time behaviour of systems.

Affiliated with

Also associated with

No associations

Rating

A note on the representation of positive polynomials with structured sparsity 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 A note on the representation of positive polynomials with structured sparsity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A note on the representation of positive polynomials with structured sparsity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-623271