Cited By
View all- Korda MMagron VRíos-Zertuche R(2024)Convergence rates for sums-of-squares hierarchies with correlative sparsityMathematical Programming10.1007/s10107-024-02071-6Online publication date: 25-Mar-2024
In a first contribution, we revisit two certificates of positivity on (possibly non-compact) basic semialgebraic sets due to Putinar and Vasilescu (C R Acad Sci Ser I Math 328(6):495–499, 1999). We use Jacobi’s technique from (Math Z 237(2):259–...
We provide a new degree bound on the weighted sum-of-squares (SOS) polynomials for Putinar–Vasilescu's Positivstellensatz. This leads to another Positivstellensatz saying that if f is a polynomial of degree at most 2 d f nonnegative on ...
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed polynomials have an exact GCD of given degree. We present algorithms based ...
Association for Computing Machinery
New York, NY, United States
View or Download as a PDF file.
PDFView online with eReader.
eReaderView this article in HTML Format.
HTML FormatCheck if you have access through your login credentials or your institution to get full access on this article.
Sign in