<h1>Tropp, Joel</h1>
<h2>Article from <a href="https://authors.library.caltech.edu">CaltechAUTHORS</a></h2>
<ul>
<li>Chen, Yifan and Epperly, Ethan N., el al. (2024) <a href="https://authors.library.caltech.edu/records/dxyhq-kee31">Randomly pivoted Cholesky: Practical approximation of a kernel matrix with few entry evaluations</a>; Communications on Pure and Applied Mathematics; <a href="https://doi.org/10.1002/cpa.22234">10.1002/cpa.22234</a></li>
<li>Chen, Chi-Fang and Dalzell, Alexander M., el al. (2024) <a href="https://authors.library.caltech.edu/records/j56b4-c9j08">Sparse Random Hamiltonians Are Quantumly Easy</a>; Physical Review X; Vol. 14; No. 1; 011014; <a href="https://doi.org/10.1103/physrevx.14.011014">10.1103/physrevx.14.011014</a></li>
<li>Tropp, Joel A. (2022) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20220107-890431800">Randomized block Krylov methods for approximating extreme eigenvalues</a>; Numerische Mathematik; Vol. 150; No. 1; 217-255; <a href="https://doi.org/10.1007/s00211-021-01250-3">10.1007/s00211-021-01250-3</a></li>
<li>Ding, Lijun and Yurtsever, Alp, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20220204-680252000">An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity</a>; SIAM Journal of Optimization; Vol. 31; No. 4; 2695-2725; <a href="https://doi.org/10.1137/19m1244603">10.1137/19m1244603</a></li>
<li>Huang, De and Niles-Weed, Jonathan, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20201218-154434116">Matrix Concentration for Products</a>; Foundations of Computational Mathematics; <a href="https://doi.org/10.1007/s10208-021-09533-9">10.1007/s10208-021-09533-9</a></li>
<li>Huang, De and Tropp, Joel A. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20201218-154430753">From Poincaré inequalities to nonlinear matrix concentration</a>; Bernoulli; Vol. 27; No. 3; 1724-1744; <a href="https://doi.org/10.3150/20-BEJ1289">10.3150/20-BEJ1289</a></li>
<li>Huang, De and Tropp, Joel A. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20201218-154427353">Nonlinear matrix concentration via semigroup methods</a>; Electronic Journal of Probability; Vol. 26; Art. No. 8; <a href="https://doi.org/10.1214/20-EJP578">10.1214/20-EJP578</a></li>
<li>Guta, M. and Kahn, J., el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190212-160252658">Fast state tomography with optimal error bounds</a>; Journal of Physics A: Mathematical and General; Vol. 53; No. 20; Art. No. 204001; <a href="https://doi.org/10.1088/1751-8121/ab8111">10.1088/1751-8121/ab8111</a></li>
<li>Martinsson, Per-Gunnar and Tropp, Joel A. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20201217-104322985">Randomized numerical linear algebra: Foundations and algorithms</a>; Acta Numerica; Vol. 29; 403-572; <a href="https://doi.org/10.1017/s0962492920000021">10.1017/s0962492920000021</a></li>
<li>Tropp, Joel A. and Yurtsever, Alp, el al. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190920-085459909">Streaming Low-Rank Matrix Approximation with an Application to Scientific Simulation</a>; SIAM Journal on Scientific Computing; Vol. 41; No. 4; A2430-A2463; <a href="https://doi.org/10.1137/18m1201068">10.1137/18m1201068</a></li>
<li>Tropp, Joel A. (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180103-154009197">Simplicial Faces of the Set of Correlation Matrices</a>; Discrete and Computational Geometry; Vol. 60; No. 2; 512-529; <a href="https://doi.org/10.1007/s00454-017-9961-0">10.1007/s00454-017-9961-0</a></li>
<li>Tropp, Joel A. and Yurtsever, Alp, el al. (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180111-134219270">Practical Sketching Algorithms for Low-Rank Matrix Approximation</a>; SIAM Journal on Matrix Analysis and Applications; Vol. 38; No. 4; 1454-1485; <a href="https://doi.org/10.1137/17M1111590">10.1137/17M1111590</a></li>
<li>Tropp, Joel A. (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170913-080352752">A mathematical introduction to compressive sensing [Book Review]</a>; Bulletin of the American Mathematical Society; Vol. 54; No. 1; 151-165; <a href="https://doi.org/10.1090/bull/1546">10.1090/bull/1546</a></li>
<li>Paulin, Daniel and Mackey, Lester, el al. (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161103-151616710">Efron–Stein inequalities for random matrices</a>; Annals of Probability; Vol. 44; No. 5; 3431-3473; <a href="https://doi.org/10.1214/15-AOP1054">10.1214/15-AOP1054</a></li>
<li>Tropp, Joel A. (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160115-141425609">Integer Factorization of a Positive-Definite Matrix</a>; SIAM Journal on Discrete Mathematics; Vol. 29; No. 4; 1783-1791; <a href="https://doi.org/10.1137/15M1024718">10.1137/15M1024718</a></li>
<li>Bruer, John J. and Tropp, Joel A., el al. (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150611-103104163">Designing Statistical Estimators That Balance Sample Size, Risk, and Computational Cost</a>; IEEE Journal of Selected Topics in Signal Processing; Vol. 9; No. 4; 612-624; <a href="https://doi.org/10.1109/JSTSP.2015.2400412">10.1109/JSTSP.2015.2400412</a></li>
<li>Tropp, Joel A. (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150714-140245621">An Introduction to Matrix Concentration Inequalities</a>; Foundations and Trends in Machine Learning; Vol. 8; No. 1-2; 1-230; <a href="https://doi.org/10.1561/2200000048">10.1561/2200000048</a></li>
<li>Horstmeyer, Roarke and Chen, Richard Y., el al. (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150619-160809918">Solving ptychography with a convex relaxation</a>; New Journal of Physics; Vol. 17; No. 5; Art. No. 053044; PMCID PMC4486359; <a href="https://doi.org/10.1088/1367-2630/17/5/053044">10.1088/1367-2630/17/5/053044</a></li>
<li>Lerman, Gilad and McCoy, Michael B., el al. (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150416-134303719">Robust Computation of Linear Models by Convex Relaxation</a>; Foundations of Computational Mathematics; Vol. 15; No. 2; 363-410; <a href="https://doi.org/10.1007/s10208-014-9221-0">10.1007/s10208-014-9221-0</a></li>
<li>Amelunxen, Dennis and Lotz, Martin, el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150422-120051110">Living on the edge: phase transitions in convex programs with random data</a>; Information and Inference; Vol. 3; No. 3; 224-294; <a href="https://doi.org/10.1093/imaiai/iau005">10.1093/imaiai/iau005</a></li>
<li>McCoy, Michael B. and Tropp, Joel A. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20140606-140701312">Sharp Recovery Bounds for Convex Demixing, with Applications</a>; Foundations of Computational Mathematics; Vol. 14; No. 3; 503-567; <a href="https://doi.org/10.1007/s10208-014-9191-2">10.1007/s10208-014-9191-2</a></li>
<li>McCoy, Michael B. and Tropp, Joel A. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20140703-103651135">From Steiner Formulas for Cones to Concentration of Intrinsic Volumes</a>; Discrete and Computational Geometry; Vol. 51; No. 4; 926-963; <a href="https://doi.org/10.1007/s00454-014-9595-4">10.1007/s00454-014-9595-4</a></li>
<li>Mackey, Lester and Jordan, Michael I., el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20140605-070821101">Matrix concentration inequalities via the method of exchangeable pairs</a>; Annals of Probability; Vol. 42; No. 3; 906-945; <a href="https://doi.org/10.1214/13-AOP892">10.1214/13-AOP892</a></li>
<li>Moarref, R. and Jovanović, M. R., el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20140519-153243814">A low-order decomposition of turbulent channel flow via resolvent analysis and convex optimization</a>; Physics of Fluids; Vol. 26; No. 5; Art. No. 051701; <a href="https://doi.org/10.1063/1.4876195">10.1063/1.4876195</a></li>
<li>Chen, Richard Y. and Tropp, Joel A. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20140918-084717665">Subadditivity of matrix φ-entropy and concentration of random matrices</a>; Electronic Journal of Probability; Vol. 19; Art. No. 27; <a href="https://doi.org/10.1214/EJP.v19-2964">10.1214/EJP.v19-2964</a></li>
<li>Needell, Deanna and Tropp, Joel A. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20140207-094442254">Paved with good intentions: Analysis of a randomized block Kaczmarz method</a>; Linear Algebra and its Applications; Vol. 441; 199-221; <a href="https://doi.org/10.1016/j.laa.2012.12.022">10.1016/j.laa.2012.12.022</a></li>
<li>Bourguignon, J.-L. and Tropp, J. A., el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20140320-104900351">Compact representation of wall-bounded turbulence using compressive sampling</a>; Physics of Fluids; Vol. 26; No. 1; Art. No. 015109; <a href="https://doi.org/10.1063/1.4862303">10.1063/1.4862303</a></li>
<li>Moarref, Rashad and Sharma, Ati S., el al. (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20131121-132351952">Model-based scaling of the streamwise energy density in high-Reynolds-number turbulent channels</a>; Journal of Fluid Mechanics; Vol. 734; 275-316; <a href="https://doi.org/10.1017/jfm.2013.457">10.1017/jfm.2013.457</a></li>
<li>Pfander, Götz E. and Rauhut, Holger, el al. (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20130815-130448316">The restricted isometry property for time-frequency structured random matrices</a>; Probability Theory and Related Fields; Vol. 156; No. 3-4; 707-737; <a href="https://doi.org/10.1007/s00440-012-0441-4">10.1007/s00440-012-0441-4</a></li>
<li>Tropp, Joel A. (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120820-074343297">A comparison principle for functions of a uniformly random subspace</a>; Probability Theory and Related Fields; Vol. 153; No. 3-4; 759-769; <a href="https://doi.org/10.1007/s00440-011-0360-9">10.1007/s00440-011-0360-9</a></li>
<li>Tropp, Joel A. (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120821-072332716">User-Friendly Tail Bounds for Sums of Random Matrices</a>; Foundations of Computational Mathematics; Vol. 12; No. 4; 389-434; <a href="https://doi.org/10.1007/s10208-011-9099-z">10.1007/s10208-011-9099-z</a></li>
<li>Tropp, Joel A. (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120515-094709707">From joint convexity of quantum relative entropy to a concavity theorem of Lieb</a>; Proceedings of the American Mathematical Society; Vol. 140; No. 5; 1757-1760; <a href="https://doi.org/10.1090/S0002-9939-2011-11141-9">10.1090/S0002-9939-2011-11141-9</a></li>
<li>Rauhut, Holger and Romberg, Justin, el al. (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120302-134838002">Restricted isometries for partial random circulant matrices</a>; Applied and Computational Harmonic Analysis; Vol. 32; No. 2; 242-254; <a href="https://doi.org/10.1016/j.acha.2011.05.001">10.1016/j.acha.2011.05.001</a></li>
<li>Tropp, Joel A. (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120105-135621556">Freedman's inequality for matrix martingales</a>; Electronic Communications in Probability; Vol. 16; 262-270; <a href="https://doi.org/10.1214/ECP.v16-1624">10.1214/ECP.v16-1624</a></li>
<li>Tropp, Joel A. (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20110606-111746280">Freedman's Inequality for Matrix Martingales</a>; Electronic Communications in Probability; Vol. 16; No. 25; 262-270; <a href="https://doi.org/10.1214/ECP.v16-1624">10.1214/ECP.v16-1624</a></li>
<li>Tropp, Joel A. (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180831-112120288">Improved analysis of the subsampled randomized Hadamard transform</a>; Advances in Adaptive Data Analysis; Vol. 3; No. 1-2; 115-126; <a href="https://doi.org/10.1142/S1793536911000787">10.1142/S1793536911000787</a></li>
<li>McCoy, Michael and Tropp, Joel A. (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20111021-161307161">Two proposals for robust PCA using semidefinite programming</a>; Electronic Journal of Statistics; Vol. 5; 1123-1160; <a href="https://doi.org/10.1214/11-EJS636">10.1214/11-EJS636</a></li>
<li>Tropp, Joel A. (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120321-092826256">Improved Analysis of the Subsamples Randomized Hadamard Transform</a>; Advances in Adaptive Data Analysis; Vol. 3; No. 1-2; 115-126; <a href="https://doi.org/10.1142/S1793536911000787">10.1142/S1793536911000787</a></li>
<li>Halko, N. and Martinsson, P. G., el al. (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20111025-085943917">Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions</a>; SIAM Review; Vol. 53; No. 2; 217-288; <a href="https://doi.org/10.1137/090771806">10.1137/090771806</a></li>
<li>Needell, Deanna and Tropp, Joel A. (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20110201-090245482">CoSaMP: iterative signal recovery from incomplete and inaccurate samples</a>; Communications of the ACM; Vol. 53; No. 12; 93-100; <a href="https://doi.org/10.1145/1859204.1859229">10.1145/1859204.1859229</a></li>
<li>Tropp, Joel A. and Wright, Stephen J. (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20100608-080853280">Computational Methods for Sparse Solution of Linear Inverse Problems</a>; Proceedings of the IEEE; Vol. 98; No. 6; 948-958; <a href="https://doi.org/10.1109/JPROC.2010.2044010">10.1109/JPROC.2010.2044010</a></li>
<li>Tropp, Joel A. and Laska, Jason N., el al. (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20100119-103356110">Beyond Nyquist: Efficient Sampling of Sparse Bandlimited Signals</a>; IEEE Transactions on Information Theory; Vol. 56; No. 1; 520-544; <a href="https://doi.org/10.1109/TIT.2009.2034811">10.1109/TIT.2009.2034811</a></li>
<li>Needell, D. and Tropp, J. A. (2009) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20090706-113128889">CoSaMP: Iterative signal recovery from incomplete and inaccurate samples</a>; Applied and Computational Harmonic Analysis; Vol. 26; No. 3; 301-321; <a href="https://doi.org/10.1016/j.acha.2008.07.002">10.1016/j.acha.2008.07.002</a></li>
<li>Tropp, Joel A. (2008) <a href="https://resolver.caltech.edu/CaltechAUTHORS:TROcrm08">Norms of random submatrices and sparse approximation</a>; Comptes Rendus Mathematique; Vol. 346; No. 23-24; 1271-1274; <a href="https://doi.org/10.1016/j.crma.2008.10.008">10.1016/j.crma.2008.10.008</a></li>
<li>Tropp, Joel A. (2008) <a href="https://resolver.caltech.edu/CaltechAUTHORS:TROjfaa08">On the Linear Independence of Spikes and Sines</a>; Journal of Fourier Analysis and Applications; Vol. 14; No. 5-6; 838-858; <a href="https://doi.org/10.1007/s00041-008-9042-0">10.1007/s00041-008-9042-0</a></li>
<li>Brickell, Justin and Dhillon, Inderjit S., el al. (2008) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20110513-152152857">The Metric Nearness Problem</a>; SIAM Journal on Matrix Analysis and Applications; Vol. 30; No. 1; 375-396; <a href="https://doi.org/10.1137/060653391">10.1137/060653391</a></li>
<li>Gilnert, Anna C. and Strauss, Martin J., el al. (2008) <a href="https://resolver.caltech.edu/CaltechAUTHORS:GILieeespm08">A Tutorial on Fast Fourier Sampling [How to apply it to problems]</a>; IEEE Signal Processing Magazine; Vol. 25; No. 2; 57-66; <a href="https://doi.org/10.1109/MSP.2007.915000">10.1109/MSP.2007.915000</a></li>
<li>Dhillon, I. S. and Heath, R. W., Jr., el al. (2008) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180831-112106252">Constructing Packings in Grassmannian Manifolds via Alternating Projection</a>; Experimental Mathematics; Vol. 17; No. 1; 9-35; <a href="https://doi.org/10.1080/10586458.2008.10129018">10.1080/10586458.2008.10129018</a></li>
<li>Tropp, Joel A. (2008) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170408-150838584">The random paving property for uniformly bounded matrices</a>; Studia Mathematica; Vol. 185; No. 1; 67-82; <a href="https://doi.org/10.4064/sm185-1-4">10.4064/sm185-1-4</a></li>
<li>Tropp, Joel A. and Gilbert, Anna C. (2007) <a href="https://resolver.caltech.edu/CaltechAUTHORS:TROieeetit07">Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit</a>; IEEE Transactions on Information Theory; Vol. 53; No. 12; 4655-4666; <a href="https://doi.org/10.1109/TIT.2007.909108">10.1109/TIT.2007.909108</a></li>
<li>Dhillon, Inderjit S. and Tropp, Joel A. (2007) <a href="https://resolver.caltech.edu/CaltechAUTHORS:DHIsiamjmaa07">Matrix Nearness Problems with Bregman Divergences</a>; SIAM Journal on Matrix Analysis and Applications; Vol. 29; No. 4; 1120-1146; <a href="https://doi.org/10.1137/060649021">10.1137/060649021</a></li>
<li>Tropp, Joel A. (2006) <a href="https://resolver.caltech.edu/CaltechAUTHORS:TROieeetit06">Just relax: convex programming methods for identifying sparse signals in noise</a>; IEEE Transactions on Information Theory; Vol. 52; No. 3; 1030-1051; <a href="https://doi.org/10.1109/TIT.2005.864420">10.1109/TIT.2005.864420</a></li>
<li>Dhillon, Inderjit S. and Heath, Robert W., Jr., el al. (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:DHIsiamjmaa05">Generalized Finite Algorithms for Constructing Hermitian Matrices with Prescribed Diagonal and Spectrum</a>; SIAM Journal on Matrix Analysis and Applications; Vol. 27; No. 1; 61-71; <a href="https://doi.org/10.1137/S0895479803438183">10.1137/S0895479803438183</a></li>
<li>Tropp, Joel A. (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:TROieeetit05b">Recovery of short, complex linear combinations via ℓ1 minimization</a>; IEEE Transactions on Information Theory; Vol. 2005; No. 4; 1568-1570; <a href="https://doi.org/10.1109/TIT.2005.844057">10.1109/TIT.2005.844057</a></li>
<li>Tropp, Joel A. and Dhillon, Inderjit S., el al. (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:TROieeetit05a">Designing structured tight frames via an alternating projection method</a>; IEEE Transactions on Information Theory; Vol. 51; No. 1; 188-209; <a href="https://doi.org/10.1109/TIT.2004.839492">10.1109/TIT.2004.839492</a></li>
<li>Tropp, Joel A. and Dhillon, Inderjit S., el al. (2004) <a href="https://resolver.caltech.edu/CaltechAUTHORS:TROieeetit04b">Finite-step algorithms for constructing optimal CDMA signature sequences</a>; IEEE Transactions on Information Theory; Vol. 50; No. 11; 2916-2921; <a href="https://doi.org/10.1109/TIT.2004.836698">10.1109/TIT.2004.836698</a></li>
<li>Tropp, Joel A. (2004) <a href="https://resolver.caltech.edu/CaltechAUTHORS:TROieeetit04a">Greed is good: algorithmic results for sparse approximation</a>; IEEE Transactions on Information Theory; Vol. 50; No. 10; 2231-2242; <a href="https://doi.org/10.1109/TIT.2004.834793">10.1109/TIT.2004.834793</a></li>
</ul>