\begin{thebibliography}{10}

\bibitem{GAVISH2012354}
M.~Gavish and R.~R. Coifman, ``Sampling, denoising and compression of matrices
  by coherent matrix organization,'' {\em Applied and Computational Harmonic
  Analysis}, vol.~33, no.~3, pp.~354 -- 369, 2012.

\bibitem{Coifman2011}
R.~R. Coifman and M.~Gavish, {\em Harmonic Analysis of Digital Data Bases},
  pp.~161--197.
\newblock Boston: Birkh{\"a}user Boston, 2011.

\bibitem{coifman2017}
G.~Mishne, R.~Talmon, I.~Cohen, R.~Coifman, and Y.~Kluger, ``Data-driven tree
  transforms and metrics,'' 2017.
\newblock https://arxiv.org/pdf/1708.05768.pdf.

\bibitem{coifman:7548324}
G.~Mishne, R.~Talmon, R.~Meir, J.~Schiller, M.~Lavzin, U.~Dubin, and R.~R.
  Coifman, ``Hierarchical coupled-geometry analysis for neuronal structure and
  activity pattern discovery,'' {\em IEEE Journal of Selected Topics in Signal
  Processing}, vol.~10, pp.~1238--1253, Oct 2016.

\bibitem{candes2012}
M.~Soltanolkotabi and E.~J. Candes, ``A geometric analysis of subspace
  clustering with outliers,'' {\em Ann. Statist.}, vol.~40, no.~4, p.~2195 –
  2238, 2012.

\bibitem{Candes2013}
M.~Soltanolkotabi, E.~Elhamifar, and E.~Candes, ``Robust subspace clustering,''
  {\em Ann. Statist.}, vol.~42, no.~2, pp.~669 -- 699, 2014.

\bibitem{NIPS2015_5707}
C.~Qu and H.~Xu, ``Subspace clustering with irrelevant features via robust
  dantzig selector,'' in {\em Advances in Neural Information Processing Systems
  28} (C.~Cortes, N.~D. Lawrence, D.~D. Lee, M.~Sugiyama, and R.~Garnett,
  eds.), pp.~757--765, Curran Associates, Inc., 2015.

\bibitem{Beck:2009:FIS:1658360.1658364}
A.~Beck and M.~Teboulle, ``A fast iterative shrinkage-thresholding algorithm
  for linear inverse problems,'' {\em SIAM J. Img. Sci.}, vol.~2, pp.~183--202,
  Mar. 2009.

\bibitem{NIPS2016_6267}
D.~Scieur, A.~d'Aspremont, and F.~Bach, ``Regularized nonlinear acceleration,''
  {\em Advances in Neural Information Processing Systems 29}, pp.~712--720,
  2016.

\bibitem{ODonoghue2015}
B.~O'Donoghue and E.~Cand{\`e}s, ``Adaptive restart for accelerated gradient
  schemes,'' {\em Foundations of Computational Mathematics}, vol.~15,
  pp.~715--732, Jun 2015.

\bibitem{NIPS2015_5735}
C.~Musco and C.~Musco, ``Randomized block krylov methods for stronger and
  faster approximate singular value decomposition,'' in {\em Advances in Neural
  Information Processing Systems 28} (C.~Cortes, N.~D. Lawrence, D.~D. Lee,
  M.~Sugiyama, and R.~Garnett, eds.), pp.~1396--1404, Curran Associates, Inc.,
  2015.

\bibitem{Hackbusch:2015:HMA:2988144}
W.~Hackbusch, {\em Hierarchical Matrices: Algorithms and Analysis}.
\newblock Springer Publishing Company, Incorporated, 1st~ed., 2015.

\end{thebibliography}
