Lower bounds on matrix factorization ranks via noncommutative polynomial optimization (Q2329041): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Handbook on semidefinite, conic and polynomial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum and non-signalling graph isomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A non-commutative spectral theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The proof of Tchakaloff’s Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the computation of the CP-rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4405832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Bilinear Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Julia: A Fresh Approach to Numerical Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Operator algebras. Theory of \(C^*\)-algebras and von Neumann algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: From seven to eleven: completely positive matrices with high cp-rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Lower Bounds and Asymptotics for the cp-Rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Limits of Linear Programs (Beyond Hierarchies) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the copositive representation of binary and continuous nonconvex quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The tracial moment problem and trace-optimization of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: The truncated tracial moment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of Polynomials in Non-Commuting Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the closure of the completely positive semidefinite cone and linear approximations to quantum colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended formulations in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of the truncated complex moment problem for flat data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Complete Positivity Detection and Decomposition of Sparse Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completely positive matrices associated with<i>M</i>-matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-closure of the set of quantum correlations via graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended formulations, nonnegative factorizations, and randomized communication protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive semidefinite rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on nonnegative rank via nonnegative nuclear norms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial bounds on nonnegative rank and extended formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential Lower Bounds for Polytopes in Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the geometric interpretation of the nonnegative rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smallest compact formulation for the permutahedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Ranks of Regular Polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifts of Convex Sets and Cone Factorizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polytopes of minimum positive semidefinite rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrices with high completely positive semidefinite rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: A factorization method for completely positive matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Protocols for Generating Bipartite Classical Distributions and Quantum States / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained trace-optimization of polynomials in freely noncommuting variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connes' embedding conjecture and sums of Hermitian squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of the Stability Number of a Graph via Copositive Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimization with Polynomials and the Problem of Moments / rank
 
Normal rank
Property / cites work
 
Property / cites work: New approximations for the cone of copositive matrices and its dual / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conic Approach to Quantum Graph Parameters Using Linear Optimization Over the Completely Positive Semidefinite Cone / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds on the Size of Semidefinite Programming Relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some upper and lower bounds on PSD-rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using separation algorithms to generate mixed integer model reformulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic factorizations, sandwiched simplices and the topology of the space of explanations / rank
 
Normal rank
Property / cites work
 
Property / cites work: SDP Relaxations for Non-Commutative Polynomial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(\mathcal A\)-truncated \(K\)-moment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric Tensor Nuclear Norms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergent Relaxations of Polynomial Optimization Problems with Noncommuting Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completely positive semidefinite rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlation matrices, Clifford algebras, and completely positive semidefinite rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4285035 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Matching Polytope has Exponential Extension Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4340161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results on the cp-rank and related properties of co(mpletely )positive matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cp-Rank and Minimal cp Factorizations of a Completely Positive Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Positive Semidefinite Matrix Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear conic formulations for two-party correlations and values of nonlocal games / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE SET OF QUANTUM CORRELATIONS IS NOT CLOSED / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for positive semidefinite factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Nonnegative Matrix Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5732671 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressing combinatorial optimization problems by linear programs / rank
 
Normal rank

Revision as of 16:36, 20 July 2024

scientific article
Language Label Description Also known as
English
Lower bounds on matrix factorization ranks via noncommutative polynomial optimization
scientific article

    Statements

    Lower bounds on matrix factorization ranks via noncommutative polynomial optimization (English)
    0 references
    0 references
    0 references
    0 references
    17 October 2019
    0 references
    matrix factorization ranks
    0 references
    nonnegative rank
    0 references
    positive semidefinite rank
    0 references
    completely positive rank
    0 references
    completely positive semidefinite rank
    0 references
    noncommutative polynomial optimization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references