SU+ Digital Repository
metadata only
Matrix completion problem
Paper presented at the 4th Strathmore International Mathematics Conference (SIMC 2017), 19 - 23 June 2017, Strathmore University, Nairobi, Kenya.
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Optimization hierarchies for extremal geometry through complete positivity#1129459
- Fast Algorithms for Sparse PCA and Robust Sparse Estimation#996529
- Low solution rank of the matrix LASSO under RIP with consequences for rank-constrained algorithms#144202
- Linear Algebra with Applications#17942
- Linear Algebra#66885
Record · ID 955885
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive