Factorization and cutting planes for completely positive matrices by copositive projection

We consider the problem of projecting a matrix onto the cones of copositive and completely positive matrices. As this can not be done directly, we use polyhedral approximations of the cones. With the help of these projections we obtain a technique to compute factorizations of completely positive matrices. We also describe a method to determine a cutting plane which cuts off an arbitrary matrix from the completely positive (or copositive) cone.     

Geometry of the copositive and completely positive cones

The copositive cone, and its dual the completely positive cone, have useful applications in optimisation, however telling if a general matrix is in the copositive cone is a co-NP-complete problem. In this paper we analyse some of the geometry of these cones. We discuss a way of representing all the maximal faces of the copositive cone along with a simple equation for the dimension of each one. In doing this we show that the copositive cone has faces which are isomorphic to positive semidefinite cones. We also look at some maximal faces of the completely positive cone and find their dimensions. Additionally we consider extreme rays of the copositive and completely positive cones and show that every extreme ray of the completely positive cone is also an exposed ray, but the copositive cone has extreme rays which are not exposed rays.     

Representations of invariant multilinear maps on HilbertC*-modules

The definition of a completely positive invariant multilinear map from aC*-algebra to another is introduced. We construct the representation of a completely positive invariant multilinear map on a HilbertC*-module without the bridging maps. This is another extension of the Stinespring’s representation, which is different from a multilinear representation of Christensen and Sinclair. We give the covariant representation of completely positive invariant covariant multilinear maps on a HilbertC*-module. Further, we investigate the order structure of such maps and obtain a generalization of the Radon-Nikodym theorem. Partially supported by GARC-KOSEF.     

Nilpotent completely positive maps

We study the structure of nilpotent completely positive maps in terms of Choi-Kraus coefficients. We prove several inequalities, including certain majorization type inequalities for dimensions of kernels of powers of nilpotent completely positive maps.     

A continuity theorem for Stinespring's dilation

We show a continuity theorem for Stinespring's dilation: two completely positive maps between arbitrary C^∗-algebras are close in cb-norm if and only if we can find corresponding dilations that are close in operator norm. The proof establishes the equivalence of the cb-norm distance and the Bures distance for completely positive maps. We briefly discuss applications to quantum information theory.     

Complete controllability and contractibility in multimodal systems

The concept of a strictly positive definite set of Hermitian matrices is introduced. It is shown that a strictly positive definite set is always a positive definite set, and conditions are found under which a positive definite set is strictly positive definite. We also show that a set of Hermitian matrices is strictly positive definite if and only if some nonnegative linear combination of these matrices is a positive definite matrix. For state dimension two, we use this concept to find necessary and sufficient conditions for a two-mode completely controllable irreducible multimodal system to be contractible relative to an elliptic norm. For general state dimensions, we give necessary and sufficient conditions for a special-type two-mode completely controllable irreducible system to be contractible relative to a weakly monotone norm. Applying the above results, we show that, for state dimension two, there exists a completely controllable two-mode system which is not contractible relative to either an elliptic or a weakly monotone norm. We leave open the question whether or not complete controllability implies contractibility, relative to some norm, for multimodal systems of two or more modes.     

Lower Bounds on Matrix Factorization Ranks via Noncommutative Polynomial Optimization

We use techniques from (tracial noncommutative) polynomial optimization to formulate hierarchies of semidefinite programming lower bounds on matrix factorization ranks. In particular, we consider the nonnegative rank, the positive semidefinite rank, and their symmetric analogs: the completely positive rank and the completely positive semidefinite rank. We study convergence properties of our hierarchies, compare them extensively to known lower bounds, and provide some (numerical) examples.

     

A class of generalized positive linear maps on matrix algebras

We construct a class of positive linear maps on matrix algebras. We find conditions when these maps are atomic, decomposable and completely positive. We obtain a large class of atomic positive linear maps. As applications in quantum information theory, we discuss the structural physical approximation and optimality of entanglement witness associated with these maps.     

Fixed space of positive trace-preserving super-operators

We examine the fixed space of positive trace-preserving super-operators. We describe a specific structure that this space must have and what the projection onto it must look like. We show how these results, in turn, lead to an alternative proof of the complete characterization of the fixed space of completely positive trace-preserving super-operators.     

The Spectrum of Completely Positive Entropy Actions of Countable Amenable Groups

We prove that an ergodic free action of a countable discrete amenable group with completely positive entropy has a countable Lebesgue spectrum. Our approach is based on the Rudolph-Weiss result on the equality of conditional entropies for actions of countable amenable groups with the same orbits. Relative completely positive entropy actions are also considered. An application to the entropic properties of Gaussian actions of countable discrete abelian groups is given.     

A simplified completely positive reformulation for binary quadratic programs

In this paper, we propose a simplified completely positive programming reformulation for binary quadratic programs. The linear equality constraints associated with the binary constraints in the original problem can be aggregated into a single linear equality constraint without changing the feasible set of the classic completely positive reformulation proposed in the literature. We also show that the dual of the proposed simplified formulation is strictly feasible under a mild assumption.     

The completely positive and doubly nonnegative completion problems

We prove the following. Let G be an undirected graph. Every partially specified symmetric matrix, the graph of whose specified entries is G and each of whose fully specified submatrices is completely positive (equal to BB^T for some entrywise nonnegative matrix B), may be completed to a completely positive matrix if and only if G is a block-clique graph (a chordal graph in which distinct maximal cliques overlap in at most one vertex). The same result holds for matrices that are doubly nonnegative (entrywise nonnegative and positive semidefinite).     

Bernoulli actions of sofic groups have completely positive entropy

We prove that every Bernoulli action of a sofic group has completely positive entropy with respect to every sofic approximation net. We also prove that every Bernoulli action of a finitely generated free group has the property that each of its nontrivial factors with a finite generating partition has positive f-invariant.     

Completely positive completion of partial matrices whose entries are completely bounded maps

We study completion problems of partial matrices associated with a graph where entries are completely bounded maps on aC ^*-algebra. We characterize a graph for which every -partial completely positive matrix has a completely positive completion. As a special case we study -partial functional matrices. We give a necessary and sufficient condition for a -partial functional matrix to have a positive completion and a representation for such matrices. These generalize some results on inflated Schur product maps due to Paulsen, Power and Smith. As an application, we study completely positive completions of partial matrices whose entries are completely bounded multipliers of the Fourier algebra of a locally compact group.     

σ-C~-代数中的正映射

本文中我们研究了     

A semidefinite algorithm for completely positive tensor decomposition

A symmetric tensor, which has a symmetric nonnegative decomposition, is called a completely positive tensor. In this paper, we characterize the completely positive tensor as a truncated moment sequence, and transform the problem of checking whether a tensor is completely positive to checking whether its corresponding truncated moment sequence admits a representing measure, then present a semidefinite algorithm to solve it. If a tensor is not completely positive, a certificate for it can be obtained; if it is completely positive, a nonnegative decomposition can be obtained.     

Completely positive tensors in the complex field

In this paper, we introduce the complex completely positive tensor, which has a symmetric complex decomposition with all real and imaginary parts of the decomposition vectors being non-negative. Some properties of the complex completely positive tensor are given. A semidefinite algorithm is also proposed for checking whether a complex tensor is complex completely positive or not. If a tensor is not complex completely positive, a certificate for it can be obtained; if it is complex completely positive, a complex completely positive decomposition can be obtained.     

Completely J —positive linear systems of finite order

Completely J — positive linear systems of finite order are introduced as a generalization of completely symmetric linear systems. To any completely J — positive linear system of finite order there is associated a defining measure with respect to which the transfer function has a certain integral representation. It is proved that these systems are asymptotically stable. The observability and reachability operators obey a certain duality rule and the number of negative squares of the Hankel operator is estimated. The Hankel operator is bounded if and only if a certain measure associated with the defining measure is of Carleson type. We prove that a real symmetric operator valued function which is analytic outside the unit disk has a realization with a completely J — symmetric linear space which is reachable, observable and parbalanced. Uniqueness and spectral minimality of the completely J — symmetric realizations are discussed.     

Completely positive reformulations for polynomial optimization

Polynomial optimization encompasses a very rich class of problems in which both the objective and constraints can be written in terms of polynomials on the decision variables. There is a well established body of research on quadratic polynomial optimization problems based on reformulations of the original problem as a conic program over the cone of completely positive matrices, or its conic dual, the cone of copositive matrices. As a result of this reformulation approach, novel solution schemes for quadratic polynomial optimization problems have been designed by drawing on conic programming tools, and the extensively studied cones of completely positive and of copositive matrices. In particular, this approach has been applied to solve key combinatorial optimization problems. Along this line of research, we consider polynomial optimization problems that are not necessarily quadratic. For this purpose, we use a natural extension of the cone of completely positive matrices; namely, the cone of completely positive tensors. We provide a general characterization of the class of polynomial optimization problems that can be formulated as a conic program over the cone of completely positive tensors. As a consequence of this characterization, it follows that recent related results for quadratic problems can be further strengthened and generalized to higher order polynomial optimization problems. Also, we show that the conditions underlying the characterization are conceptually the same, regardless of the degree of the polynomials defining the problem. To illustrate our results, we discuss in further detail special and relevant instances of polynomial optimization problems.