Building a completely positive factorization
From MaRDI portal
Publication:1787912
Recommendations
Cites work
- 5 5 completely positive matrices
- A note on ``\(5\times 5\) completely positive matrices
- A note on Burer's copositive representation of mixed-binary QPs
- A note on the computation of the CP-rank
- A note on upper bounds on the cp-rank
- A Test of the Markovian Model of DNA Evolution
- Algorithms and Computation
- An improved characterisation of the interior of the completely positive cone
- Combinatorial results on completely positive matrices
- Completely positive matrices and positivity of least squares solutions
- Completely positive matrices associated withM-matrices
- Computable representations for convex hulls of low-dimensional quadratic forms
- Computing symmetric nonnegative rank factorizations
- Copositive optimization -- recent developments and applications
- Copositive programming
- Copositive realxation for genera quadratic programming
- Copositivity and constrained fractional quadratic problems
- Copositivity-based approximations for mixed-integer fractional quadratic optimization
- CP rank of completely positive matrices of order 5
- Factorization and cutting planes for completely positive matrices by copositive projection
- Factorization of cp-rank-3 completely positive matrices.
- From seven to eleven: completely positive matrices with high cp-rank
- scientific article; zbMATH DE number 3176168 (Why is no real title available?)
- scientific article; zbMATH DE number 1933860 (Why is no real title available?)
- scientific article; zbMATH DE number 3201668 (Why is no real title available?)
- Interior points of the completely positive cone
- Interiors of completely positive cones
- Linear-time complete positivity detection and decomposition of sparse matrices
- Matrices attaining the minimum semidefinite rank of a chordal graph
- Mixed 0-1 Linear Programs Under Objective Uncertainty: A Completely Positive Representation
- New Analysis on Sparse Solutions to Random Standard Quadratic Optimization Problems and Extensions
- New lower bounds and asymptotics for the cp-rank
- New results on the cp-rank and related properties of co(mpletely) positive matrices
- Nonnegative factorization of positive semidefinite nonnegative matrices
- On nonnegative factorization of matrices
- On reduced semidefinite programs for second order moment bounds with applications
- On the computation of \(C^*\) certificates
- On the copositive representation of binary and continuous nonconvex quadratic programs
- On the cp-rank and minimal cp factorizations of a completely positive matrix
- On the support size of stable strategies in random games
- Open problems in the theory of completely positive and copositive matrices
- Sparse solutions to random standard quadratic optimization problems
- Special issue: Selected papers of the international workshop on global optimization, GO '99. Firenze, Italy, 1999
- The complexity of simple models -- a study of worst and typical hard cases for the standard quadratic optimization problem
- The difference between \(5\times 5\) doubly nonnegative and completely positive matrices
- The maximal cp-rank of rank k completely positive matrices
- Well supported approximate equilibria in bimatrix games
Cited in
(13)- 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
- Factorization and cutting planes for completely positive matrices by copositive projection
- The CP-matrix approximation problem
- Factorization of cp-rank-3 completely positive matrices.
- The CP-matrix completion problem
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- Factorization of completely positive matrices using iterative projected gradient steps
- 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
- A projected inexact Levenberg-Marquardt method for the completely positive matrix factorization
This page was built for publication: Building a completely positive factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1787912)
