Publication:4428719
From MaRDI portal
zbMath1099.13516arXivmath/0103170MaRDI QIDQ4428719
Bernd Sturmfels, Pablo A. Parrilo
Publication date: 22 September 2003
Full work available at URL: https://arxiv.org/abs/math/0103170
65K05: Numerical mathematical programming methods
90C22: Semidefinite programming
13P10: Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases)
14P10: Semialgebraic sets and related spaces
13J30: Real algebra
Related Items
Lower bounds for a polynomial in terms of its coefficients, Sum of squares method for sensor network localization, Semidefinite representation of convex sets, Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals, Semidefinite representations for finite varieties, Semidefinite programming relaxations for graph coloring and maximal clique problems, On the complexity of Putinar's Positivstellensatz, On the complexity of Schmüdgen's Positivstellensatz, Exploiting equalities in polynomial programming, Algorithms for multidimensional spectral factorization and sum of squares, Exact relaxations of non-convex variational problems, Sums of Hermitian squares and the BMV conjecture, Coverage of generalized confidence intervals, Solving polynomial optimization problems via the truncated tangency variety and sums of squares, An efficient algorithm for range computation of polynomials using the Bernstein form, A nonlinear functional approach to LFT model validation., Lagrangian decomposition of block-separable mixed-integer all-quadratic programs, Symmetry groups, semidefinite programs, and sums of squares, Approximate gcds of polynomials and sparse SOS relaxations, Computing sum of squares decompositions with rational coefficients, A recursive algorithm of exactness verification of relaxations for robust SDPs, Computing all roots of the likelihood equations of seemingly unrelated regressions, An alternative approach for nonlinear optimal control problems based on the method of moments, There are significantly more nonnegative polynomials than sums of squares, Global minimization of rational functions and the nearest GCDs, Global optimization of rational functions: a semidefinite programming approach, Minimizing polynomials via sum of squares over the gradient ideal, Matrix sum-of-squares relaxations for robust semi-definite programs, Establishing stability and instability of matrix hypercubes, Estimation of parameters in a network reliability model with spatial dependence, Canonical Duality Theory: Connections between Nonconvex Mechanics and Global Optimization, Sums of squares over totally real fields are rational sums of squares
Uses Software
