Huang, De; Niles-Weed, Jonathan et al.
(2021)
Matrix Concentration for Products
Foundations of Computational Mathematics;
(In Press)
Huang, De; Tropp, Joel A.
(2021)
From Poincaré inequalities to nonlinear matrix concentration
Bernoulli;
Vol.
27;
No.
3;
Huang, De; Tropp, Joel A.
(2021)
Nonlinear matrix concentration via semigroup methods
Electronic Journal of Probability;
Vol.
26;
Guta, M.; Kahn, J. et al.
(2020)
Fast state tomography with optimal error bounds
Journal of Physics A: Mathematical and General;
Vol.
53;
No.
20;
Martinsson, Per-Gunnar; Tropp, Joel A.
(2020)
Randomized numerical linear algebra: Foundations and algorithms
Acta Numerica;
Vol.
29;
Tropp, Joel A.; Yurtsever, Alp et al.
(2019)
Streaming Low-Rank Matrix Approximation with an Application to Scientific Simulation
SIAM Journal on Scientific Computing;
Vol.
41;
No.
4;
Tropp, Joel A.
(2018)
Simplicial Faces of the Set of Correlation Matrices
Discrete and Computational Geometry;
Vol.
60;
No.
2;
Tropp, Joel A.; Yurtsever, Alp et al.
(2017)
Practical Sketching Algorithms for Low-Rank Matrix Approximation
SIAM Journal on Matrix Analysis and Applications;
Vol.
38;
No.
4;
Tropp, Joel A.
(2017)
A mathematical introduction to compressive sensing [Book Review]
Bulletin of the American Mathematical Society;
Vol.
54;
No.
1;
Paulin, Daniel; Mackey, Lester et al.
(2016)
Efron–Stein inequalities for random matrices
Annals of Probability;
Vol.
44;
No.
5;
Tropp, Joel A.
(2015)
Integer Factorization of a Positive-Definite Matrix
SIAM Journal on Discrete Mathematics;
Vol.
29;
No.
4;
Bruer, John J.; Tropp, Joel A. et al.
(2015)
Designing Statistical Estimators That Balance Sample Size, Risk, and Computational Cost
IEEE Journal of Selected Topics in Signal Processing;
Vol.
9;
No.
4;
Tropp, Joel A.
(2015)
An Introduction to Matrix Concentration Inequalities
Foundations and Trends in Machine Learning;
Vol.
8;
No.
1-2;
Horstmeyer, Roarke; Chen, Richard Y. et al.
(2015)
Solving ptychography with a convex relaxation
New Journal of Physics;
Vol.
17;
No.
5;
Lerman, Gilad; McCoy, Michael B. et al.
(2015)
Robust Computation of Linear Models by Convex Relaxation
Foundations of Computational Mathematics;
Vol.
15;
No.
2;
Amelunxen, Dennis; Lotz, Martin et al.
(2014)
Living on the edge: phase transitions in convex programs with random data
Information and Inference;
Vol.
3;
No.
3;
McCoy, Michael B.; Tropp, Joel A.
(2014)
From Steiner Formulas for Cones to Concentration of Intrinsic Volumes
Discrete and Computational Geometry;
Vol.
51;
No.
4;
McCoy, Michael B.; Tropp, Joel A.
(2014)
Sharp Recovery Bounds for Convex Demixing, with Applications
Foundations of Computational Mathematics;
Vol.
14;
No.
3;
Mackey, Lester; Jordan, Michael I. et al.
(2014)
Matrix concentration inequalities via the method of exchangeable pairs
Annals of Probability;
Vol.
42;
No.
3;
Chen, Richard Y.; Tropp, Joel A.
(2014)
Subadditivity of matrix φ-entropy and concentration of random matrices
Electronic Journal of Probability;
Vol.
19;
Needell, Deanna; Tropp, Joel A.
(2014)
Paved with good intentions: Analysis of a randomized block Kaczmarz method
Linear Algebra and its Applications;
Vol.
441;
Bourguignon, J.-L.; Tropp, J. A. et al.
(2014)
Compact representation of wall-bounded turbulence using compressive sampling
Physics of Fluids;
Vol.
26;
No.
1;
Bruer, John J.; Tropp, Joel A. et al.
(2014)
Time–Data Tradeoffs by Aggressive Smoothing
Advances in Neural Information Processing Systems 27 (NIPS 2014);
Series.Advances in Neural Information Processing Systems;
No.
27;
Twenty-eighth Annual Conference on Neural Information Processing Systems (NIPS), December 8-13, 2014
, Montreal, Canada
Pfander, Götz E.; Rauhut, Holger et al.
(2013)
The restricted isometry property for time-frequency structured random matrices
Probability Theory and Related Fields;
Vol.
156;
No.
3-4;
Tropp, Joel A.
(2012)
A comparison principle for functions of a uniformly random subspace
Probability Theory and Related Fields;
Vol.
153;
No.
3-4;
Tropp, Joel A.
(2012)
User-Friendly Tail Bounds for Sums of Random Matrices
Foundations of Computational Mathematics;
Vol.
12;
No.
4;
Tropp, Joel A.
(2012)
From joint convexity of quantum relative entropy to a concavity theorem of Lieb
Proceedings of the American Mathematical Society;
Vol.
140;
No.
5;
Rauhut, Holger; Romberg, Justin et al.
(2012)
Restricted isometries for partial random circulant matrices
Applied and Computational Harmonic Analysis;
Vol.
32;
No.
2;
Bittorf, Victor; Recht, Benjamin et al.
(2012)
Factoring nonnegative matrices with linear programs
Advances in Neural Information Processing Systems 25 (NIPS 2012);
Series.Advances in Neural Information Processing Systems;
No.
25;
26th Annual Conference on Neural Information Processing Systems 2012, December 3-6, 2012
, Lake Tahoe, NV
Tropp, Joel A.
(2011)
Freedman's inequality for matrix martingales
Electronic Communications in Probability;
Vol.
16;
Tropp, Joel A.
(2011)
Freedman’s Inequality for Matrix Martingales
Electronic Communications in Probability;
Vol.
16;
No.
25;
Tropp, Joel A.
(2011)
Improved analysis of the subsampled randomized Hadamard transform
Advances in Adaptive Data Analysis;
Vol.
3;
No.
1-2;
Tropp, Joel A.
(2011)
Improved Analysis of the Subsamples Randomized Hadamard Transform
Advances in Adaptive Data Analysis;
Vol.
3;
No.
1-2;
McCoy, Michael; Tropp, Joel A.
(2011)
Two proposals for robust PCA using semidefinite programming
Electronic Journal of Statistics;
Vol.
5;
Needell, Deanna; Tropp, Joel A.
(2010)
CoSaMP: iterative signal recovery from incomplete and inaccurate samples
Communications of the ACM;
Vol.
53;
No.
12;
Tropp, Joel A.; Wright, Stephen J.
(2010)
Computational Methods for Sparse Solution of Linear Inverse Problems
Proceedings of the IEEE;
Vol.
98;
No.
6;
Tropp, Joel A.; Laska, Jason N. et al.
(2010)
Beyond Nyquist: Efficient Sampling of Sparse Bandlimited Signals
IEEE Transactions on Information Theory;
Vol.
56;
No.
1;
Lee, Jason; Recht, Benjamin et al.
(2010)
Practical Large-Scale Optimization for Max-Norm Regularization
Advances in Neural Information Processing Systems 23 ;
Series.Advances in Neural Information Processing Systems;
No.
23;
Twenty-fourth Annual Conference on Neural Information Processing Systems (NIPS), December 6-9, 2010
, Vancouver, B. C., Canada
Needell, D.; Tropp, J. A.
(2009)
CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
Applied and Computational Harmonic Analysis;
Vol.
26;
No.
3;
Mishali, Moshe; Eldar, Yonina C. et al.
(2008)
Efficient Sampling of Sparse Wideband Analog Signals
2008 IEEE 25th Convention of Electrical and Electronics Engineers in Israel;
2008 IEEE 25th Convention of Electrical and Electronics Engineers in Israel, 3-5 December 2008
, Eilat, Israel
Tropp, Joel A.
(2008)
Norms of random submatrices and sparse approximation
Comptes Rendus Mathematique;
Vol.
346;
No.
23-24;
Tropp, Joel A.
(2008)
On the Linear Independence of Spikes and Sines
Journal of Fourier Analysis and Applications;
Vol.
14;
No.
5-6;
Needell, Deanna; Tropp, Joel et al.
(2008)
Greedy Signal Recovery Review
2008 42nd Asilomar Conference on Signals, Systems and Computers;
42nd Asilomar Conference on Signals, Systems and Computers, 26-29 October 2008
, Pacific Grove, CA
Brickell, Justin; Dhillon, Inderjit S. et al.
(2008)
The Metric Nearness Problem
SIAM Journal on Matrix Analysis and Applications;
Vol.
30;
No.
1;
Gilnert, Anna C.; Strauss, Martin J. et al.
(2008)
A Tutorial on Fast Fourier Sampling [How to apply it to problems]
IEEE Signal Processing Magazine;
Vol.
25;
No.
2;
Dhillon, I. S.; Heath, R. W., Jr. et al.
(2008)
Constructing Packings in Grassmannian Manifolds via Alternating Projection
Experimental Mathematics;
Vol.
17;
No.
1;
Tropp, Joel A.
(2008)
The random paving property for uniformly bounded matrices
Studia Mathematica;
Vol.
185;
No.
1;
Tropp, Joel A.; Gilbert, Anna C.
(2007)
Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
IEEE Transactions on Information Theory;
Vol.
53;
No.
12;
Dhillon, Inderjit S.; Tropp, Joel A.
(2007)
Matrix Nearness Problems with Bregman Divergences
SIAM Journal on Matrix Analysis and Applications;
Vol.
29;
No.
4;
Tropp, Joel A.
(2006)
Just relax: convex programming methods for identifying sparse signals in noise
IEEE Transactions on Information Theory;
Vol.
52;
No.
3;
Dhillon, Inderjit S.; Heath, Robert W., Jr. et al.
(2005)
Generalized Finite Algorithms for Constructing Hermitian Matrices with Prescribed Diagonal and Spectrum
SIAM Journal on Matrix Analysis and Applications;
Vol.
27;
No.
1;
Tropp, Joel A.
(2005)
Recovery of short, complex linear combinations via ℓ1 minimization
IEEE Transactions on Information Theory;
Vol.
2005;
No.
4;
Tropp, Joel A.; Dhillon, Inderjit S. et al.
(2005)
Designing structured tight frames via an alternating projection method
IEEE Transactions on Information Theory;
Vol.
51;
No.
1;
Tropp, Joel A.; Dhillon, Inderjit S. et al.
(2004)
Finite-step algorithms for constructing optimal CDMA signature sequences
IEEE Transactions on Information Theory;
Vol.
50;
No.
11;
Tropp, Joel A.
(2004)
Greed is good: algorithmic results for sparse approximation
IEEE Transactions on Information Theory;
Vol.
50;
No.
10;