Fetching the paper…
Reading the bibliography…
We consider the problem of maximizing the $\ell_1$ norm of a linear map over the sphere, which arises in various machine learning applications such as orthogonal dictionary learning (ODL) and robust subspace recovery (RSR).
Augmented Lagrangians and applications of the proximal point algorithm in convex programming
R. T. Rockafellar · 1976
Earlier work this paper cites.
Monotone operators and the proximal point algorithm
R. T. Rockafellar · 1976
Earlier work this paper cites.
Optimization and Nonsmooth Analysis
F. H. Clarke · 1990
Earlier work this paper cites.
Weak sharp minima in mathematical programming
J. V. Burke and M. C. Ferris · 1993
Earlier work this paper cites.
Proximal point algorithm on Riemannian manifolds
O. P. Ferreira and P. R. Oliveira · 2002
Earlier work this paper cites.
Variational Analysis
R. T. Rockafellar and R. J.-B. Wets · 2004
Earlier work this paper cites.
Optimization Algorithms on Matrix Manifolds
P.-A. Absil, R. Mahony, and R. Sepulchre · 2009
Earlier work this paper cites.
From sparse solutions of systems of equations to sparse modeling of signals and images
A. M. Bruckstein, D. L. Donoho, and M. Elad · 2009
Earlier work this paper cites.
Dictionaries for sparse representation modeling
R. Rubinstein, A. M. Bruckstein, and M. Elad · 2010
Earlier work this paper cites.
Exact recovery of sparsely-used dictionaries
D. Spielman, H. Wang, and J. Wright · 2012
Earlier work this paper cites.
Vision meets robotics: The KITTI dataset
A. Geiger, P. Lenz, C. Stiller, and R. Urtasun · 2013
Earlier work this paper cites.
Optimality conditions for the nonlinear programming problems on Riemannian manifolds
W. H. Yang, L.-H. Zhang, and R. Song · 2014
Cited alongside, same era.
Robust computation of linear models by convex relaxation
G. Lerman, M. McCoy, J. A. Tropp, and T. Zhang · 2015
Cited alongside, same era.
Finding a sparse vector in subspace: linear sparsity using alternating directions
Q. Qu, J. Sun, and J. Wright · 2016
Cited alongside, same era.
Iteration-complexity of gradient, subgradient and proximal point methods on Riemannian manifolds
G. C. Bento, O. P. Ferreira, and J. G. Melo · 2017
Cited alongside, same era.
On the estimation performance and convergence rate of the generalized power method for phase synchronization
H. Liu, M.-C. Yue, and A. M.-C. So · 2017
Cited alongside, same era.
Complete dictionary recovery over the sphere I: Overview and the geometric picture
Dual principal component pursuit: Improved analysis and efficient algorithms
Z. Zhu, Y. Wang, D. Robinson, D. Naiman, R. Vidal, and M. Tsakiris · 2018
Later among the works it cites.
Subgradient descent learns orthogonal dictionaries
Y. Bai, Q. Jiang, and J. Sun · 2019
Later among the works it cites.
Efficient dictionary learning with gradient descent
D. Gilboa, S. Buchanan, and J. Wright · 2019
Later among the works it cites.
Quadratic optimization with orthogonality constraint: Explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods
H. Liu, A. M.-C. So, and W. Wu · 2019
Later among the works it cites.
Globally convergent accelerated proximal alternating maximization method for L1–principal component analysis
P. Wang, H. Liu, and A. M.-C. So · 2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
J. Sun, Q. Qu, and J. Wright · 2017
Cited alongside, same era.
Complete dictionary recovery over the sphere II: Recovery by Riemannian trust-region method
J. Sun, Q. Qu, and J. Wright · 2017
Cited alongside, same era.
A unified approach to error bounds for structured convex optimization problems
Z. Zhou and A. M.-C. So · 2017
Cited alongside, same era.
An overview of robust subspace recovery
G. Lerman and T. Maunu · 2018
Cited alongside, same era.
A highly efficient semi-smooth Newton augmented Lagrangian method for solving Lasso problems
X. Li, D. Sun, and K.-C. Toh · 2018
Cited alongside, same era.
Dual principal component pursuit
M. C. Tsakiris and R. Vidal · 2018
Cited alongside, same era.
S. Chen, Z. Deng, S. Ma, and A. M.-C. So · 2020
Closest in time.
Proximal gradient method for nonsmooth optimization over the Stiefel manifold
S. Chen, S. Ma, A. M.-C. So, and T. Zhang · 2020
Closest in time.
Nonconvex robust low-rank matrix recovery
X. Li, Z. Zhu, A. M.-C. So, and R. Vidal · 2020
Closest in time.
Geometric analysis of nonconvex optimization landscapes for overcomplete learning
Q. Qu, Y. Zhai, X. Li, Y. Zhang, and Z. Zhu · 2020
Closest in time.
Riemannian stochastic proximal gradient methods for nonsmooth optimization over the Stiefel manifold
B. Wang, S. Ma, and L. Xue · 2020
Closest in time.
Weakly convex optimization over Stiefel manifold using Riemannian subgradient-type methods
X. Li, S. Chen, Z. Deng, Q. Qu, Z. Zhu, and A. M.-C. So · 2021
Closest in time.