Exact Certification in Global Polynomial Optimization Via Rationalizing Sums-Of-Squares
From MaRDI portal
Publication:3576578
DOI10.1007/978-3-211-99314-9_9zbMath1191.13001OpenAlexW33739186MaRDI QIDQ3576578
Publication date: 30 July 2010
Published in: Texts and Monographs in Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-211-99314-9_9
Symbolic computation and algebraic computation (68W30) Semidefinite programming (90C22) Computational aspects and applications of commutative rings (13P99) Real algebraic and real-analytic geometry (14P99) Research exposition (monographs, survey articles) pertaining to commutative algebra (13-02)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients
- On the complexity of Putinar's Positivstellensatz
- Approximate gcds of polynomials and sparse SOS relaxations
- Computing sum of squares decompositions with rational coefficients
- Approximate factorization of multivariate polynomials using singular value decomposition
- Towards optimal use of multi-precision arithmetic: a remark
- Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Sharp estimates for triangular sets
- Computing the global optimum of a multivariate polynomial over the reals
- Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars
- GloptiPoly
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- Handbook of semidefinite programming. Theory, algorithms, and applications
This page was built for publication: Exact Certification in Global Polynomial Optimization Via Rationalizing Sums-Of-Squares
