English
Related papers

Related papers: On the closure of the completely positive semidefi…

200 papers

We investigate the completely positive semidefinite cone $\mathcal{CS}_+^n$, a new matrix cone consisting of all $n\times n$ matrices that admit a Gram representation by positive semidefinite matrices (of any size). In particular we study…

Optimization and Control · Mathematics 2015-10-06 Monique Laurent , Teresa Piovesan

A symmetric matrix $A$ is completely positive (CP) if there exists an entrywise nonnegative matrix $B$ such that $A = BB^T$. We characterize the interior of the CP cone. A semidefinite algorithm is proposed for checking interiors of the CP…

Optimization and Control · Mathematics 2014-01-08 Anwa Zhou , Jinyan Fan

Positive semidefinite (PSD) cone is the cone of positive semidefinite matrices, and is the object of interest in semidefinite programming (SDP). A computational efficient approximation of the PSD cone is the $k$-PSD closure, $1 \leq k < n$,…

Optimization and Control · Mathematics 2024-05-03 Avinash Bhardwaj , Vishnu Narayanan , Abhishek Pathapati

This chapter investigates the cone of copositive matrices, with a focus on the design and analysis of conic inner approximations for it. These approximations are based on various sufficient conditions for matrix copositivity, relying on…

Optimization and Control · Mathematics 2023-03-21 Luis Felipe Vargas , Monique Laurent

We study the cone of completely positive (cp) matrices for the first interesting case $n = 5$. This is a semialgebraic set, which means that the polynomial equalities and inequlities that define its boundary can be derived. We characterize…

Optimization and Control · Mathematics 2021-09-02 Max Pfeffer , Jose Alejandro Samper

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…

Optimization and Control · Mathematics 2016-10-27 Sander Gribling , David de Laat , Monique Laurent

We provide convergent hierarchies for the cone C of copositive matrices and its dual, the cone of completely positive matrices. In both cases the corresponding hierarchy consists of nested spectrahedra and provide outer (resp. inner)…

Optimization and Control · Mathematics 2012-01-20 Jean Bernard Lasserre

An $n\times n$ symmetric matrix $A$ is copositive if the quadratic form $x^TAx$ is nonnegative on the nonnegative orthant $\mathbb{R}^{n}_{\geq 0}$. The cone of copositive matrices contains the cone of matrices which are the sum of a…

Functional Analysis · Mathematics 2025-02-28 Tea Štrekelj , Aljaž Zalar

For a proper cone $K$ and its dual cone $K^*$ in $\mathbb R^n$, the complementarity set of $K$ is defined as ${\mathbb C}(K)=\{(x,y): x\in K,\; y\in K^*,\, x^\top y=0\}$. It is known that ${\mathbb C}(K)$ is an $n$-dimensional manifold in…

Optimization and Control · Mathematics 2025-02-06 O. I. Kostyukova

An alternative, geometrical proof of a known theorem concerning the decomposition of positive maps of the matrix algebra $M_{2}(\mathbb{C})$ has been presented. The premise of the proof is the identification of positive maps with operators…

Mathematical Physics · Physics 2015-06-04 Marek Miller , Robert Olkiewicz

In this paper we give a first study of perfect copositive $n \times n$ matrices. They can be used to find rational certificates for completely positive matrices. We describe similarities and differences to classical perfect, positive…

Metric Geometry · Mathematics 2024-02-14 Valentin Dannenberg , Achill Schürmann

The objective of this manuscript is to understand the structure of an invertible linear map on the space of real symmetric matrices $\mathcal{S}^n$ that leaves invariant the closed convex cones of copositive and completely positive matrices…

Functional Analysis · Mathematics 2023-03-07 Sachindranath Jayaraman , Vatsalkumar N. Mer

Copositive and completely positive matrices play an increasingly important role in Applied Mathematics, namely as a key concept for approximating NP-hard optimization problems. The cone of copositive matrices of a given order and the cone…

Optimization and Control · Mathematics 2017-01-31 Naomi Shaked-Monderer , Abraham Berman , Immanuel M. Bomze , Florian Jarre , Werner Schachinger

Given a positive noncommutative polynomial $f$, equivalently a sum of Hermitian squares (SOHS), there exists a positive semidefinite Gram matrix that encrypts all the structural essence of $f$. There are no available methods for extending a…

Optimization and Control · Mathematics 2025-06-30 Arijit Mukherjee , Arindam Sutradhar

The numerical range of a matrix is studied geometrically via the cone of positive semidefinite matrices (or semidefinite cone for short). In particular it is shown that the feasible set of a two-dimensional linear matrix inequality (LMI),…

Optimization and Control · Mathematics 2010-04-08 Didier Henrion

The numerical range of a matrix is studied geometrically via the cone of positive semidefinite matrices (or semidefinite cone for short). In particular it is shown that the feasible set of a two-dimensional linear matrix inequality (LMI),…

Optimization and Control · Mathematics 2008-12-10 Didier Henrion

Given a proper cone $K$ in the Euclidean space $\mathbb{R}^n$, a square matrix $A$ is said to be $K$-semipositive if there exists an $x\in K$ such that $Ax\in \text{int}(K)$, the topological interior of $K$. The paper aims to study…

Rings and Algebras · Mathematics 2023-03-02 Aritra Narayan Hisabia , Manideepa Saha

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…

Optimization and Control · Mathematics 2024-07-30 Mitchell Tong Harris

An $n\times n$ symmetric matrix $A$ is copositive if the quadratic form $x^TAx$ is nonnegative on the nonnegative orthant. The cone of copositive matrices strictly contains the cone of completely positive matrices, i.e., all matrices of the…

Functional Analysis · Mathematics 2024-12-04 Igor Klep , Tea Štrekelj , Aljaž Zalar

The problem of matrix completion and decomposition in the cone of positive semidefinite (PSD) matrices is a well-understood problem, with many important applications in areas such as linear algebra, optimization, and control theory. This…

Optimization and Control · Mathematics 2025-07-28 Ding Zhang , Axel Ringh , Li Qiu
‹ Prev 1 2 3 10 Next ›