scientific article; zbMATH DE number 1933860
From MaRDI portal
Publication:4405832
zbMath1030.15022MaRDI QIDQ4405832
Abraham Berman, Naomi Shaked-Monderer
Publication date: 24 June 2003
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
matrix completionSchur complementtextbookgraphsfactorizationPerron-Frobenius theoryexercisescompletely positive matrixcp-rankmatrix cones
Factorization of matrices (15A23) Positive matrices and their generalizations; cones of matrices (15B48) Vector spaces, linear dependence, rank, lineability (15A03) Stochastic matrices (15B51) Research exposition (monographs, survey articles) pertaining to linear algebra (15-02)
Related Items
On the number of CP factorizations of a completely positive matrix, Distance matrix of a multi-block graph: determinant and inverse, Packing Under Convex Quadratic Constraints, Matrix Relaxations in Combinatorial Optimization, Unnamed Item, Conic Approach to Quantum Graph Parameters Using Linear Optimization Over the Completely Positive Semidefinite Cone, A new approach to synchronization analysis of linearly coupled map lattices, Reflection Methods for Inverse Problems with Applications to Protein Conformation Determination, Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions, Rational factorizations of completely positive matrices, A bound on the Carathéodory number, Completely positive factorization by a Riemannian smoothing method, Completely positive completely positive maps (and a resource theory for non-negativity of quantum amplitudes), Approximate completely positive semidefinite factorizations and their ranks, Preservers of completely positive matrix rank for inclines, Completely positive graphs and entanglement of quantum states, A characterization for the self-duality of proper cones, Dehomogenization for completely positive tensors, Optimization under uncertainty and risk: quadratic and copositive approaches, Conic optimization-based algorithms for nonnegative matrix factorization, Completely Positive Binary Tensors, Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems, Self-Dual Polyhedral Cones and Their Slack Matrices, Sparse conic reformulation of structured QCQPs based on copositive optimization with applications in stochastic optimization, The cone of \(5 \times 5\) completely positive matrices, Advance selling under uncertain supply and demand: a robust newsvendor perspective, Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting), Symmetric nonnegative matrix trifactorization, Copositive programming via semi-infinite optimization, Factorization and cutting planes for completely positive matrices by copositive projection, Unbounded convex sets for non-convex mixed-integer quadratic programming, Structured low-rank approximation and its applications, Disruption Risk Mitigation in Supply Chains: The Risk Exposure Index Revisited, Mixed states in one spatial dimension: Decompositions and correspondence with nonnegative matrices, Faces of the 5 × 5 completely positive cone, Correlation matrices, Clifford algebras, and completely positive semidefinite rank, Assignment Flows, Geometry of the Copositive Tensor Cone and its Dual, Uniqueness of Nonnegative Matrix Factorizations by Rigidity Theory, Bounds for the completely positive rank of a symmetric matrix over a tropical semiring, On Common Linear/Quadratic Lyapunov Functions for Switched Linear Systems, The CP-Matrix Approximation Problem, Generation of Correlated Spike Trains, Copositive Programming, Optimality conditions for linear copositive programming problems with isolated immobile indices, Reformulation of the Quadratic Multidimensional Knapsack Problem as Copositive/Completely Positive Prorams, Profit Sharing Agreements in Decentralized Supply Chains: A Distributionally Robust Approach, Unnamed Item, Factorization of cp-rank-3 completely positive matrices, Pairwise Completely Positive Matrices and Conjugate Local Diagonal Unitary Invariant Quantum States, Completely Positive Tensors: Properties, Easily Checkable Subclasses, and Tractable Relaxations, Trust Your Data or Not—StQP Remains StQP: Community Detection via Robust Standard Quadratic Optimization, Semidefinite Programming and Nash Equilibria in Bimatrix Games, Lower bounds on matrix factorization ranks via noncommutative polynomial optimization, Unnamed Item, Estimation of positive definite \(M\)-matrices and structure learning for attractive Gaussian Markov random fields, Completely positive matrices over Boolean algebras and their CP-rank, A gentle, geometric introduction to copositive optimization, SymNMF: nonnegative low-rank approximation of a similarity matrix for graph clustering, Optimality conditions for nonsmooth semidefinite programming via convexificators, Off-diagonal symmetric nonnegative matrix factorization, SPN completable graphs, Nonnegative square roots of matrices, Passive linear continuous-time systems: characterization through structure, Cutting planes for semidefinite relaxations based on triangle-free subgraphs, Distance matrix of a class of completely positive graphs: determinant and inverse, Completely positive rooted matrices, Tridiagonal doubly stochastic matrices, Distributionally robust mixed integer linear programs: persistency models with applications, Computing the distance between the linear matrix pencil and the completely positive cone, The difference between \(5\times 5\) doubly nonnegative and completely positive matrices, Bernoulli and tail-dependence compatibility, Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank, Zero-one completely positive matrices and the \(\mathcal A(R, S)\) classes, Bounding the separable rank via polynomial optimization, Completely positive tensor recovery with minimal nuclear value, SPN graphs: when copositive = SPN, A note on the linearly and quadratically weighted kappa coefficients, Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems, On strong duality in linear copositive programming, A note on the computation of the CP-rank, Triangle-free graphs and completely positive matrices, A polynomial-time algorithm for computing low CP-rank decompositions, Matrices with high completely positive semidefinite rank, LP-based tractable subcones of the semidefinite plus nonnegative cone, Quadratic programs with hollows, Measuring frequency domain Granger causality for multiple blocks of interacting time series, The \(\mathrm{PPT}^2\) conjecture holds for all Choi-type maps, A variational approach of the rank function, Completely positive factorizations associated with Euclidean distance matrices corresponding to an arithmetic progression, A factorization method for completely positive matrices, Immobile indices and CQ-free optimality criteria for linear copositive programming problems, On the definition, stationary distribution and second order structure of positive semidefinite Ornstein-Uhlenbeck type processes, Moment approximations for set-semidefinite polynomials, Symmetric nonnegative tensors and copositive tensors, Matrices attaining the minimum semidefinite rank of a chordal graph, The automorphism group of a completely positive cone and its Lie algebra, Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures, A fresh CP look at mixed-binary QPs: new formulations and relaxations, From seven to eleven: completely positive matrices with high cp-rank, On vector configurations that can be realized in the cone of positive matrices, Partially positive matrices, Interiors of completely positive cones, Separating doubly nonnegative and completely positive matrices, Separation and relaxation for cones of quadratic forms, Hermitian completely positive matrices, Completely positive tensors in the complex field, Copositive optimization -- recent developments and applications, Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization, Representing quadratically constrained quadratic programs as generalized copositive programs, A note on Burer's copositive representation of mixed-binary QPs, Completely positive house matrices, Computing symmetric nonnegative rank factorizations, On the computational complexity of membership problems for the completely positive cone and its dual, On the bilinearity rank of a proper cone and Lyapunov-like transformations, Inequalities for doubly nonnegative functions, Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017, A graphical calculus for integration over random diagonal unitary matrices, The \(\mathcal A\)-truncated \(K\)-moment problem, The structure of completely positive matrices according to their CP-rank and CP-plus-rank, Analysis of copositive optimization based linear programming bounds on standard quadratic optimization, \(\{0,1\}\) completely positive tensors and multi-hypergraphs, Positively factorizable maps, Structured nonnegative matrix factorization with applications to hidden Markov realization and clustering, Total positivity of sums, Hadamard products and Hadamard powers: results and counterexamples, A semidefinite algorithm for completely positive tensor decomposition, Linear conic formulations for two-party correlations and values of nonlocal games, Completely positive matrices: real, rational, and integral, Nonnegative rank factorization -- a heuristic approach via rank reduction, An alternative proof of the Barker, Berman, Plemmons (BBP) result on diagonal stability and extensions, On the geometric interpretation of the nonnegative rank, Geometry of the copositive and completely positive cones, Quadratic factorization heuristics for copositive programming, \(5 \times 5\) completely positive matrices, On reduced rank nonnegative matrix factorization for symmetric nonnegative matrices, \(\{0,1\}\) completely positive matrices, A note on ``\(5\times 5\) completely positive matrices, A hierarchy of semidefinite relaxations for completely positive tensor optimization problems, Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone, Completely positive semidefinite rank, Building a completely positive factorization, On \(\{0,1\}\) CP tensors and CP pseudographs, Algorithms for positive semidefinite factorization, Completely positive cones: are they facially exposed?, Geometric aspects of the symmetric inverse M-matrix problem, Monotonically positive matrices, Lower bounds on nonnegative rank via nonnegative nuclear norms, Linear optimization with cones of moments and nonnegative polynomials, Positive semidefinite rank, Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices, The integer cp-rank of \(2 \times 2\) matrices, A semidefinite relaxation algorithm for checking completely positive separable matrices, \(l_2\) Induced norm analysis of discrete-time LTI systems for nonnegative input signals and its application to stability analysis of recurrent neural networks, An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs, On the computation of \(C^*\) certificates, A note on upper bounds on the cp-rank, Two-stage stochastic standard quadratic optimization, The complete positivity of symmetric tridiagonal and pentadiagonal matrices, A note on completely positive relaxations of quadratic problems in a multiobjective framework, Packing under convex quadratic constraints
