Fetching the paper…
Reading the bibliography…
The problem of finding the sparsest vector (direction) in a low dimensional subspace can be considered as a homogeneous variant of the sparse recovery problem, which finds applications in robust subspace recovery, dictionary learning, sparse blind deconvolution, and many other problems in signal processing and machine learning.
J.-L. Goffin, “On Convergence Rates of Subgradient Optimization Methods,”
1977
Earlier work this paper cites.
D. C. Sorensen, “Newton?s method with a model trust region modification,”
1982
Earlier work this paper cites.
S. T. McCormick, “A combinatorial approach to some sparse matrix problems.,” tech. rep., DTIC Document, 1983
1983
Earlier work this paper cites.
Berlin Heidelberg: Springer-Verlag, 1985
N. Z. Shor, · 1985
Earlier work this paper cites.
T. F. Coleman and A. Pothen, “The null space problem i. complexity,”
1986
Earlier work this paper cites.
K. G. Murty and S. N. Kabadi, “Some np-complete problems in quadratic and nonlinear programming,”
1987
Earlier work this paper cites.
H. Späth and G. Watson, “On orthogonal linear
1987
Earlier work this paper cites.
J. R. Gilbert and M. T. Heath, “Computing a sparse basis for the null space,”
1987
Earlier work this paper cites.
D. C. Liu and J. Nocedal, “On the limited memory bfgs method for large scale optimization,”
1989
Earlier work this paper cites.
E. Moulines, P. Duhamel, J.-F. Cardoso, and S. Mayrargue, “Subspace methods for the blind identification of multichannel fir filters,”
1995
Earlier work this paper cites.
B. A. Olshausen and D. J. Field, “Emergence of simple-cell receptive field properties by learning a sparse code for natural images,”
1996
Earlier work this paper cites.
D. Kundur and D. Hatzinakos, “Blind image deconvolution,”
1996
Earlier work this paper cites.
B. A. Olshausen and D. J. Field, “Sparse coding with an overcomplete basis set: A strategy employed by v1?,”
1997
Earlier work this paper cites.
M. Zibulevsky and B. A. Pearlmutter, “Blind source separation by sparse decomposition in a signal dictionary,”
2001
Earlier work this paper cites.
A. Nedić and D. Bertsekas, “Convergence Rate of Incremental Subgradient Algorithms,” in
2001
Earlier work this paper cites.
S. Burer and R. D. Monteiro, “A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization,”
2003
Earlier work this paper cites.
Cambridge university press, 2004
S. Boyd and L. Vandenberghe, · 2004
Earlier work this paper cites.
S. Burer and R. D. Monteiro, “Local minima and convergence in low-rank semidefinite programming,”
2005
Earlier work this paper cites.
E. J. Candès and T. Tao, “Decoding by linear programming,”
2005
Earlier work this paper cites.
G. Beylkin and L. Monzón, “On approximation of functions by exponential sums,”
2005
Earlier work this paper cites.
Y. Nesterov and B. T. Polyak, “Cubic regularization of newton method and its global performance,”
2006
Earlier work this paper cites.
D. Donoho, “Compressed sensing,”
2006
Earlier work this paper cites.
D. L. Donoho, “For most large underdetermined systems of linear equations the minimal
2006
Earlier work this paper cites.
M. Aharon, M. Elad, and A. Bruckstein, “K-svd: An algorithm for designing overcomplete dictionaries for sparse representation,”
2006
Earlier work this paper cites.
M. Elad and M. Aharon, “Image denoising via sparse and redundant representations over learned dictionaries,”
2006
Earlier work this paper cites.
H. Zou, T. Hastie, and R. Tibshirani, “Sparse principal component analysis,”
2006
Earlier work this paper cites.
Springer Science & Business Media, 2006
J. Nocedal and S. Wright, · 2006
Earlier work this paper cites.
E. Betzig, G. H. Patterson, R. Sougrat, O. W. Lindwasser, S. Olenych, J. S. Bonifacino, M. W. Davidson, J. Lippincott-Schwartz, and H. F. Hess, “Imaging intracellular fluorescent proteins at nanometer resolution,”
2006
Earlier work this paper cites.
S. T. Hess, T. P. Girirajan, and M. D. Mason, “Ultra-high resolution imaging by fluorescence photoactivation localization microscopy,”
2006
Earlier work this paper cites.
M. J. Rust, M. Bates, and X. Zhuang, “Sub-diffraction-limit imaging by stochastic optical reconstruction microscopy (storm),”
2006
Earlier work this paper cites.
P. Sarder and A. Nehorai, “Deconvolution methods for 3-d fluorescence microscopy images,”
2006
Earlier work this paper cites.
A. d’Aspremont, L. El Ghaoui, M. Jordan, and G. Lanckriet, “A direct formulation of sparse PCA using semidefinite programming,”
2007
Earlier work this paper cites.
E. J. Candès and M. B. Wakin, “An introduction to compressive sampling [a sensing/sampling paradigm that goes against the common knowledge in data acquisition],”
2008
Earlier work this paper cites.
E. J. Candes, M. B. Wakin, and S. P. Boyd, “Enhancing sparsity by reweighted
2008
Earlier work this paper cites.
R. Chartrand and W. Yin, “Iteratively reweighted algorithms for compressive sensing,” in
2008
Earlier work this paper cites.
E. J. Candès and B. Recht, “Exact matrix completion via convex optimization,”
2009
Earlier work this paper cites.
A. M. Bruckstein, D. L. Donoho, and M. Elad, “From sparse solutions of systems of equations to sparse modeling of signals and images,”
2009
Earlier work this paper cites.
A. Levin, Y. Weiss, F. Durand, and W. T. Freeman, “Understanding and evaluating blind deconvolution algorithms,” in
2009
Earlier work this paper cites.
Princeton University Press, 2009
P.-A. Absil, R. Mahoney, and R. Sepulchre, · 2009
Earlier work this paper cites.
Princeton University Press, 2009
P.-A. Absil, R. Mahony, and R. Sepulchre, · 2009
Earlier work this paper cites.
Springer Science & Business Media, 2010
M. Elad, · 2010
Earlier work this paper cites.
R. Rubinstein, A. M. Bruckstein, and M. Elad, “Dictionaries for sparse representation modeling,”
2010
Earlier work this paper cites.
J. Wright, Y. Ma, J. Mairal, G. Sapiro, T. S. Huang, and S. Yan, “Sparse representation for computer vision and pattern recognition,”
2010
Earlier work this paper cites.
J. T. Vogelstein, A. M. Packer, T. A. Machado, T. Sippy, B. Babadi, R. Yuste, and L. Paninski, “Fast nonnegative deconvolution for spike train inference from population calcium imaging,”
2010
Earlier work this paper cites.
L.-A. Gottlieb and T. Neylon, “Matrix sparsification and the sparse null space problem,” in
2010
Earlier work this paper cites.
I. Daubechies, R. DeVore, M. Fornasier, and C. S. Güntürk, “Iteratively reweighted least squares minimization for sparse recovery,”
2010
Earlier work this paper cites.
E. J. Candès, X. Li, Y. Ma, and J. Wright, “Robust principal component analysis?,”
2011
Earlier work this paper cites.
Springer, 2011
I. Jolliffe, · 2011
Earlier work this paper cites.
G. Lerman, T. Zhang,
2011
Cited alongside, same era.
J. Mairal, F. Bach, and J. Ponce, “Task-driven dictionary learning,”
2011
Cited alongside, same era.
Cambridge university press, 2012
Y. C. Eldar and G. Kutyniok, · 2012
Cited alongside, same era.
D. A. Spielman, H. Wang, and J. Wright, “Exact recovery of sparsely-used dictionaries,” in
2012
Cited alongside, same era.
H. Xu, C. Caramanis, and S. Sanghavi, “Robust pca via outlier pursuit,”
2012
Cited alongside, same era.
Y. Dai, H. Li, and M. He, “A simple prior-free method for non-rigid structure-from-motion factorization,” in
2012
Cited alongside, same era.
J. Sun, Q. Qu, and J. Wright, “Complete dictionary recovery over the sphere ii: Recovery by riemannian trust-region method,”
2016
Later among the works it cites.
CRC press, 2016
P. Campisi and K. Egiazarian, · 2016
Later among the works it cites.
E. A. Pnevmatikakis, D. Soudry, Y. Gao, T. A. Machado, J. Merel, D. Pfau, T. Reardon, Y. Mu, C. Lacefield, W. Yang,
2016
Later among the works it cites.
X. Yuan, W. Huang, P.-A. Absil, and K. A. Gallivan, “A riemannian limited-memory bfgs algorithm for computing the matrix geometric mean,”
2016
Later among the works it cites.
P. Jain, P. Kar,
2017
Later among the works it cites.
H. Liu, M.-C. Yue, and A. Man-Cho So, “On the estimation performance and convergence rate of the generalized power method for phase synchronization,”
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
D. P. Bertsekas, “Incremental Gradient, Subgradient, and Proximal Methods for Convex Optimization,” in
2012
Cited alongside, same era.
F. E. Curtis and M. L. Overton, “A sequential quadratic programming algorithm for nonconvex, nonsmooth constrained optimization,”
2012
Cited alongside, same era.
Springer Science & Business Media, 2013
Y. Nesterov, · 2013
Cited alongside, same era.
P. Netrapalli, P. Jain, and S. Sanghavi, “Phase retrieval using alternating minimization,” in
2013
Cited alongside, same era.
2013
Cited alongside, same era.
P. Jain, P. Netrapalli, and S. Sanghavi, “Low-rank matrix completion using alternating minimization,” in
2013
Cited alongside, same era.
2017
Later among the works it cites.
M. Rahmani and G. Atia, “Innovation pursuit: A new approach to the subspace clustering problem,” in
2017
Later among the works it cites.
M. C. Tsakiris and R. Vidal, “Hyperplane clustering via dual principal component pursuit,” in
2017
Later among the works it cites.
Y. Zhang, Y. Lau, H.-w. Kuo, S. Cheung, A. Pasupathy, and J. Wright, “On the global geometry of sphere-constrained sparse blind deconvolution,” in
2017
Later among the works it cites.
S. S. Du, C. Jin, J. D. Lee, M. I. Jordan, A. Singh, and B. Poczos, “Gradient descent can take exponential time to escape saddle points,” in
2017
Later among the works it cites.
S. Hosseini and A. Uschmajew, “A riemannian gradient sampling algorithm for nonsmooth optimization on manifolds,”
2017
Later among the works it cites.
G. Lerman and T. Maunu, “Fast, robust and non-convex subspace recovery,”
2017
Later among the works it cites.
F. E. Curtis, T. Mitchell, and M. L. Overton, “A bfgs-sqp method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles,”
2017
Later among the works it cites.
K. Lee, N. Tian, and J. Romberg, “Fast and guaranteed blind multichannel deconvolution under a bilinear system model,”
2018
Later among the works it cites.
X. Li, S. Ling, T. Strohmer, and K. Wei, “Rapid, robust, and reliable blind deconvolution via nonconvex optimization,”
2018
Later among the works it cites.
Z. Zhu, Q. Li, G. Tang, and M. B. Wakin, “Global optimality in low-rank matrix optimization,”
2018
Later among the works it cites.
2018
Later among the works it cites.
Y. Li and Y. Bresler, “Global geometry of multichannel sparse blind deconvolution on the sphere,” in
2018
Later among the works it cites.
M. C. Tsakiris and R. Vidal, “Dual principal component pursuit,”
2018
Later among the works it cites.
Z. Zhu, Y. Wang, D. Robinson, D. Naiman, R. Vidal, and M. Tsakiris, “Dual principal component pursuit: Improved analysis and efficient algorithms,” in
2018
Later among the works it cites.
G. Lerman and T. Maunu, “An overview of robust subspace recovery,”
2018
Later among the works it cites.
Y. Bai, Q. Jiang, and J. Sun, “Subgradient descent learns orthogonal dictionaries,”
2018
Later among the works it cites.
PhD thesis, University of Illinois at Urbana-Champaign, 2018
Y. Li, · 2018
Later among the works it cites.
M. C. Tsakiris and R. Vidal, “Dual principal component pursuit,”
2018
Later among the works it cites.
N. Boumal, P.-A. Absil, and C. Cartis, “Global rates of convergence for nonconvex optimization on manifolds,”
2018
Later among the works it cites.
J. Zhang and S. Zhang, “A cubic regularized newton’s method over riemannian manifolds,”
2018
Later among the works it cites.
D. Davis, D. Drusvyatskiy, K. J. MacPhee, and C. Paquette, “Subgradient Methods for Sharp Weakly Convex Functions,”
2018
Later among the works it cites.
2018
Later among the works it cites.
Q. Li, Z. Zhu, and G. Tang, “Alternating minimizations converge to second-order optimal solutions,” in
2019
Later among the works it cites.
T. Ding, Z. Zhu, T. Ding, Y. Yang, D. Robinson, M. Tsakiris, and R. Vidal, “Noisy dual principal component pursuit,” in
2019
Later among the works it cites.
D. Gilboa, S. Buchanan, and J. Wright, “Efficient dictionary learning with gradient descent,” in
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
X. Li, S. Ling, T. Strohmer, and K. Wei, “Rapid, robust, and reliable blind deconvolution via nonconvex optimization,”
2019
Later among the works it cites.
Z. Zhu, T. Ding, D. Robinson, M. Tsakiris, and R. Vidal, “A linearly convergent method for non-smooth non-convex optimization on the grassmannian with applications to robust subspace and dictionary learning,” in
2019
Later among the works it cites.
T. Maunu, T. Zhang, and G. Lerman, “A well-tempered landscape for non-convex robust subspace recovery.,”
2019
Later among the works it cites.
Y. Zhai, Z. Yang, Z. Liao, J. Wright, and Y. Ma, “Complete dictionary learning via
2019
Later among the works it cites.
J. D. Lee, I. Panageas, G. Piliouras, M. Simchowitz, M. I. Jordan, and B. Recht, “First-order methods almost always avoid strict saddle points,”
2019
Later among the works it cites.
2019
Later among the works it cites.
C. Criscitiello and N. Boumal, “Efficiently escaping saddle points on manifolds,”
2019
Later among the works it cites.
Y. Sun, N. Flammarion, and M. Fazel, “Escaping from saddle points on riemannian manifolds,”
2019
Later among the works it cites.
P.-A. Absil and S. Hosseini, “A collection of nonsmooth riemannian optimization problems,” in
2019
Later among the works it cites.
2019
Later among the works it cites.
S. Chen, Z. Deng, S. Ma, and A. M.-C. So, “Manifold proximal point algorithms for dual principal component pursuit and orthogonal dictionary learning,” in
2019
Later among the works it cites.
T. Ding, Z. Zhu, T. Ding, Y. Yang, D. Robinson, R. Vidal, and M. Tsakiris, “Noisy dual principal component pursuit,” in
2019
Later among the works it cites.
J. Hu, X. Liu, Z. Wen, and Y. Yuan, “A brief introduction to manifold optimization,” 2019
2019
Later among the works it cites.
X. Li, Z. Zhu, A. M.-C. So, and R. Vidal, “Nonconvex robust low-rank matrix recovery,”
2020
Closest in time.