The following pages link to (Q4428719):
Displayed 32 items.
- Lower bounds for a polynomial in terms of its coefficients (Q604214) (← 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)
- 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)
- Lagrangian decomposition of block-separable mixed-integer all-quadratic programs (Q1771303) (← links)
- Symmetry groups, semidefinite programs, and sums of squares (Q1878418) (← links)
- Approximate gcds of polynomials and sparse SOS relaxations (Q2378493) (← links)
- Computing sum of squares decompositions with rational coefficients (Q2378506) (← links)
- A recursive algorithm of exactness verification of relaxations for robust SDPs (Q2390543) (← links)
- Computing all roots of the likelihood equations of seemingly unrelated regressions (Q2457331) (← links)
- An alternative approach for nonlinear optimal control problems based on the method of moments (Q2457954) (← links)
- There are significantly more nonnegative polynomials than sums of squares (Q2480563) (← links)
- Global minimization of rational functions and the nearest GCDs (Q2481368) (← links)
- Global optimization of rational functions: a semidefinite programming approach (Q2490324) (← links)
- Minimizing polynomials via sum of squares over the gradient ideal (Q2492680) (← links)
- Matrix sum-of-squares relaxations for robust semi-definite programs (Q2492689) (← links)
- Establishing stability and instability of matrix hypercubes (Q2504535) (← links)
- Estimation of parameters in a network reliability model with spatial dependence (Q3373744) (← links)
- Canonical Duality Theory: Connections between Nonconvex Mechanics and Global Optimization (Q3565467) (← links)
- Sums of squares over totally real fields are rational sums of squares (Q3617579) (← links)