中文
相关论文

相关论文: Gram-like matrix preserving extensions and complet…

200 篇论文

Some sum of squares (SOS) polynomials admit decomposition certificates, or positive semidefinite Gram matrices, with additional structure. In this work, we use the structure of Gram matrices to relate the representation theory of $SL(2)$ to…

最优化与控制 · 数学 2024-07-30 Mitchell Tong Harris

Representations of nonnegative polynomials as sums of squares are central to real algebraic geometry and the subject of active research. The sum-of-squares representations of a given polynomial are parametrized by the convex body of…

代数几何 · 数学 2018-05-03 Lynn Chua , Daniel Plaumann , Rainer Sinn , Cynthia Vinzant

We consider the problem of extending the classical S-lemma from commutative case to noncommutative cases. We show that a symmetric quadratic homogeneous matrix-valued polynomial is positive semidefinite if and only if its coefficient matrix…

最优化与控制 · 数学 2022-07-06 Feng Guo , Sizhuo Yan , Lihong Zhi

A real symmetric matrix $M$ is completely positive semidefinite if it admits a Gram representation by (Hermitian) positive semidefinite matrices of any size $d$. The smallest such $d$ is called the (complex) completely positive semidefinite…

最优化与控制 · 数学 2016-10-27 Sander Gribling , David de Laat , Monique Laurent

We investigate structural properties of the completely positive semidefinite cone $\mathcal{CS}_+^n$, consisting of all the $n \times n$ symmetric matrices that admit a Gram representation by positive semidefinite matrices of any size. This…

最优化与控制 · 数学 2015-02-11 Sabine Burgdorf , Monique Laurent , Teresa Piovesan

We say that a symmetric noncommutative polynomial in the noncommutative free variables (x_1, x_2, ..., x_g) is noncommutative plurisubharmonic on a noncommutative open set if it has a noncommutative complex hessian that is positive…

算子代数 · 数学 2011-01-17 Jeremy M. Greene

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

Positive semidefinite Hermitian matrices that are not fully specified can be completed provided their underlying graph is chordal. If the matrix is positive definite the completion can be uniquely characterized as the matrix that maximizes…

环与代数 · 数学 2021-12-08 Olaf Dreyer

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 show that a matrix is a Hermitian positive semidefinite matrix whose nonzero entries have modulus 1 if and only if it similar to a direct sum of all $1's$ matrices and a 0 matrix via a unitary monomial similarity. In particular, the only…

环与代数 · 数学 2007-05-23 Daniel Hershkowitz , Michael Neumann , Hans Schneider

We consider symmetric polynomials, p, in the noncommutative free variables (x_1, x_2, ..., x_g). We define the noncommutative complex hessian of p and we call a noncommutative symmetric polynomial noncommutative plurisubharmonic if it has a…

算子代数 · 数学 2011-01-17 Jeremy M. Greene , J. William Helton , Victor Vinnikov

This paper introduces a notion of decomposition and completion of sum-of-squares (SOS) matrices. We show that a subset of sparse SOS matrices with chordal sparsity patterns can be equivalently decomposed into a sum of multiple SOS matrices…

最优化与控制 · 数学 2020-01-13 Yang Zheng , Giovanni Fantuzzi , Antonis Papachristodoulou

We show that every real nonnegative polynomial $f$ can be approximated as closely as desired by a sequence of polynomials $\{f_\epsilon\}$ that are sums of squares. Each $f_\epsilon$ has a simple et explicit form in terms of $f$ and…

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

Let M be an archimedean quadratic module of real t-by-t matrix polynomials in n variables, and let S be the set of all real n-tuples where each element of M is positive semidefinite. Our key finding is a natural bijection between the set of…

算子代数 · 数学 2011-04-19 Igor Klep , Markus Schweighofer

In this chapter we present the sums of Hermitian squares approach to noncommutative polynomial optimization problems. This is an extension of the sums of squares approach for polynomial optimization arising from real algebraic geometry. We…

最优化与控制 · 数学 2021-09-03 Abhishek Bhardwaj , Igor Klep , Victor Magron

Certifying the positivity of trigonometric polynomials is of first importance for design problems in discrete-time signal processing. It is well known from the Riesz-Fej\'ez spectral factorization theorem that any trigonometric univariate…

符号计算 · 计算机科学 2023-10-05 Victor Magron , Mohab Safey El Din , Markus Schweighofer , Trung Hieu Vu

These lecture notes provide an informal introduction to the theory of nonnegative polynomials and sums of squares. We highlight the history and some recent developments, especially the new connections with classical (complex) algebraic…

代数几何 · 数学 2021-06-01 Grigoriy Blekherman , Jannik Wesner

We consider two seemingly unrelated questions: the relationship between nonnegative polynomials and sums of squares on real varieties, and sparse semidefinite programming. This connection is natural when a real variety $X$ is defined by a…

代数几何 · 数学 2021-06-15 Grigoriy Blekherman , Kevin Shu

This paper studies the representations of a non-negative polynomial $f$ on a non-compact semi-algebraic set $K$ modulo its critical ideal. Under the assumptions that the semi-algebraic set $K$ is regular and $f$ satisfies the boundary…

代数几何 · 数学 2011-12-20 Dang Tuan Hiep

In this article we develop new methods for exhibiting convex semialgebraic sets that are not spectrahedral shadows. We characterize when the set of nonnegative polynomials with a given support is a spectrahedral shadow in terms of sums of…

环与代数 · 数学 2024-07-22 Manuel Bodirsky , Mario Kummer , Andreas Thom
‹ 上一页 1 2 3 10 下一页 ›