This book is an updated and extended version of Completely Positive Matrices (Abraham Berman and Naomi Shaked-Monderer, World Scientific 2003). It contains new sections on the cone of copositive matrices, which is the dual of the cone of completely positive matrices, and new results on both copositive matrices and completely positive matrices.The book is an up to date comprehensive resource for researchers in Matrix Theory and Optimization. It can also serve as a textbook for an advanced undergraduate or graduate course.

A real matrix is positive semidefinite if it can be decomposed as A = BBOC . In some applications the matrix B has to be elementwise nonnegative. If such a matrix exists, A is called completely positive. The smallest number of columns of a nonnegative matrix B such that A = BBOC is known as the cp- rank of A . This invaluable book focuses on necessary conditions and sufficient conditions for complete positivity, as well as bounds for the cp- rank. The methods are combinatorial, geometric and algebraic. The required background on nonnegative matrices, cones, graphs and Schur complements is outlined. Contents: Preliminaries: Matrix Theoretic Background; Positive Semidefinite Matrices; Nonnegative Matrices and M -Matrices; Schur Complements; Graphs; Convex Cones; The PSD Completion Problem; Complete Positivity: Definition and Basic Properties; Cones of Completely Positive Matrices; Small Matrices; Complete Positivity and the Comparison Matrix; Completely Positive Graphs; Completely Positive Matrices Whose Graphs are Not Completely Positive; Square Factorizations; Functions of Completely Positive Matrices; The CP Completion Problem; CP Rank: Definition and Basic Results; Completely Positive Matrices of a Given Rank; Completely Positive Matrices of a Given Order; When is the CP-Rank Equal to the Rank?. Readership: Upper level undergraduates, graduate students, academics and researchers interested in matrix theory."

A real matrix is positive semidefinite if it can be decomposed as A=BB′. In some applications the matrix B has to be elementwise nonnegative. If such a matrix exists, A is called completely positive. The smallest number of columns of a nonnegative matrix B such that A=BB′ is known as the cp-rank of A.This invaluable book focuses on necessary conditions and sufficient conditions for complete positivity, as well as bounds for the cp-rank. The methods are combinatorial, geometric and algebraic. The required background on nonnegative matrices, cones, graphs and Schur complements is outlined.

Tensors, or hypermatrices, are multi-arrays with more than two indices. In the last decade or so, many concepts and results in matrix theory?some of which are nontrivial?have been extended to tensors and have a wide range of applications (for example, spectral hypergraph theory, higher order Markov chains, polynomial optimization, magnetic resonance imaging, automatic control, and quantum entanglement problems). The authors provide a comprehensive discussion of this new theory of tensors. Tensor Analysis: Spectral Theory and Special Tensors is unique in that it is the first book on these three subject areas: spectral theory of tensors; the theory of special tensors, including nonnegative tensors, positive semidefinite tensors, completely positive tensors, and copositive tensors; and the spectral hypergraph theory via tensors. ?

This comprehensive reference, for mathematical, engineering and social scientists, covers matrix positivity classes and their applications.

Mathematical optimization encompasses both a rich and rapidly evolving body of fundamental theory, and a variety of exciting applications in science and engineering. The present book contains a careful selection of articles on recent advances in optimization theory, numerical methods, and their applications in engineering. It features in particular new methods and applications in the fields of optimal control, PDE-constrained optimization, nonlinear optimization, and convex optimization. The authors of this volume took part in the 14th Belgian-French-German Conference on Optimization (BFG09) organized in Leuven, Belgium, on September 14-18, 2009. The volume contains a selection of reviewed articles contributed by the conference speakers as well as three survey articles by plenary speakers and two papers authored by the winners of the best talk and best poster prizes awarded at BFG09. Researchers and graduate students in applied mathematics, computer science, and many branches of engineering will find in this book an interesting and useful collection of recent ideas on the methods and applications of optimization.

An accessible introduction to convex algebraic geometry and semidefinite optimization. For graduate students and researchers in mathematics and computer science.