Optimization of Polynomials on Compact Semialgebraic Sets
From MaRDI portal
Recommendations
Cited in
(78)- 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
- Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness
- A multilevel analysis of the Lasserre hierarchy
- Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization
- An SDP method for copositivity of partially symmetric tensors
- On the exactness of Lasserre relaxations and pure states over real closed fields
- Multi-objective convex polynomial optimization and semidefinite programming relaxations
- Detecting optimality and extracting solutions in polynomial optimization with the truncated GNS construction
- Positivity certificates and polynomial optimization on non-compact semialgebraic sets
- Certifying the global optimality of quartic minimization over the sphere
- On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems
- SDP relaxation algorithms for \(\mathbf{P(P}_0)\)-tensor detection
- Saddle points of rational functions
- Certificates for nonnegativity of polynomials with zeros on compact semialgebraic sets
- A new approximation hierarchy for polynomial conic optimization
- Certifying convergence of Lasserre's hierarchy via flat truncation
- Numerical multilinear algebra and its applications
- Matrix sum-of-squares relaxations for robust semi-definite programs
- LMI relaxations in robust control
- Minimizing the sum of many rational functions
- Convex generalized Nash equilibrium problems and polynomial optimization
- Convergent semidefinite programming relaxations for global bilevel polynomial optimization problems
- Introduction to semidefinite, conic and polynomial optimization
- A ``joint+marginal approach in optimization
- Optimizing a linear function over a noncompact real algebraic variety
- Polynomial optimization with real varieties
- Stability and genericity for semi-algebraic compact programs
- scientific article; zbMATH DE number 6703425 (Why is no real title available?)
- Metric properties of semialgebraic mappings
- Convexifying positive polynomials and sums of squares approximation
- Real ideal and the duality of semidefinite programming for polynomial optimization
- Algorithmic aspects of sums of Hermitian squares of noncommutative polynomials
- Positive polynomials and sequential closures of quadratic modules
- Convexity in SemiAlgebraic Geometry and Polynomial Optimization
- Constructive proofs of some positivstellensätze for compact semialgebraic subsets of \(\mathbb R^{d }\)
- Discrete least-norm approximation by nonnegative (trigonometric) polynomials and rational functions
- Optimization of Polynomial Functions
- On the exactness of Lasserre relaxations for compact convex basic closed semialgebraic sets
- Semidefinite Representation for Convex Hulls of Real Algebraic Curves
- Real radicals and finite convergence of polynomial optimization problems
- A complete semidefinite algorithm for detecting copositive matrices and tensors
- On polynomial optimization over non-compact semi-algebraic sets
- scientific article; zbMATH DE number 7313221 (Why is no real title available?)
- On the construction of converging hierarchies for polynomial optimization based on certificates of global positivity
- On the quadratic stability of descriptor systems with uncertainties in the derivative matrix
- Formal Proofs for Nonlinear Optimization
- A matrix Positivstellensatz with lifting polynomials
- Semidefinite representations of noncompact convex sets
- On the Minimum of a Polynomial Function on a Basic Closed Semialgebraic Set and Applications
- Generic properties for semialgebraic programs
- Radii minimal projections of polytopes and constrained optimization of symmetric polynomials
- Well-posedness in unconstrained polynomial optimization problems
- Strong duality in lasserre's hierarchy for polynomial optimization
- On the effective Putinar's Positivstellensatz and moment approximation
- Homogenization for polynomial optimization with unbounded sets
- Partitioning procedure for polynomial optimization
- Distance to a constitutive tensor isotropy stratum by the Lasserre polynomial optimization method
- Rational Generalized Nash Equilibrium Problems
- Certifying optimality of Bell inequality violations: noncommutative polynomial optimization through semidefinite programming and local optimization
- Reducing nonnegativity over general semialgebraic sets to nonnegativity over simple sets
- Semidefinite programming for min-max problems and games
- Norm bounds and underestimators for unconstrained polynomial integer minimization
- Convergence rate for linear minimizer-estimators in the moment-sum-of-squares hierarchy
- Polynomial optimization in geometric modeling
- Smaller SDP for SOS decomposition
- Stability of quadratic modules
- Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals
- Semidefinite representations for finite varieties
- On the complexity of Putinar's Positivstellensatz
- On the complexity of Schmüdgen's Positivstellensatz
- Semidefinite bounds for the stability number of a graph via sums of squares of polynomials
- SOS approximations of nonnegative polynomials via simple high degree perturbations
- Positivstellensatz for homogeneous semialgebraic sets
- Effective Pólya semi-positivity for non-negative polynomials on the simplex
- An analogue of the Riesz-Haviland theorem for the truncated moment problem
- Certificates of convexity for basic semi-algebraic sets
- A semidefinite programming approach to the generalized problem of moments
This page was built for publication: Optimization of Polynomials on Compact Semialgebraic Sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5317523)
