Pages that link to "Item:Q3453428"
From MaRDI portal
The following pages link to New Lower Bounds and Asymptotics for the cp-Rank (Q3453428):
Displaying 26 items.
- Matrices with high completely positive semidefinite rank (Q344893) (← links)
- The structure of completely positive matrices according to their CP-rank and CP-plus-rank (Q492774) (← links)
- Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations (Q721169) (← links)
- Matrix product constraints by projection methods (Q1675556) (← links)
- A fresh CP look at mixed-binary QPs: new formulations and relaxations (Q1683686) (← links)
- Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 (Q1731962) (← links)
- Completely positive semidefinite rank (Q1785204) (← links)
- Building a completely positive factorization (Q1787912) (← links)
- Completely positive matrices: real, rational, and integral (Q1994053) (← links)
- Notoriously hard (mixed-)binary QPs: empirical evidence on new completely positive approaches (Q2010370) (← links)
- The extreme rays of the \(6\times 6\) copositive cone (Q2022227) (← links)
- Lower bounds on matrix factorization ranks via noncommutative polynomial optimization (Q2329041) (← links)
- The DJL Conjecture for CP Matrices over Special Inclines (Q2817189) (← links)
- Semialgebraic Geometry of Nonnegative Tensor Rank (Q2834690) (← links)
- (Q4568070) (← links)
- Bounds for the completely positive rank of a symmetric matrix over a tropical semiring (Q4568079) (← links)
- Extremal copositive matrices with minimal zero supports of cardinality two (Q4685505) (← links)
- (Q5124683) (← links)
- Correlation matrices, Clifford algebras, and completely positive semidefinite rank (Q5145555) (← links)
- The Complexity of Simple Models—A Study of Worst and Typical Hard Cases for the Standard Quadratic Optimization Problem (Q5219559) (← links)
- On the DJL conjecture for order 6 (Q5346603) (← links)
- Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems (Q5501200) (← links)
- Preservers of the cp-rank (Q5888830) (← links)
- Approximate completely positive semidefinite factorizations and their ranks (Q6051147) (← links)
- The smallest mono-unstable convex polyhedron with point masses has 8 faces and 11 vertices (Q6113351) (← links)
- Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks (Q6126663) (← links)