Pages that link to "Item:Q2492680"
From MaRDI portal
The following pages link to Minimizing polynomials via sum of squares over the gradient ideal (Q2492680):
Displaying 50 items.
- A dynamic inequality generation scheme for polynomial programming (Q263184) (← links)
- A tensor analogy of Yuan's theorem of the alternative and polynomial optimization with sign structure (Q274079) (← links)
- Stability and genericity for semi-algebraic compact programs (Q289119) (← links)
- Nonnegative Morse polynomial functions and polynomial optimization (Q291995) (← links)
- An approximation bound analysis for Lasserre's relaxation in multivariate polynomial optimization (Q384182) (← links)
- Global optimization of polynomials restricted to a smooth variety using sums of squares (Q412217) (← links)
- Algorithms for computing the global infimum and minimum of a polynomial function (Q424330) (← links)
- Global minimization of multivariate polynomials using nonstandard methods (Q453625) (← links)
- Lower bounds on the global minimum of a polynomial (Q461443) (← links)
- A Frank-Wolfe type theorem for nondegenerate polynomial programs (Q463745) (← links)
- A probabilistic symbolic algorithm to find the minimum of a polynomial function on a basic closed semialgebraic set (Q464735) (← links)
- On polynomial optimization over non-compact semi-algebraic sets (Q481041) (← links)
- Proving inequalities and solving global optimization problems via simplified CAD projection (Q492036) (← links)
- Global optimality conditions and optimization methods for polynomial programming problems (Q496629) (← links)
- Necessary global optimality conditions for nonlinear programming problems with polynomial constraints (Q623367) (← links)
- Discriminants and nonnegative polynomials (Q655567) (← links)
- Norm bounds and underestimators for unconstrained polynomial integer minimization (Q684153) (← links)
- Semi-algebraically connected components of minimum points of a polynomial function (Q741867) (← links)
- Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities (Q742119) (← links)
- Space tensor conic programming (Q742309) (← links)
- Sum of squares method for sensor network localization (Q839485) (← links)
- Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals (Q863907) (← links)
- On the complexity of Putinar's Positivstellensatz (Q870344) (← links)
- Equality-constrained minimization of polynomial functions (Q892787) (← links)
- Border basis relaxation for polynomial optimization (Q898268) (← links)
- Global optimality conditions for cubic minimization problems with cubic constraints (Q907371) (← links)
- Exploiting equalities in polynomial programming (Q935230) (← links)
- Solving polynomial optimization problems via the truncated tangency variety and sums of squares (Q1030710) (← links)
- Global uniqueness and solvability of tensor variational inequalities (Q1637354) (← links)
- Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness (Q1667169) (← links)
- Global optimization of polynomials over real algebraic sets (Q1730308) (← links)
- Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 (Q1731962) (← links)
- Positive definiteness of paired symmetric tensors and elasticity tensors (Q1743944) (← links)
- Tensor maximal correlation problems (Q1753137) (← links)
- An exact Jacobian SDP relaxation for polynomial optimization (Q1942264) (← links)
- Homotopy techniques for solving sparse column support determinantal polynomial systems (Q1979422) (← links)
- An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming (Q1994127) (← links)
- Symmetric ideals, Specht polynomials and solutions to symmetric systems of equations (Q2029007) (← links)
- Computing critical points for invariant algebraic systems (Q2100065) (← links)
- On the Catlin multitype of sums of squares domains (Q2117506) (← links)
- Local saddle points for unconstrained polynomial optimization (Q2125068) (← links)
- Homogeneous polynomials and spurious local minima on the unit sphere (Q2128762) (← links)
- Positivity certificates and polynomial optimization on non-compact semialgebraic sets (Q2149557) (← links)
- Certifying the global optimality of quartic minimization over the sphere (Q2158108) (← links)
- On the complexity of testing attainment of the optimal value in nonlinear optimization (Q2205977) (← links)
- Solving determinantal systems using homotopy techniques (Q2229744) (← links)
- Complements of unbounded convex polyhedra as polynomial images of \({{\mathbb{R}}}^n\) (Q2316794) (← links)
- Tight relaxations for polynomial optimization and Lagrange multiplier expressions (Q2330641) (← links)
- Univariate parameterization for global optimization of mixed-integer polynomial problems (Q2355892) (← links)
- A new approximation hierarchy for polynomial conic optimization (Q2419540) (← links)
