scientific article; zbMATH DE number 1984325
From MaRDI portal
zbMath1099.13516arXivmath/0103170MaRDI QIDQ4428719
Pablo A. Parrilo, Bernd Sturmfels
Publication date: 22 September 2003
Full work available at URL: https://arxiv.org/abs/math/0103170
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Semialgebraic sets and related spaces (14P10) Real algebra (13J30)
Related Items
Symmetry groups, semidefinite programs, and sums of squares, Nonnegative Morse polynomial functions and polynomial optimization, Computation with Polynomial Equations and Inequalities Arising in Combinatorial Optimization, Sum of squares method for sensor network localization, On Flattenability of Graphs, Approximate gcds of polynomials and sparse SOS relaxations, Computing sum of squares decompositions with rational coefficients, Semidefinite representation of convex sets, A recursive algorithm of exactness verification of relaxations for robust SDPs, Certifying the global optimality of quartic minimization over the sphere, Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals, Algorithmic aspects of sums of Hermitian squares of noncommutative polynomials, 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, Lower bounds for a polynomial in terms of its coefficients, An approximation bound analysis for Lasserre's relaxation in multivariate polynomial optimization, An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination, Obstructions to determinantal representability, Equality-constrained minimization of polynomial functions, New directions in real algebraic geometry. Abstracts from the workshop held March 19--24, 2023, Global optimization of polynomials restricted to a smooth variety using sums of squares, Border basis relaxation for polynomial optimization, NP-hardness of deciding convexity of quartic polynomials and related problems, The tracial moment problem and trace-optimization of polynomials, Data-driven optimal control via linear transfer operators: a convex approach, A Multigrid Approach to SDP Relaxations of Sparse Polynomial Optimization Problems, A complete characterization of determinantal quadratic polynomials, Algorithms for computing the global infimum and minimum of a polynomial function, Generic Properties for Semialgebraic Programs, Certifying convergence of Lasserre's hierarchy via flat truncation, Efficient Spherical Designs with Good Geometric Properties, Sum of squares basis pursuit with linear and second order cone programming, Global minimization of multivariate polynomials using nonstandard methods, Lower bounds on the global minimum of a polynomial, A Frank-Wolfe type theorem for nondegenerate polynomial programs, DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization, A probabilistic symbolic algorithm to find the minimum of a polynomial function on a basic closed semialgebraic set, Discriminants and nonnegative polynomials, On Sum of Squares Representation of Convex Forms and Generalized Cauchy--Schwarz Inequalities, Exploiting equalities in polynomial programming, Algorithms for multidimensional spectral factorization and sum of squares, 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, Polynomial, regular and Nash images of Euclidean spaces, Exact relaxations of non-convex variational problems, Cross-Hill: a heuristic method for global optimization, Definite determinantal representations of multivariate polynomials, Global optimality conditions and optimization methods for polynomial programming problems, An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming, Canonical Duality Theory: Connections between Nonconvex Mechanics and Global Optimization, DC decomposition of nonconvex polynomials with algebraic techniques, Norm bounds and underestimators for unconstrained polynomial integer minimization, An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming, Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization, There are significantly more nonnegative polynomials than sums of squares, Sum of squares methods for minimizing polynomial forms over spheres and hypersurfaces, Global minimization of rational functions and the nearest GCDs, Well-Posedness in Unconstrained Polynomial Optimization Problems, Characteristic polynomials of symmetric matrices over the univariate polynomial ring, Global optimization of rational functions: a semidefinite programming approach, Lagrangian decomposition of block-separable mixed-integer all-quadratic programs, Minimizing polynomials via sum of squares over the gradient ideal, Matrix sum-of-squares relaxations for robust semi-definite programs, Robust consensus for linear multi-agent systems with mixed uncertainties, A convex polynomial that is not sos-convex, Establishing stability and instability of matrix hypercubes, Two Results on the Size of Spectrahedral Descriptions, LMI relaxations in robust control, Semidefinite programming relaxations and algebraic optimization in control, Best Nonnegative Rank-One Approximations of Tensors, Semidefinite Representation of Convex Sets and Convex Hulls, Sums of squares over totally real fields are rational sums of squares, A Matrix Positivstellensatz with Lifting Polynomials, Estimation of parameters in a network reliability model with spatial dependence, Stochastic polynomial optimization, Hyperbolic polynomials and generalized Clifford algebras, Semi-algebraically connected components of minimum points of a polynomial function, Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities, Sums of Hermitian squares and the BMV conjecture, Linear optimization with cones of moments and nonnegative polynomials, Smaller SDP for SOS decomposition, Coverage of generalized confidence intervals, On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems, Solving polynomial optimization problems via the truncated tangency variety and sums of squares, Complements of unbounded convex polyhedra as polynomial images of \({{\mathbb{R}}}^n\), An efficient algorithm for range computation of polynomials using the Bernstein form, Convex Algebraic Geometry of Curvature Operators, Tight relaxations for polynomial optimization and Lagrange multiplier expressions, LMI Representations of Convex Semialgebraic Sets and Determinantal Representations of Algebraic Hypersurfaces: Past, Present, and Future, Globally Optimizing Small Codes in Real Projective Spaces, Certification of real inequalities: templates and sums of squares, A nonlinear functional approach to LFT model validation., Control analysis and design via randomised coordinate polynomial minimisation
Uses Software
