中文
相关论文

相关论文: A Complete Characterization of the Gap between Con…

200 篇论文

In this paper, we study polynomial norms, i.e. norms that are the $d^{\text{th}}$ root of a degree-$d$ homogeneous polynomial $f$. We first show that a necessary and sufficient condition for $f^{1/d}$ to be a norm is for $f$ to be strictly…

最优化与控制 · 数学 2018-07-18 Amir Ali Ahmadi , Etienne de Klerk , Georgina Hall

A multivariate polynomial $p(x)=p(x_1,...,x_n)$ is sos-convex if its Hessian $H(x)$ can be factored as $H(x)= M^T(x) M(x)$ with a possibly nonsquare polynomial matrix $M(x)$. It is easy to see that sos-convexity is a sufficient condition…

最优化与控制 · 数学 2012-09-19 Amir Ali Ahmadi , Pablo A. Parrilo

In this article, we are interested in developing polynomial decomposition techniques based on sums-of-squares (SOS), namely the difference-of-sums-of-squares (D-SOS) and the difference-of-convex-sums-of-squares (DC-SOS). In particular, the…

最优化与控制 · 数学 2024-02-21 Yi-Shuai Niu , Hoai An Le Thi , Dinh Tao Pham

We provide explicit conditions for a real polynomial $f$ of degree 2d to be a sum of squares (s.o.s.), stated only in terms of the coefficients of $f$, i.e. with no lifting. All conditions are simple and provide an explicit description of a…

代数几何 · 数学 2007-05-23 Jean B. Lasserre

We review several (and provide new) results on the theory of moments, sums of squares and basic semi-algebraic sets when convexity is present. In particular, we show that under convexity, the hierarchy of semidefinite relaxations for…

最优化与控制 · 数学 2008-12-04 Jean B. Lasserre

We exhibit families of $4$-CNF formulas over $n$ variables that have sums-of-squares (SOS) proofs of unsatisfiability of degree (a.k.a. rank) $d$ but require SOS proofs of size $n^{\Omega(d)}$ for values of $d = d(n)$ from constant all the…

计算复杂性 · 计算机科学 2015-04-08 Massimo Lauria , Jakob Nordström

For given integers $n$ and $d$, both at least 2, we consider a homogeneous multivariate polynomial $f_d$ of degree $d$ in variables indexed by the edges of the complete graph on $n$ vertices and coefficients depending on cardinalities of…

组合数学 · 数学 2022-05-09 Sven Polak

Hilbert proved in 1888 that a positive semi-definite (PSD) homogeneous quartic polynomial of three variables always can be expressed as the sum of squares (SOS) of three quadratic polynomials, and a psd homogeneous quartic polynomial of…

最优化与控制 · 数学 2025-07-18 Chunfeng Cui , Liqun Qi , Yi Xu

Hilbert proved in 1888 that a positive semidefinite (psd) real form is a sum of squares (sos) of real forms if and only if $n=2$ or $d=1$ or $(n,2d)=(3,4)$, where $n$ is the number of variables and $2d$ the degree of the form. We study the…

代数几何 · 数学 2016-11-03 Charu Goel , Salma Kuhlmann , Bruce Reznick

In this paper, we first consider the graph of $(F_1,F_{2},\cdots,F_{n})$ on $\overline{\mathbb{D}}^{n},$ where $F_{j}(z)=\bar{z}^{m_{j}}_{j}+R_{j}(z),j=1,2,\cdots,n,$ which has non-isolated CR-singularities if $m_{j}>1$ for some…

复变函数 · 数学 2022-10-14 Golam Mostafa Mondal

A popular numerical method to compute SOS (sum of squares of polynomials) decompositions for polynomials is to transform the problem into semi-definite programming (SDP) problems and then solve them by SDP solvers. In this paper, we focus…

最优化与控制 · 数学 2015-01-05 Liyun Dai , Bican Xia

We introduce a family of symmetric convex bodies called generalized ellipsoids of degree $d$ (GE-$d$s), with ellipsoids corresponding to the case of $d=0$. Generalized ellipsoids (GEs) retain many geometric, algebraic, and algorithmic…

最优化与控制 · 数学 2025-07-01 Amir Ali Ahmadi , Abraar Chaudhry , Cemil Dibek

We study SOS properties of biquadratic forms. For the class of partially symmetric biquadratic forms, we establish necessary and sufficient conditions for positive semi-definiteness and prove that every PSD partially symmetric biquadratic…

最优化与控制 · 数学 2026-01-21 Liqun Qi , Chunfeng Cui , Yi Xu

Certifying nonnegativity of polynomials is a well-known NP-hard problem with direct applications spanning non-convex optimization, control, robotics, and beyond. A sufficient condition for nonnegativity is the Sum of Squares (SOS) property,…

机器学习 · 计算机科学 2025-10-16 Nico Pelleriti , Christoph Spiegel , Shiwei Liu , David Martínez-Rubio , Max Zimmer , Sebastian Pokutta

In this paper, we investigate the solubility of homogeneous polynomial equations. The work of Browning, Le boudec, Sawin [3] shows that almost all homogeneous equations of degree $d\geq 4$ in $d+1$ or more variables satisfy the Hasse…

数论 · 数学 2025-09-10 Kiseok Yeon

The cone $\mathcal{P}_{n+1,2d}$ ($n,d\in\mathbb{N}$) of all positive semidefinite (PSD) real forms in $n+1$ variables of degree $2d$ contains the subcone $\Sigma_{n+1,2d}$ of those that are representable as finite sums of squares (SOS) of…

代数几何 · 数学 2023-03-24 Charu Goel , Sarah Hess , Salma Kuhlmann

We study the boundary of the cone of real polynomials that can be decomposed as a sum of squares (SOS) of real polynomials. This cone is included in the cone of nonnegative polynomials and both cones share a part of their boundary, which…

代数几何 · 数学 2023-06-14 Santiago Laplagne , Marcelo Valdettaro

Let a and x denote tuples of (jointly) freely noncommuting variables. A square matrix valued polynomial p in these variables is naturally evaluated at a tuple (A,X) of symmetric matrices with the result p(A,X) a square matrix. The…

泛函分析 · 数学 2017-06-21 Harry Dym , J. William Helton , Scott McCullough

We show that if a polynomial $f\in \mathbb{R}[x_1,\ldots,x_n]$ is nonnegative on a closed basic semialgebraic set $X=\{x\in\mathbb{R}^n:g_1(x)\ge 0,\ldots,g_r (x)\ge 0\}$, where $g_1,\ldots,g_r\in\mathbb{R}[x_1,\ldots,x_n]$, then $f$ can be…

代数几何 · 数学 2015-07-23 Krzysztof Kurdyka , Stanisław Spodzieja

In this article, we combine sums of squares (SOS) and sums of nonnegative circuit (SONC) forms, two independent nonnegativity certificates for real homogeneous polynomials. We consider the convex cone SOS+SONC of forms that decompose into a…

代数几何 · 数学 2024-12-17 Mareike Dressler , Salma Kuhlmann , Moritz Schick
‹ 上一页 1 2 3 10 下一页 ›