Optimization of Polynomials on Compact Semialgebraic Sets
From MaRDI portal
Publication:5317523
DOI10.1137/S1052623403431779zbMath1114.90098MaRDI QIDQ5317523
Publication date: 16 September 2005
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
moment problemsemidefinite programmingnonconvex optimizationPositivstellensatzpositive polynomialsum of squares
Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Semialgebraic sets and related spaces (14P10)
Related Items (61)
Minimizing the sum of many rational functions ⋮ Stability and genericity for semi-algebraic compact programs ⋮ Stability of quadratic modules ⋮ Metric properties of semialgebraic mappings ⋮ Convexifying Positive Polynomials and Sums of Squares Approximation ⋮ Certificates for nonnegativity of polynomials with zeros on compact semialgebraic sets ⋮ Certifying the global optimality of quartic minimization over the sphere ⋮ Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals ⋮ Real ideal and the duality of semidefinite programming for polynomial optimization ⋮ Algorithmic aspects of sums of Hermitian squares of noncommutative polynomials ⋮ Semidefinite representations for finite varieties ⋮ On the complexity of Putinar's Positivstellensatz ⋮ Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness ⋮ Constructive proofs of some positivstellensätze for compact semialgebraic subsets of \(\mathbb R^{d }\) ⋮ On the complexity of Schmüdgen's Positivstellensatz ⋮ Discrete least-norm approximation by nonnegative (trigonometric) polynomials and rational functions ⋮ Semidefinite bounds for the stability number of a graph via sums of squares of polynomials ⋮ Partitioning procedure for polynomial optimization ⋮ SOS approximations of nonnegative polynomials via simple high degree perturbations ⋮ On the effective Putinar's Positivstellensatz and moment approximation ⋮ Homogenization for polynomial optimization with unbounded sets ⋮ A new approximation hierarchy for polynomial conic optimization ⋮ Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization ⋮ Distance to a constitutive tensor isotropy stratum by the Lasserre polynomial optimization method ⋮ Positivstellensatz for homogeneous semialgebraic sets ⋮ On the Construction of Converging Hierarchies for Polynomial Optimization Based on Certificates of Global Positivity ⋮ Rational Generalized Nash Equilibrium Problems ⋮ Generic Properties for Semialgebraic Programs ⋮ Real Radicals and Finite Convergence of Polynomial Optimization Problems ⋮ Convex generalized Nash equilibrium problems and polynomial optimization ⋮ Certifying convergence of Lasserre's hierarchy via flat truncation ⋮ Semidefinite programming for min-max problems and games ⋮ A multilevel analysis of the Lasserre hierarchy ⋮ Effective Pólya semi-positivity for non-negative polynomials on the simplex ⋮ Positive polynomials and sequential closures of quadratic modules ⋮ Norm bounds and underestimators for unconstrained polynomial integer minimization ⋮ Numerical multilinear algebra and its applications ⋮ An analogue of the Riesz-Haviland theorem for the truncated moment problem ⋮ On the quadratic stability of descriptor systems with uncertainties in the derivative matrix ⋮ An SDP method for copositivity of partially symmetric tensors ⋮ Well-Posedness in Unconstrained Polynomial Optimization Problems ⋮ Matrix sum-of-squares relaxations for robust semi-definite programs ⋮ Certificates of convexity for basic semi-algebraic sets ⋮ A Complete Semidefinite Algorithm for Detecting Copositive Matrices and Tensors ⋮ A semidefinite programming approach to the generalized problem of moments ⋮ Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems ⋮ LMI relaxations in robust control ⋮ Strong duality in lasserre's hierarchy for polynomial optimization ⋮ Introduction to Semidefinite, Conic and Polynomial Optimization ⋮ A “Joint+Marginal” Approach in Optimization ⋮ Multi-objective convex polynomial optimization and semidefinite programming relaxations ⋮ A Matrix Positivstellensatz with Lifting Polynomials ⋮ Smaller SDP for SOS decomposition ⋮ Detecting optimality and extracting solutions in polynomial optimization with the truncated GNS construction ⋮ SDP relaxation algorithms for \(\mathbf{P(P}_0)\)-tensor detection ⋮ Saddle points of rational functions ⋮ An algorithm for the global optimization of a class of continuous minimax problems ⋮ Solving polynomial optimization problems via the truncated tangency variety and sums of squares ⋮ Radii minimal projections of polytopes and constrained optimization of symmetric polynomials ⋮ Semidefinite Representations of Noncompact Convex Sets ⋮ Formal Proofs for Nonlinear Optimization
Uses Software
This page was built for publication: Optimization of Polynomials on Compact Semialgebraic Sets
