Pages that link to "Item:Q2900327"
From MaRDI portal
The following pages link to Fast and near-optimal matrix completion via randomized basis pursuit (Q2900327):
Displaying 6 items.
- On the generation of random stable polynomials (Q719189) (← links)
- Computing the spark: mixed-integer programming for the (vector) matroid girth problem (Q2007824) (← links)
- An alternating minimization method for matrix completion problems (Q2182816) (← links)
- (Q5149024) (← links)
- Nonconvex Robust Low-Rank Matrix Recovery (Q5217366) (← links)
- Cardinality minimization, constraints, and regularization: a survey (Q6585278) (← links)
