Building a completely positive factorization
From MaRDI portal
Publication:1787912
DOI10.1007/s10100-017-0499-2zbMath1397.90288WikidataQ55472788 ScholiaQ55472788MaRDI QIDQ1787912
Publication date: 5 October 2018
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10100-017-0499-2
90C20: Quadratic programming
Related Items
An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix, Self-Assignment Flows for Unsupervised Data Labeling on Graphs, Completely positive factorization by a Riemannian smoothing method, Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization, Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017, Emerging and innovative OR applications: a special issue in honor of Walter J. Gutjahr, A factorization method for completely positive matrices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sparse solutions to random standard quadratic optimization problems
- Matrices attaining the minimum semidefinite rank of a chordal graph
- From seven to eleven: completely positive matrices with high cp-rank
- Copositivity and constrained fractional quadratic problems
- Copositive optimization -- recent developments and applications
- On reduced semidefinite programs for second order moment bounds with applications
- On nonnegative factorization of matrices
- Computing symmetric nonnegative rank factorizations
- \(5 \times 5\) completely positive matrices
- The difference between \(5\times 5\) doubly nonnegative and completely positive matrices
- A note on the computation of the CP-rank
- Interiors of completely positive cones
- Well supported approximate equilibria in bimatrix games
- A note on ``\(5\times 5\) completely positive matrices
- On the support size of stable strategies in random games
- On the computation of \(C^*\) certificates
- A note on upper bounds on the cp-rank
- Combinatorial results on completely positive matrices
- Nonnegative factorization of positive semidefinite nonnegative matrices
- Completely positive matrices and positivity of least squares solutions
- The maximal cp-rank of rank \(k\) completely positive matrices
- CP rank of completely positive matrices of order 5
- A note on Burer's copositive representation of mixed-binary QPs
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Factorization and cutting planes for completely positive matrices by copositive projection
- Computable representations for convex hulls of low-dimensional quadratic forms
- Copositive Programming
- Factorization of cp-rank-3 completely positive matrices
- On the cp-Rank and Minimal cp Factorizations of a Completely Positive Matrix
- New results on the cp-rank and related properties of co(mpletely )positive matrices
- An improved characterisation of the interior of the completely positive cone
- Mixed 0-1 Linear Programs Under Objective Uncertainty: A Completely Positive Representation
- Open problems in the theory of completely positive and copositive matrices
- New Analysis on Sparse Solutions to Random Standard Quadratic Optimization Problems and Extensions
- New Lower Bounds and Asymptotics for the cp-Rank
- Completely positive matrices associated withM-matrices
- Copositive realxation for genera quadratic programming
- A Test of the Markovian Model of DNA Evolution
- Linear-Time Complete Positivity Detection and Decomposition of Sparse Matrices
- The Complexity of Simple Models—A Study of Worst and Typical Hard Cases for the Standard Quadratic Optimization Problem
- Algorithms and Computation
- Special issue: Selected papers of the international workshop on global optimization, GO '99. Firenze, Italy, 1999
