Certifying convergence of Lasserre's hierarchy via flat truncation

DOI10.1007/S10107-012-0589-9zbMath1305.65151arXiv1106.2384OpenAlexW2052557161MaRDI QIDQ2434992

Jia-Wang Nie

Publication date: 3 February 2014

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

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

zbMATH Keywords

preorderingsum of squaresquadratic modulesemidefinite programLasserre's hierarchyflat truncation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Semidefinite programming (90C22)

Related Items (62)

Local saddle points for unconstrained polynomial optimization ⋮ Separability of Hermitian tensors and PSD decompositions ⋮ Certifying the global optimality of quartic minimization over the sphere ⋮ The saddle point problem of polynomials ⋮ Tensor eigenvalue complementarity problems ⋮ Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness ⋮ Semidefinite relaxation method for polynomial optimization with second-order cone complementarity constraints ⋮ Bilevel Polynomial Programs and Semidefinite Relaxation Methods ⋮ Homogenization for polynomial optimization with unbounded sets ⋮ Algebraic optimization of sequential decision problems ⋮ A new approximation hierarchy for polynomial conic optimization ⋮ Semidefinite Relaxation Methods for Tensor Absolute Value Equations ⋮ Partially positive matrices ⋮ Optimality conditions and finite convergence of Lasserre's hierarchy ⋮ Dehomogenization for completely positive tensors ⋮ (Global) optimization: historical notes and recent developments ⋮ Rational Generalized Nash Equilibrium Problems ⋮ A Correlatively Sparse Lagrange Multiplier Expression Relaxation for Polynomial Optimization ⋮ Hausdorff distance between convex semialgebraic sets ⋮ A utopia point method-based robust vector polynomial optimization scheme ⋮ On the polyhedral homotopy method for solving generalized Nash equilibrium problems of polynomials ⋮ Hermitian completely positive matrices ⋮ Completely positive tensors in the complex field ⋮ Generic Properties for Semialgebraic Programs ⋮ Quadratic tensor eigenvalue complementarity problems ⋮ Convex generalized Nash equilibrium problems and polynomial optimization ⋮ A semidefinite method for tensor complementarity problems ⋮ Semidefinite relaxations for semi-infinite polynomial programming ⋮ The \(\mathcal A\)-truncated \(K\)-moment problem ⋮ A note on convex relaxations for the inverse eigenvalue problem ⋮ On solving a class of fractional semi-infinite polynomial programming problems ⋮ A Lagrange Multiplier Expression Method for Bilevel Polynomial Optimization ⋮ Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization ⋮ An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming ⋮ Real eigenvalues of nonsymmetric tensors ⋮ Tensor maximal correlation problems ⋮ Well-Posedness in Unconstrained Polynomial Optimization Problems ⋮ A semidefinite relaxation method for second-order cone tensor eigenvalue complementarity problems ⋮ Tensor complementarity problems. II: Solution methods ⋮ The Gauss-Seidel method for generalized Nash equilibrium problems of polynomials ⋮ Tensor \(Z\)-eigenvalue complementarity problems ⋮ A Complete Semidefinite Algorithm for Detecting Copositive Matrices and Tensors ⋮ Multi-objective convex polynomial optimization and semidefinite programming relaxations ⋮ Stochastic polynomial optimization ⋮ Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities ⋮ Positive Maps and Separable Matrices ⋮ Monotonically positive matrices ⋮ Linear optimization with cones of moments and nonnegative polynomials ⋮ GpoSolver: a Matlab/C++ toolbox for global polynomial optimization ⋮ A semidefinite relaxation method for second-order cone polynomial complementarity problems ⋮ SDP relaxation algorithms for \(\mathbf{P(P}_0)\)-tensor detection ⋮ Higher-degree tensor eigenvalue complementarity problems ⋮ Saddle points of rational functions ⋮ Test of copositive tensors ⋮ A semidefinite relaxation algorithm for checking completely positive separable matrices ⋮ In SDP Relaxations, Inaccurate Solvers Do Robust Optimization ⋮ Tight relaxations for polynomial optimization and Lagrange multiplier expressions ⋮ A global optimization method for multiple response optimization problems ⋮ The maximum tensor complementarity eigenvalues ⋮ Minimizing trigonometric matrix polynomials over semi-algebraic sets ⋮ Distributionally robust optimization with moment ambiguity sets ⋮ An SDP relaxation method for Perron pairs of a nonnegative tensor

Uses Software

• SeDuMi
• GloptiPoly
• YALMIP
• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Semidefinite representations for finite varieties
• On the complexity of Putinar's Positivstellensatz
• Semidefinite characterization and computation of zero-dimensional real radical ideals
• The \(K\)-moment problem for compact semi-algebraic sets
• A semidefinite approach for truncated \(K\)-moment problems
• An exact Jacobian SDP relaxation for polynomial optimization
• Minimizing polynomials via sum of squares over the gradient ideal
• Global Optimization with Polynomials and the Problem of Moments
• GloptiPoly 3: moments, optimization and semidefinite programming
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• Detecting Global Optimality and Extracting Solutions in GloptiPoly
• Sums of squares of regular functions on real algebraic varieties
• Algebraic Degree of Polynomial Optimization
• Optimization of Polynomials on Compact Semialgebraic Sets

This page was built for publication: Certifying convergence of Lasserre's hierarchy via flat truncation