Pages that link to "Item:Q1758469"

The following pages link to On the geometric interpretation of the nonnegative rank (Q1758469):

Displaying 37 items.

• Extended formulations for convex heptagons (Q265972) (← links)
• Heuristics for exact nonnegative matrix factorization (Q288239) (← links)
• Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank (Q304255) (← links)
• Polytopes of minimum positive semidefinite rank (Q377501) (← links)
• Semi-nonnegative rank for real matrices and its connection to the usual rank (Q472415) (← links)
• On the linear extension complexity of regular \(n\)-gons (Q513256) (← links)
• Lower bounds on nonnegative rank via nonnegative nuclear norms (Q745679) (← links)
• Tropical lower bounds for extended formulations (Q745680) (← links)
• Positive semidefinite rank (Q745689) (← links)
• Worst-case results for positive semidefinite rank (Q745690) (← links)
• Matrix product constraints by projection methods (Q1675556) (← links)
• Euclidean distance matrices and separations in communication complexity theory (Q1731462) (← links)
• Enumeration of 2-level polytopes (Q1741129) (← links)
• A geometric lower bound on the extension complexity of polytopes based on the \(f\)-vector (Q1983109) (← links)
• An efficient method for non-negative low-rank completion (Q1986538) (← links)
• Completely positive factorizations associated with Euclidean distance matrices corresponding to an arithmetic progression (Q2174096) (← links)
• The NMF problem and lattice-subspaces (Q2185834) (← links)
• Lifts of non-compact convex sets and cone factorizations (Q2220437) (← links)
• Nonnegative rank depends on the field (Q2227545) (← links)
• On the similarity to nonnegative and Metzler Hessenberg forms (Q2236385) (← links)
• Nonnegative rank factorization -- a heuristic approach via rank reduction (Q2248962) (← links)
• Polynomial size linear programs for problems in \textsc{P} (Q2312647) (← links)
• Lower bounds on matrix factorization ranks via noncommutative polynomial optimization (Q2329041) (← links)
• An upper bound for nonnegative rank (Q2341256) (← links)
• Approximate cone factorizations and lifts of polytopes (Q2349138) (← links)
• Symmetric nonnegative matrix trifactorization (Q2693700) (← links)
• Tropical lower bound for extended formulations. II. Deficiency graphs of matrices (Q3120460) (← links)
• Exact and Heuristic Algorithms for Semi-Nonnegative Matrix Factorization (Q3195441) (← links)
• Studying Non-negative Factorizations with Tools from Linear Algebra over a Semiring (Q3448302) (← links)
• Approximation Limits of Linear Programs (Beyond Hierarchies) (Q3449458) (← links)
• On Ranks of Regular Polygons (Q4594484) (← links)
• Lifting for Simplicity: Concise Descriptions of Convex Sets (Q5044992) (← links)
• Uniqueness of Nonnegative Matrix Factorizations by Rigidity Theory (Q5150834) (← links)
• Nonnegative Matrix Factorization Requires Irrationality (Q5283249) (← links)
• Positive semidefinite rank and nested spectrahedra (Q5375914) (← links)
• A Sampling Algorithm to Compute the Set of Feasible Solutions for NonNegative Matrix Factorization with an Arbitrary Rank (Q5862809) (← links)
• Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks (Q6126663) (← links)