中文
相关论文

相关论文: Sparse non-SOS Putinar-type Positivstellens\"atze

200 篇论文

A non-negativity certificate (NNC) is a way to write a polynomial so that its non-negativity on a semialgebraic set becomes evident. Positivstellens\"atze (Ps\"atze) guarantee the existence of NNCs. Both, NNCs and Ps\"atze underlie powerful…

最优化与控制 · 数学 2024-03-25 Olga Kuryatnikova , Juan C. Vera , Luis F. Zuluaga

This paper establishes new Positivstellens\"atze for polynomials that are positive on sets defined by polynomial matrix inequalities (PMIs). We extend the classical Handelman and Krivine-Stengle theorems from the scalar inequality setting…

最优化与控制 · 数学 2025-09-03 Feng Guo

Certificates of non-negativity such as Putinar's Positivstellensatz have been used to obtain powerful numerical techniques to solve polynomial optimization (PO) problems. Putinar's certificate uses sum-of-squares (sos) polynomials to…

最优化与控制 · 数学 2017-09-12 Javer Pena , Juan C. Vera , Luis F. Zuluaga

In a broad sense, positivstellens\"atze are results about representations of polynomials which are strictly positive on a given set. We give constructive and, to a large extent, elementary proofs of some known positivstellens\"atze for…

代数几何 · 数学 2012-03-14 Gennadiy Averkov

Positivstellensatz is a fundamental result in real algebraic geometry providing algebraic certificates for positivity of polynomials on semialgebraic sets. In this article Positivstellens\"atze for trace polynomials positive on…

环与代数 · 数学 2019-01-23 Igor Klep , Špela Špenko , Jurij Volčič

Recently, the second and the third author developed sums of nonnegative circuit polynomials (SONC) as a new certificate of nonnegativity for real polynomials, which is independent of sums of squares. In this article we show that the SONC…

代数几何 · 数学 2017-03-20 Mareike Dressler , Sadik Iliman , Timo de Wolff

The Positivstellens\"atze of Putinar and Schm\"udgen show that any polynomial $f$ positive on a compact semialgebraic set can be represented using sums of squares. Recently, there has been large interest in proving effective versions of…

代数几何 · 数学 2025-02-24 Lorenzo Baldi , Lucas Slot

In recent years, techniques based on convex optimization and real algebra that produce converging hierarchies of lower bounds for polynomial minimization problems have gained much popularity. At their heart, these hierarchies rely crucially…

最优化与控制 · 数学 2018-08-28 Amir Ali Ahmadi , Georgina Hall

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…

最优化与控制 · 数学 2021-05-28 Ngoc Hoang Anh Mai , Victor Magron

We prove decomposition theorems for sparse positive (semi)definite polynomial matrices that can be viewed as sparsity-exploiting versions of the Hilbert--Artin, Reznick, Putinar, and Putinar--Vasilescu Positivstellens\"atze. First, we…

最优化与控制 · 数学 2021-11-23 Yang Zheng , Giovanni Fantuzzi

We look for algebraic certificates of positivity for functions which are not necessarily polynomial functions. Similar questions were examined earlier by Lasserre and Putinar and by Putinar. We explain how these results can be understood as…

代数几何 · 数学 2010-04-27 Tim Netzer , Murray Marshall

We study sum-of-squares (SOS) certificates for nonnegative polynomials $p$ on $\mathbb{R}^d$ and their implications for polynomial optimization over unbounded domains. Building on Lasserre's perturbation approach, we consider SOS…

最优化与控制 · 数学 2026-03-17 Igor Klep , Victor Magron , Matthias Schötz

Putinar's Positivstellensatz is a central theorem in real algebraic geometry. It states the following: If you have a set $S= \{ x \in R^n \ | \ g_1 (x) \geq 0, ... , g_m(x) \geq 0\}$ described by some real polynomials $g_i$, then every real…

代数几何 · 数学 2016-03-23 Tom-Lukas Kriel

Let $p_{\min}$ denote the minimum of a polynomial $p$ over a (general) compact semialgebraic set $S \subseteq \mathbb{R}^n$. A standard way to approximate $p_{\min}$ is via hierarchies built from Positivstellens\"atze, which certify…

最优化与控制 · 数学 2026-05-21 Olga Heijmans-Kuryatnikova , Juan C. Vera , Luis F. Zuluaga

We extend previous results about Putinar's Positivstellensatz for cylinders of type $S \times {\mathbb R}$ to sets of type $S \times {\mathbb R}^r$ in some special cases taking into account $r$ and the degree of the polynomial with respect…

代数几何 · 数学 2021-05-20 Paula Escorcielo , Daniel Perrucci

This paper investigates Positivstellens\"atze for polynomial matrices subject to universally quantified polynomial matrix inequality constraints. We first establish a matrix-valued Positivstellensatz under the Archimedean condition,…

最优化与控制 · 数学 2026-04-03 Feng Guo , Jie Wang

In a first contribution, we revisit two certificates of positivity on (possibly non-compact) basic semialgebraic sets due to Putinar and Vasilescu [Comptes Rendus de l'Acad\'emie des Sciences-Series I-Mathematics, 328(6) (1999) pp.…

最优化与控制 · 数学 2019-12-09 Ngoc Hoang Anh Mai , Jean-Bernard Lasserre , Victor Magron

We consider certificates of positivity for univariate polynomials with rational coefficients that are positive over (an interval of)~$\mathbb{R}$. Such certificates take the form of weighted sums of squares (SOS) of polynomials with…

计算复杂性 · 计算机科学 2025-12-30 Matías Bender , Philipp Di Dio , Elias Tsigaridas

Real algebraic geometry provides certificates for the positivity of polynomials on semi-algebraic sets by expressing them as a suitable combination of sums of squares and the defining inequalitites. We show how Putinar's theorem for…

最优化与控制 · 数学 2014-02-26 Daniel Plaumann

The Schm\"udgen's Positivstellensatz gives a certificate to verify positivity of a strictly positive polynomial $f$ on a compact, basic, semi-algebraic set $\mathbf{K} \subset \mathbb{R}^n$. A Positivstellensatz of this type is called…

最优化与控制 · 数学 2024-12-19 Etienne de Klerk , Juan Vera Lizcano
‹ 上一页 1 2 3 10 下一页 ›