Semidefinite Approximations for Global Unconstrained Polynomial Optimization
From MaRDI portal
Recommendations
Cited in
(33)- An efficient algorithm for range computation of polynomials using the Bernstein form
- Unconstrained and constrained global optimization of polynomial functions in one variable
- Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: the single and multi-segment polynomial B-spline approach
- Approximating Pareto curves using semidefinite relaxations
- Strong duality and minimal representations for cone optimization
- Symmetric ideals, Specht polynomials and solutions to symmetric systems of equations
- Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space
- Positivity certificates and polynomial optimization on non-compact semialgebraic sets
- Canonical primal-dual algorithm for solving fourth-order polynomial minimization problems
- Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations
- Efficiency improvement in an \(n\)D systems approach to polynomial optimization
- An alternative approach for nonlinear optimal control problems based on the method of moments
- Global minimization of rational functions and the nearest GCDs
- Minimizing polynomials via sum of squares over the gradient ideal
- Solving polynomial least squares problems via semidefinite programming relaxations
- SDP relaxations for non-commutative polynomial optimization
- Perturbed sums-of-squares theorem for polynomial optimization and its applications
- Semidefinite approximations of the polynomial abscissa
- Coarse-convex-compactification approach to numerical solution of nonconvex variational problems
- Lower bounds on the global minimum of a polynomial
- A Frank-Wolfe type theorem for nondegenerate polynomial programs
- Approximation bound analysis based on the tight constraints polynomial optimization problems of Lasserre relaxation
- On polynomial optimization over non-compact semi-algebraic sets
- Proving inequalities and solving global optimization problems via simplified CAD projection
- scientific article; zbMATH DE number 7313221 (Why is no real title available?)
- Generic properties for semialgebraic programs
- Well-posedness in unconstrained polynomial optimization problems
- Construction of Multivariate Polynomial Approximation Kernels via Semidefinite Programming
- Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals
- Semidefinite representations for finite varieties
- On the complexity of Putinar's Positivstellensatz
- On global optimizations with polynomials
- Exact relaxations of non-convex variational problems
This page was built for publication: Semidefinite Approximations for Global Unconstrained Polynomial Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5470206)
