Optimization of Polynomial Functions
From MaRDI portal
Publication:4467291
Recommendations
Cited in
(53)- Solving polynomial optimization problems via the truncated tangency variety and sums of squares
- Optimization of implicitly defined functions.
- Completely positive tensor recovery with minimal nuclear value
- Global optimization of polynomials over real algebraic sets
- Optimization via Chebyshev polynomials
- Compactness criteria for real algebraic sets and Newton polyhedra
- On the exactness of Lasserre relaxations and pure states over real closed fields
- Certifying the global optimality of quartic minimization over the sphere
- On the exactness of sum-of-squares approximations for the cone of \(5 \times 5\) copositive matrices
- On the complexity of testing attainment of the optimal value in nonlinear optimization
- Representations of non-negative polynomials having finitely many zeros
- Minimizing polynomials via sum of squares over the gradient ideal
- Polynomial optimization with applications to stability analysis and control -- alternatives to sum of squares
- Polynomials nonnegative on a grid and discrete optimization
- How to refine polynomial functions
- Lower bounds for polynomials using geometric programming
- Nonnegative Morse polynomial functions and polynomial optimization
- Representations of positive polynomials and optimization on noncompact semialgebraic sets
- Positivity and optimization for semi-algebraic functions
- A statistical approach for economization of the polynomial functions
- scientific article; zbMATH DE number 4158384 (Why is no real title available?)
- Real ideal and the duality of semidefinite programming for polynomial optimization
- Sums of squares, moment matrices and optimization over polynomials
- scientific article; zbMATH DE number 3956830 (Why is no real title available?)
- scientific article; zbMATH DE number 4037632 (Why is no real title available?)
- An approximation bound analysis for Lasserre's relaxation in multivariate polynomial optimization
- scientific article; zbMATH DE number 1984325 (Why is no real title available?)
- A note on optimization with Morse polynomials
- Real radicals and finite convergence of polynomial optimization problems
- Coercive polynomials: stability, order of growth, and Newton polytopes
- Sum-of-squares optimization without semidefinite programming
- On the Equivalence of Algebraic Approaches to the Minimization of Forms on the Simplex
- Optimisation globale et théorie des moments
- Computation of the distance to semi-algebraic sets
- Finite convergence of sum-of-squares hierarchies for the stability number of a graph
- On stability and the Łojasiewicz exponent at infinity of coercive polynomials.
- Semidefinite representations of noncompact convex sets
- Symbolic optimization of algebraic functions
- Optimization of Polynomials on Compact Semialgebraic Sets
- Symmetric tensor nuclear norms
- Tangencies and polynomial optimization
- Properties of the cone of non-negative polynomials and duality
- On types of isolated KKT points in polynomial optimization
- On the hardness of deciding the finite convergence of Lasserre hierarchies
- Norm bounds and underestimators for unconstrained polynomial integer minimization
- Remarks on growth rates of polynomials on semialgebraic sets
- Exact moment representation in polynomial optimization
- Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities
- Semidefinite representations for finite varieties
- On the complexity of Putinar's Positivstellensatz
- On the complexity of Schmüdgen's Positivstellensatz
- Equality-constrained minimization of polynomial functions
- On global optimizations with polynomials
This page was built for publication: Optimization of Polynomial Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4467291)
