The following pages link to (Q4428719):
Displaying 50 items.
- Nonnegative Morse polynomial functions and polynomial optimization (Q291995) (← links)
- Algorithmic aspects of sums of Hermitian squares of noncommutative polynomials (Q354616) (← links)
- An approximation bound analysis for Lasserre's relaxation in multivariate polynomial optimization (Q384182) (← links)
- An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination (Q384995) (← 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)
- Global optimality conditions and optimization methods for polynomial programming problems (Q496629) (← links)
- Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization (Q522270) (← links)
- Lower bounds for a polynomial in terms of its coefficients (Q604214) (← links)
- Obstructions to determinantal representability (Q616881) (← links)
- Discriminants and nonnegative polynomials (Q655567) (← links)
- Cross-Hill: a heuristic method for global optimization (Q669439) (← links)
- Norm bounds and underestimators for unconstrained polynomial integer minimization (Q684153) (← links)
- Sum of squares methods for minimizing polynomial forms over spheres and hypersurfaces (Q693193) (← links)
- A convex polynomial that is not sos-convex (Q715094) (← links)
- Hyperbolic polynomials and generalized Clifford algebras (Q741604) (← 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)
- Linear optimization with cones of moments and nonnegative polynomials (Q745685) (← links)
- Smaller SDP for SOS decomposition (Q746820) (← links)
- Sum of squares method for sensor network localization (Q839485) (← links)
- Semidefinite representation of convex sets (Q847843) (← links)
- Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals (Q863907) (← links)
- Semidefinite representations for finite varieties (Q868441) (← links)
- Semidefinite programming relaxations for graph coloring and maximal clique problems (Q868457) (← links)
- On the complexity of Putinar's Positivstellensatz (Q870344) (← links)
- On the complexity of Schmüdgen's Positivstellensatz (Q876820) (← links)
- Equality-constrained minimization of polynomial functions (Q892787) (← links)
- Border basis relaxation for polynomial optimization (Q898268) (← links)
- Exploiting equalities in polynomial programming (Q935230) (← links)
- Algorithms for multidimensional spectral factorization and sum of squares (Q935383) (← links)
- Exact relaxations of non-convex variational problems (Q941046) (← links)
- Sums of Hermitian squares and the BMV conjecture (Q1012666) (← links)
- Coverage of generalized confidence intervals (Q1021836) (← links)
- Solving polynomial optimization problems via the truncated tangency variety and sums of squares (Q1030710) (← links)
- An efficient algorithm for range computation of polynomials using the Bernstein form (Q1037369) (← links)
- A nonlinear functional approach to LFT model validation. (Q1608344) (← links)
- A complete characterization of determinantal quadratic polynomials (Q1698590) (← links)
- DC decomposition of nonconvex polynomials with algebraic techniques (Q1749445) (← links)
- Lagrangian decomposition of block-separable mixed-integer all-quadratic programs (Q1771303) (← links)
- Symmetry groups, semidefinite programs, and sums of squares (Q1878418) (← links)
- NP-hardness of deciding convexity of quartic polynomials and related problems (Q1942256) (← links)
- The tracial moment problem and trace-optimization of polynomials (Q1942272) (← links)
- An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming (Q1994127) (← links)
- Characteristic polynomials of symmetric matrices over the univariate polynomial ring (Q2012044) (← links)
- Robust consensus for linear multi-agent systems with mixed uncertainties (Q2018585) (← links)
