Semidefinite programming relaxations for semialgebraic problems
From MaRDI portal
Publication:1424271
DOI10.1007/s10107-003-0387-5zbMath1043.14018WikidataQ93515461 ScholiaQ93515461MaRDI QIDQ1424271
Publication date: 11 March 2004
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-003-0387-5
90C22: Semidefinite programming
90C10: Integer programming
14P10: Semialgebraic sets and related spaces
13J30: Real algebra
Related Items
Real World Verification, Symbolic Model Checking of Hybrid Systems Using Template Polyhedra, Radii minimal projections of polytopes and constrained optimization of symmetric polynomials, Computation of parameter stability margins using polynomial programming techniques, A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization, Minimum ellipsoid bounds for solutions of polynomial systems via sum of squares, Sum of squares method for sensor network localization, Moments and sums of squares for polynomial optimization and related problems, Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals, Semidefinite representations for finite varieties, An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones, SOS approximations of nonnegative polynomials via simple high degree perturbations, Exploiting equalities in polynomial programming, Algorithms for multidimensional spectral factorization and sum of squares, Exact relaxations of non-convex variational problems, Sums of squares based approximation algorithms for MAX-SAT, Polynomial designs. I: Polynomial characterizations of common properties of a design, A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones, Local stability analysis using simulations and sum-of-squares programming, Numerical approaches for collaborative data processing, An algorithm for the global optimization of a class of continuous minimax problems, A semi-algebraic approach for asymptotic stability analysis, Computing differential invariants of hybrid systems as fixed points, An improved semidefinite programming relaxation for the satisfiability problem, Sparsity in sums of squares of polynomials, Inverse conic programming with applications, Products of positive forms, linear matrix inequalities, and Hilbert 17th problem for ternary forms, Symmetry groups, semidefinite programs, and sums of squares, Computing sum of squares decompositions with rational coefficients, An alternative Kalman-Yakubovich-Popov lemma and some extensions, Efficiency improvement in an \(n\)D systems approach to polynomial optimization, An alternative approach for nonlinear optimal control problems based on the method of moments, Feedback control of quantum entanglement in a two-SPIN system, Constructing invariants for hybrid systems, Numerical multilinear algebra and its applications, There are significantly more nonnegative polynomials than sums of squares, Global minimization of rational functions and the nearest GCDs, Approximation of the joint spectral radius using sum of squares, Global optimization of rational functions: a semidefinite programming approach, Minimizing polynomials via sum of squares over the gradient ideal, Robust global optimization with polynomials, Bounds on linear PDEs via semidefinite optimization, A PTAS for the minimization of polynomials of fixed degree over the simplex, Polyhedra related to integer-convex polynomial systems, An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs, Preprocessing sparse semidefinite programs via matrix completion, Sums of squares over totally real fields are rational sums of squares, Decompositional Construction of Lyapunov Functions for Hybrid Systems
