Certifying Convergence of Lasserre's Hierarchy via Flat Truncation

Details Certifying Convergence of Lasserre's Hierarchy via Flat Truncation Certifying Convergence of Lasserre's Hierarchy via Flat Truncation

2011-06-13

arxiv.org/abs/1106.2384v1

Mathematics

Optimization and Control

18 pages

Scientific paper

This paper studies how to certify the convergence of Lasserre's hierarchy of semidefinite programming relaxations for solving multivariate polynomial optimization. We propose flat truncation as a general certificate for this purpose. Assume the set of global minimizers is nonempty and finite. Our main results are: i) Putinar type Lasserre's hierarchy has finite convergence if and only if flat truncation holds, under some general assumptions, and this is also true for the Schmudgen type one; ii) under the archimedean condition, flat truncation is asymptotically satisfied for Putinar type Lasserre's hierarchy, and similar is true for the Schmudgen type one; iii) for the hierarchy of Jacobian SDP relaxations, flat truncation is always satisfied. The case of unconstrained polynomial optimization is also discussed.

Affiliated with

Also associated with

No associations

Rating

Certifying Convergence of Lasserre's Hierarchy via Flat Truncation 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 Certifying Convergence of Lasserre's Hierarchy via Flat Truncation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Certifying Convergence of Lasserre's Hierarchy via Flat Truncation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-429170