Joel A. Tropp
According to our database^{1},
Joel A. Tropp
authored at least 41 papers
between 2003 and 2018.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at zbmath.org

at orcid.org

at id.loc.gov

at dnb.info
On csauthors.net:
Bibliography
2018
Simplicial Faces of the Set of Correlation Matrices.
Discrete & Computational Geometry, 2018
2017
Practical Sketching Algorithms for LowRank Matrix Approximation.
SIAM J. Matrix Analysis Applications, 2017
FixedRank Approximation of a PositiveSemidefinite Matrix from Streaming Data.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017
Sketchy Decisions: Convex LowRank Matrix Optimization with Optimal Storage.
Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, 2017
2015
Integer Factorization of a PositiveDefinite Matrix.
SIAM J. Discrete Math., 2015
Designing Statistical Estimators That Balance Sample Size, Risk, and Computational Cost.
J. Sel. Topics Signal Processing, 2015
An Introduction to Matrix Concentration Inequalities.
Foundations and Trends in Machine Learning, 2015
Robust Computation of Linear Models by Convex Relaxation.
Foundations of Computational Mathematics, 2015
2014
Sharp Recovery Bounds for Convex Demixing, with Applications.
Foundations of Computational Mathematics, 2014
From Steiner Formulas for Cones to Concentration of Intrinsic Volumes.
Discrete & Computational Geometry, 2014
TimeData Tradeoffs by Aggressive Smoothing.
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014
2012
UserFriendly Tail Bounds for Sums of Random Matrices.
Foundations of Computational Mathematics, 2012
Factoring nonnegative matrices with linear programs.
Proceedings of the Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012. Proceedings of a meeting held December 36, 2012
2011
Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions.
SIAM Review, 2011
Improved Analysis of the subsampled Randomized Hadamard Transform.
Advances in Adaptive Data Analysis, 2011
2010
Beyond Nyquist: efficient sampling of sparse bandlimited signals.
IEEE Trans. Information Theory, 2010
Computational Methods for Sparse Solution of Linear Inverse Problems.
Proceedings of the IEEE, 2010
CoSaMP: iterative signal recovery from incomplete and inaccurate samples.
Commun. ACM, 2010
Practical LargeScale Optimization for Maxnorm Regularization.
Proceedings of the Advances in Neural Information Processing Systems 23: 24th Annual Conference on Neural Information Processing Systems 2010. Proceedings of a meeting held 69 December 2010, 2010
The sparsity gap: Uncertainty principles proportional to dimension.
Proceedings of the 44th Annual Conference on Information Sciences and Systems, 2010
2009
Column subset selection, matrix factorization, and eigenvalue optimization.
Proceedings of the Twentieth Annual ACMSIAM Symposium on Discrete Algorithms, 2009
2008
The Metric Nearness Problem.
SIAM J. Matrix Analysis Applications, 2008
Constructing Packings in Grassmannian Manifolds via Alternating Projection.
Experimental Mathematics, 2008
2007
Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit.
IEEE Trans. Information Theory, 2007
Matrix Nearness Problems with Bregman Divergences.
SIAM J. Matrix Analysis Applications, 2007
One sketch for all: fast algorithms for compressed sensing.
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007
2006
Just relax: convex programming methods for identifying sparse signals in noise.
IEEE Trans. Information Theory, 2006
Algorithms for simultaneous sparse approximation. Part I: Greedy pursuit.
Signal Processing, 2006
Algorithms for simultaneous sparse approximation. Part II: Convex relaxation.
Signal Processing, 2006
Random Filters for Compressive Sampling and Reconstruction.
Proceedings of the 2006 IEEE International Conference on Acoustics Speech and Signal Processing, 2006
RowAction Methods for Compressed Sensing.
Proceedings of the 2006 IEEE International Conference on Acoustics Speech and Signal Processing, 2006
Sparse Approximation Via Iterative Thresholding.
Proceedings of the 2006 IEEE International Conference on Acoustics Speech and Signal Processing, 2006
2005
Designing structured tight frames via an alternating projection method.
IEEE Trans. Information Theory, 2005
Recovery of short, complex linear combinations via /spl lscr//sub 1/ minimization.
IEEE Trans. Information Theory, 2005
Generalized Finite Algorithms for Constructing Hermitian Matrices with Prescribed Diagonal and Spectrum.
SIAM J. Matrix Analysis Applications, 2005
Applications of sparse approximation in communications.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005
Simultaneous sparse approximation via greedy pursuit.
Proceedings of the 2005 IEEE International Conference on Acoustics, 2005
2004
FiniteStep Algorithms for Constructing Optimal CDMA Signature Sequences.
IEEE Trans. Information Theory, 2004
Greed is good: algorithmic results for sparse approximation.
IEEE Trans. Information Theory, 2004
Triangle Fixing Algorithms for the Metric Nearness Problem.
Proceedings of the Advances in Neural Information Processing Systems 17 [Neural Information Processing Systems, 2004
2003
Improved sparse approximation over quasiincoherent dictionaries.
Proceedings of the 2003 International Conference on Image Processing, 2003