• PhaseLift

  • Referenced in 184 articles [sw31783]
  • Phase retrieval via matrix completion. This paper develops a novel framework for phase retrieval ... inspired by the recent literature on matrix completion. More importantly, we also demonstrate that...
  • impute

  • Referenced in 100 articles [sw14376]
  • gene expression analysis require a complete matrix of gene array values as input. For example...
  • softImpute

  • Referenced in 63 articles [sw12263]
  • softImpute: Matrix Completion via Iterative Soft-Thresholded SVD. Iterative methods for matrix completion that ... that at each iteration the matrix is completed with the current estimate. For large matrices...
  • Manopt

  • Referenced in 87 articles [sw08493]
  • machine learning applications, including low-rank matrix completion, sensor network localization, camera network registration, independent...
  • KernSmooth

  • Referenced in 921 articles [sw04586]
  • basic knowledge of statistics, calculus and matrix algebra is assumed. In its role ... does make some sacrifices. It does not completely cover the vast amount of research...
  • LMaFit

  • Referenced in 64 articles [sw12221]
  • that currently solves the following problems: Matrix Complete (MC), Sparse Matrix Separation (SMS), Matrix Compressive...
  • ADMiRA

  • Referenced in 31 articles [sw31664]
  • sparse measurement operator as in the matrix completion problem, the computation in ADMiRA is linear ... measurements. Numerical experiments for the matrix completion problem show that, although ... ADMiRA is a competitive algorithm for matrix completion...
  • RTRMC

  • Referenced in 34 articles [sw20435]
  • RTRMC : Low-rank matrix completion via preconditioned optimization on the Grassmann manifold. We address ... well suited to solve badly conditioned matrix completion tasks...
  • QSDP

  • Referenced in 46 articles [sw04726]
  • correlation matrix and the Euclidean distance matrix completion problems...
  • Jellyfish

  • Referenced in 28 articles [sw12431]
  • stochastic gradient algorithms for large-scale matrix completion. This paper develops Jellyfish, an algorithm ... problems solvable by Jellyfish include matrix completion problems and least-squares problems regularized ... number of processors. On large-scale matrix completion tasks, Jellyfish is orders of magnitude more...
  • TAUCS

  • Referenced in 31 articles [sw04014]
  • Matlab 6’s sparse Cholesky) but not completely state of the art. It uses ... supernodal solvers when it factors a matrix completely, but it can drop small elements from ... matrices. All of these are symmetric orderings. Matrix Operations. Matrix-vector multiplication, triangular solvers, matrix ... they don’t factor the resulting matrix completely. Instead, they eliminate rows and columns which...
  • LowRankModels

  • Referenced in 27 articles [sw27002]
  • such as principal components analysis (PCA), matrix completion, robust PCA, nonnegative matrix factorization, k-means...
  • Pyglrm

  • Referenced in 26 articles [sw27003]
  • such as principal components analysis (PCA), matrix completion, robust PCA, nonnegative matrix factorization, k-means...
  • SuperLU

  • Referenced in 178 articles [sw00930]
  • performed only for square matrices. The matrix columns may be preordered (before factorization) either through ... supplied routines. This preordering for sparsity is completely separate from the factorization. Working precision iterative...
  • Optspace

  • Referenced in 7 articles [sw12630]
  • Algorithm on the Grassmann Manifold for Matrix Completion. We consider the problem of reconstructing ... optimization, for solving the low-rank matrix completion problem. It has been shown that ... gives a good estimate for the original matrix, so that local optimization reconstructs the correct...
  • SparseCoLO

  • Referenced in 8 articles [sw04768]
  • Mevissen and Yamashita, via positive semidefinite matrix completion for an optimization problem with matrix inequalities...
  • SuperLU-DIST

  • Referenced in 86 articles [sw00002]
  • performed only for square matrices. The matrix columns may be preordered (before factorization) either through ... supplied routines. This preordering for sparsity is completely separate from the factorization. Working precision iterative...
  • Tyrolean

  • Referenced in 89 articles [sw07830]
  • term rewrite systems. It is the completely redesigned successor of TTT. Current (non-)termination techniques ... Bendix order, lexicographic path order, loop detection, matrix interpretation, polynomial interpretation, predictive labeling, recursive...
  • TRIC

  • Referenced in 47 articles [sw02165]
  • computation of a sparse 9 by 9 matrix. The element formulation departs from conventional Cartesian ... adopted physical lumping procedures and contains a completely new implementation of the transverse shear deformation ... straining modes of deformation. A simple congruent matrix operation transforms the elemental natural stiffness matrix ... presented here and has brought about a completion of the understanding of natural modes...
  • denoiseR

  • Referenced in 5 articles [sw17854]
  • shrinking functions. Impute missing values with matrix completion...