Detecting optimality and extracting solutions in polynomial optimization with the truncated GNS construction

DOI10.1007/s10898-020-00987-9zbMath1484.90070arXiv1704.02034OpenAlexW3135959098MaRDI QIDQ2052380

María López Quijorna

Publication date: 26 November 2021

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1704.02034

zbMATH Keywords

semidefinite programmingquadratureGNS constructionpolynomial optimizationtruncated moment problemmoment relaxationLassere relaxation

Mathematics Subject Classification ID

Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Moment problems (44A60) Numerical quadrature and cubature formulas (65D32) Polynomial optimization (90C23)

Related Items (1)

Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables

Uses Software

• SeDuMi
• GloptiPoly

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization
• Symmetric tensor decomposition
• A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming
• A collection of test problems for constrained global optimization algorithms
• Kubaturformeln mit minimaler Knotenzahl
• A dilation theory approach to cubature formulas
• Optimization approaches to quadrature: new characterizations of Gaussian quadrature on the line and quadrature with few nodes on plane algebraic curves, on the plane and in higher dimensions
• General tensor decomposition, moment matrices and applications
• Global Optimization with Polynomials and the Problem of Moments
• Solution of the truncated complex moment problem for flat data
• The truncated complex $K$-moment problem
• The Moment Problem
• An Exact Duality Theory for Semidefinite Programming Based on Sums of Squares
• Ideals, Varieties, and Algorithms
• Optimization of Polynomials on Compact Semialgebraic Sets
• GloptiPoly
• Revisiting two theorems of Curto and Fialkow on moment matrices
• The proof of Tchakaloff’s Theorem
• Orthogonal Polynomials of Several Variables
• \(C^*\)-algebras by example

This page was built for publication: Detecting optimality and extracting solutions in polynomial optimization with the truncated GNS construction