On the Lasserre hierarchy of semidefinite programming relaxations of convex polynomial optimization problems

Keyphrases

• Semidefinite Relaxation 100%
• Polynomial Optimization Problem 100%
• Convex Polynomial Optimization 100%
• Lasserre Hierarchy 100%
• Weak Assumption 50%
• Number of Steps 50%
• Convergence Property 50%
• Convexity 50%
• Semidefinite Programming 50%
• Polynomial Optimization 50%
• Finite Convergence 50%
• Optim 50%
• Input Size 50%
• Semi-algebraic Geometry 50%
• Geometry Optimization 50%

Mathematics

• Polynomial Optimization 100%
• Weaker Assumption 33%
• Convergence Property 33%