<h1>Tropp, Joel</h1>
<h2>Combined 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>Kireeva, Anastasia and Tropp, Joel A. (2024) <a href="https://authors.library.caltech.edu/records/4v7j7-msj10">Randomized matrix computations: themes and variations</a>; 54 p; <a href="https://doi.org/10.7907/7yade-5k351">10.7907/7yade-5k351</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:20220412-221302767">ACM 217: Probability in High Dimensions</a>; <a href="https://doi.org/10.7907/mxr0-c422">10.7907/mxr0-c422</a></li>
<li>Tropp, Joel A. (2022) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20220412-221559139">ACM 204: Matrix Analysis</a>; <a href="https://doi.org/10.7907/m421-yb89">10.7907/m421-yb89</a></li>
<li>Tropp, Joel A. (2022) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20220412-220319430">ACM 204: Lectures on Convex Geometry</a>; <a href="https://doi.org/10.7907/geda-h205">10.7907/geda-h205</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>Nakatasukasa, Yuji and Tropp, Joel A. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20220909-161413582">Fast &amp; accurate randomized algorithms for linear systems and eigenvalue problems</a>; <a href="https://doi.org/10.7907/cmyh-va31">10.7907/cmyh-va31</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>Levis, Aviad and Lee, Daeyoung, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20220307-188412000">Inference of Black Hole Fluid-Dynamics from Sparse Interferometric Measurements</a>; ISBN 978-1-6654-2812-5; 2021 IEEE/CVF International Conference on Computer Vision (ICCV); 2320-2329; <a href="https://doi.org/10.1109/iccv48922.2021.00234">10.1109/iccv48922.2021.00234</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>Sun, Yiming and Guo, Yang, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20210621-223135493">Tensor Random Projection for Low Memory Dimension Reduction</a>; <a href="https://doi.org/10.48550/arXiv.2105.00105">10.48550/arXiv.2105.00105</a></li>
<li>Tropp, Joel A. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20210421-101607288">ACM 204: Randomized Algorithms for Matrix Computations</a>; <a href="https://doi.org/10.7907/nwsv-df59">10.7907/nwsv-df59</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>Chen, Chi-Fang and Huang, Hsin-Yuan (Robert), el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20201218-154423869">Quantum simulation via randomized product formulas: Low gate complexity with accuracy guarantees</a>; <a href="https://doi.org/10.48550/arXiv.2008.11751">10.48550/arXiv.2008.11751</a></li>
<li>Lotz, Martin and McCoy, Michael B., el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200821-083421883">Concentration of the Intrinsic Volumes of a Convex Body</a>; ISBN 978-3-030-46761-6; Geometric Aspects of Functional Analysis: Israel Seminar (GAFA) 2017-2019 Volume II; 139-167; <a href="https://doi.org/10.1007/978-3-030-46762-3_6">10.1007/978-3-030-46762-3_6</a></li>
<li>Lotz, Martin and Tropp, Joel A. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20220829-181401723">Sharp phase transitions in Euclidian integral geometry</a>; <a href="https://doi.org/10.7907/9rja-rh15">10.7907/9rja-rh15</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>Yurtsever, Alp and Tropp, Joel A., el al. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20201218-154437706">Scalable Semidefinite Programming</a>; <a href="https://doi.org/10.48550/arXiv.1912.02949">10.48550/arXiv.1912.02949</a></li>
<li>Kueng, Richard and Tropp, Joel A. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20201218-154444454">Binary component decomposition. Part II: The asymmetric case</a>; <a href="https://doi.org/10.48550/arXiv.1907.13602">10.48550/arXiv.1907.13602</a></li>
<li>Kueng, Richard and Tropp, Joel A. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20201218-154441081">Binary Component Decomposition. Part I: The Positive-Semidefinite Case</a>; <a href="https://doi.org/10.48550/arXiv.1907.13603">10.48550/arXiv.1907.13603</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. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190715-125341188">Matrix Concentration &amp; Computational Linear Algebra</a>; <a href="https://doi.org/10.7907/nbx6-vm05">10.7907/nbx6-vm05</a></li>
<li>Tropp, Joel A. and Yurtsever, Alp, el al. (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20220826-183609942">More practical sketching algorithms for low-rank matrix approximation</a>; <a href="https://doi.org/10.7907/bb7w-ve61">10.7907/bb7w-ve61</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. (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20210624-180721369">Analysis of randomized block Krylov methods</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. and Yurtsever, Alp, el al. (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180829-073029156">Fixed-Rank Approximation of a Positive-Semidefinite Matrix from Streaming Data</a>; <a href="https://doi.org/10.48550/arXiv.1706.05736">10.48550/arXiv.1706.05736</a></li>
<li>Tropp, Joel A. (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190826-161640394">Sketchy decisions: convex optimization with optimal storage (Conference Presentation)</a>; ISBN 9781510612457; Wavelets and Sparsity XVII; Art. No. 1039403; <a href="https://doi.org/10.1117/12.2281058">10.1117/12.2281058</a></li>
<li>Tropp, Joel A. and Yurtsever, Alp, el al. (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170620-081901312">Fixed-Rank Approximation of a Positive-Semidefinite Matrix from Streaming Data</a>; <a href="https://doi.org/10.7907/QJE2-RP11">10.7907/QJE2-RP11</a></li>
<li>Yurtsever, Alp and Udell, Madeleine, el al. (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180828-145534045">Sketchy Decisions: Convex Low-Rank Matrix Optimization with Optimal Storage</a>; <a href="https://doi.org/10.48550/arXiv.1702.06838">10.48550/arXiv.1702.06838</a></li>
<li>McCoy, Michael B. and Tropp, Joel A. (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170314-110228775">The Achievable Performance of Convex Demixing</a>; <a href="https://doi.org/10.7907/4KWM-5N31">10.7907/4KWM-5N31</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>Tropp, Joel A. and Yurtsever, Alp, el al. (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170215-154809329">Randomized Single-View Algorithms for Low-Rank Matrix Approximation</a>; <a href="https://doi.org/10.7907/Z9HT2M9C">10.7907/Z9HT2M9C</a></li>
<li>Tropp, Joel A. (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170214-075417526">The Expected Norm of a Sum of Independent Random Matrices: An Elementary Approach</a>; ISBN 978-3-319-40517-9; High Dimensional Probability VII; 173-202; <a href="https://doi.org/10.1007/978-3-319-40519-3_8">10.1007/978-3-319-40519-3_8</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>Oymak, Samet and Tropp, Joel A. (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180831-112137332">Universality laws for randomized dimension reduction, with applications</a>; <a href="https://doi.org/10.48550/arXiv.1511.09433">10.48550/arXiv.1511.09433</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>Tropp, Joel A. (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180831-112133957">Second-Order Matrix Concentration Inequalities</a>; <a href="https://doi.org/10.48550/arXiv.1504.05919">10.48550/arXiv.1504.05919</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>Tropp, Joel A. (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160818-084011981">Convex Recovery of a Structured Signal from Independent Random Linear Measurements</a>; ISBN 978-3-319-19748-7; Sampling Theory, a Renaissance: Compressive Sensing and Other Developments; 67-101; <a href="https://doi.org/10.1007/978-3-319-19749-4_2">10.1007/978-3-319-19749-4_2</a></li>
<li>Moarref, Rashad and Sharma, Ati S., el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180831-112157832">A foundation for analytical developments in the logarithmic region of turbulent channels</a>; <a href="https://doi.org/10.48550/arXiv.1409.6047">10.48550/arXiv.1409.6047</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>Gittens, A. and Tropp, J.  A. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20140828-082707636">Error Bounds for Random Matrix Approximation Schemes</a>; <a href="https://doi.org/10.7907/03an-qj61">10.7907/03an-qj61</a></li>
<li>Gittens, Alex A. and Tropp, Joel A. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20140828-084239607">Tail Bounds for All Eigenvalues of a Sum of Random Matrices</a>; <a href="https://doi.org/10.7907/tz8n-h623">10.7907/tz8n-h623</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>Bruer, John J. and Tropp, Joel A., el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160401-170735760">Time–Data Tradeoffs by Aggressive Smoothing</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>McCoy, Michael B. and Tropp, Joel A. (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180831-112130540">The achievable performance of convex demixing</a>; <a href="https://doi.org/10.48550/arXiv.1309.7478">10.48550/arXiv.1309.7478</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>Moarref, Rashad and Sharma, Ati S., el al. (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150218-094025300">On effectiveness of a rank-1 model of turbulent channels for representing the velocity spectra</a>; <a href="https://doi.org/10.2514/6.2013-2480">10.2514/6.2013-2480</a></li>
<li>Paulin, Daniel and Mackey, Lester, el al. (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180831-112127106">Deriving Matrix Concentration Inequalities from Kernel Couplings</a>; <a href="https://doi.org/10.48550/arXiv.1305.0612">10.48550/arXiv.1305.0612</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>Chen, Richard Y. and Gittens, Alex A., el al. (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120411-102106234">The Masked Sample Covariance Estimator: An Analysis via the Matrix Laplace Transform</a>; <a href="https://doi.org/10.7907/6rfh-ce56">10.7907/6rfh-ce56</a></li>
<li>Bittorf, Victor and Recht, Benjamin, el al. (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160401-165447853">Factoring nonnegative matrices with linear programs</a>; ISBN 978-1-62748-003-1; Advances in Neural Information Processing Systems 25 (NIPS 2012); <a href="https://doi.org/10.48550/arXiv.1206.1270">10.48550/arXiv.1206.1270</a></li>
<li>Chen, Richard Y. and Gittens, Alex, el al. (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180831-112123699">The Masked Sample Covariance Estimator: An Analysis via Matrix Concentration Inequalities</a>; <a href="https://doi.org/10.48550/arXiv.1109.1637">10.48550/arXiv.1109.1637</a></li>
<li>Probel, Clément J. and Tropp, Joel A. (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20220826-185558571">Large-Scales PCA with Sparsity Constraints</a>; <a href="https://doi.org/10.7907/51g8-zc61">10.7907/51g8-zc61</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: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: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>Tropp, Joel A. (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20111012-114710310">User-friendly Tail Bounds for Matrix Martingales</a>; <a href="https://doi.org/10.7907/62v9-yh77">10.7907/62v9-yh77</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. (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20111012-112125900">User-Friendly Tail Bounds for Sums of Random Matrices</a>; <a href="https://doi.org/10.7907/A14X-R435">10.7907/A14X-R435</a></li>
<li>Tropp, Joel A. (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180831-112116678">The sparsity gap: Uncertainty principles proportional to dimension</a>; ISBN 978-1-4244-7416-5; 2010 44th Annual Conference on Information Sciences and Systems (CISS); 1-6; <a href="https://doi.org/10.1109/CISS.2010.5464824">10.1109/CISS.2010.5464824</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>Lee, Jason and Recht, Benjamin, el al. (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160331-164724199">Practical Large-Scale Optimization for Max-Norm Regularization</a>; ISBN 9781617823800; Advances in Neural Information Processing Systems 23</li>
<li>Halko, N. and Martinsson, P. G., el al. (2009) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20111012-111324407">Finding Structure with Randomness: Stochastic Algorithms for Constructing Approximate matrix Decompositions</a>; <a href="https://doi.org/10.7907/PK8V-V047">10.7907/PK8V-V047</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. and Wright, Stephen J. (2009) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20111011-163243421">Computational Methods for Sparse Solution of Linear Inverse Problems</a>; <a href="https://doi.org/10.7907/QF0D-J303">10.7907/QF0D-J303</a></li>
<li>Tropp, Joel A. (2009) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20100921-101535590">Column Subset Selection, Matrix Factorization, and Eigenvalue Optimization</a>; ISBN 978-0-898716-80-1; Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms; 978-986; <a href="https://doi.org/10.48550/arXiv.0806.4404">10.48550/arXiv.0806.4404</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>Mishali, Moshe and Eldar, Yonina C., el al. (2008) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180831-112113124">Efficient Sampling of Sparse Wideband Analog Signals</a>; ISBN 978-1-4244-2481-8; 2008 IEEE 25th Convention of Electrical and Electronics Engineers in Israel; 290-294; <a href="https://doi.org/10.1109/EEEI.2008.4736707">10.1109/EEEI.2008.4736707</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>Needell, Deanna and Tropp, Joel, el al. (2008) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180831-112109709">Greedy Signal Recovery Review</a>; ISBN 978-1-4244-2941-7; 2008 42nd Asilomar Conference on Signals, Systems and Computers; 1048-1050; <a href="https://doi.org/10.1109/ACSSC.2008.5074572">10.1109/ACSSC.2008.5074572</a></li>
<li>Needell, D. and Tropp, J. A. (2008) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20111011-160707642">CoSaMP: Iterative Signal Recovery from Incomplete and Inaccurate Samples</a>; <a href="https://doi.org/10.7907/KE0N-TN13">10.7907/KE0N-TN13</a></li>
<li>Tropp, Joel A. (2008) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20111011-161421093">Column Subset Selection, Matrix Factorization, and Eigenvalue Optimization</a>; <a href="https://doi.org/10.7907/82PQ-TF75">10.7907/82PQ-TF75</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>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>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. 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. and Gilbert, Anna C. (2007) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20111010-134929077">Signal Recovery from Random Measurements Via Orthogonal Matching Pursuit: The Gaussian Case</a>; <a href="https://doi.org/10.7907/EG9R-Y984">10.7907/EG9R-Y984</a></li>
<li>Tropp, Joel A. (2007) <a href="https://resolver.caltech.edu/CaltechAUTHORS:TROciss06.975">Random Filters for Compressive Sampling</a>; ISBN 1-4244-0350-2; Conference on Information Sciences and Systems, 40th (CISS 2006), Princeton, NJ, 22-24 March 2006; 216-217; <a href="https://doi.org/10.1109/CISS.2006.286465">10.1109/CISS.2006.286465</a></li>
<li>Gilbert, A. C. and Strauss, M. J., el al. (2006) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180828-150010838">Algorithmic linear dimension reduction in the ℓ_1 norm for sparse vectors</a>; <a href="https://doi.org/10.48550/arXiv.0608079">10.48550/arXiv.0608079</a></li>
<li>Herrity, Kyle K. and Gilbert, Anna C., el al. (2006) <a href="https://resolver.caltech.edu/CaltechAUTHORS:HERicassp06.876">Sparse Approximation Via Iterative Thresholding</a>; ISBN 1-4244-0469-X; International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2006), Toulouse, France, 14-19 May 2006; III-624; <a href="https://doi.org/10.1109/ICASSP.2006.1660731">10.1109/ICASSP.2006.1660731</a></li>
<li>Sra, Suvrit and Tropp, Joel A. (2006) <a href="https://resolver.caltech.edu/CaltechAUTHORS:SRAicassp06.963">Row-Action Methods for Compressed Sensing</a>; ISBN 1-4244-0469-X; International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2006), Toulouse, France, 14-19 May 2006; III-868; <a href="https://doi.org/10.1109/ICASSP.2006.1660792">10.1109/ICASSP.2006.1660792</a></li>
<li>Tropp, Joel A. and Wakin, Michael ., el al. (2006) <a href="https://resolver.caltech.edu/CaltechAUTHORS:TROicassp06.977">Random Filters for Compressive Sampling and Reconstruction</a>; ISBN 1-4244-0469-X; International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2006), Toulouse, France, 14-19 May 2006; III-872; <a href="https://doi.org/10.1109/ICASSP.2006.1660793">10.1109/ICASSP.2006.1660793</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>Gilbert, A. C. and Tropp, J. A. (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:GILisit05">Applications of sparse approximation in communications</a>; ISBN 0-7803-9151-9; International Symposium on Information Theory (ISIT '05), Adelaide, Australia, 4-9 September 2005; 1000-1004; <a href="https://doi.org/10.1109/ISIT.2005.1523488">10.1109/ISIT.2005.1523488</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, J. A. and Gilbert, A. C., el al. (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:TROicassp05">Simultaneous sparse approximation via greedy pursuit</a>; ISBN 0-7803-8874-7; IEEE International Conference on Acoustic, Speech, and Signal Processing (ICASSP '05), Philadelphia, PA, 18-23 March 2005; V-721; <a href="https://doi.org/10.1109/ICASSP.2005.1416405">10.1109/ICASSP.2005.1416405</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>Heath, Robert W., Jr. and Tropp, Joel A., el al. (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:HEAissta04">Construction of equiangular signatures for synchronous CDMA systems</a>; ISBN 0-7803-8408-3; International Symposium on Spread Spectrum Techniques and Applications, 8th, Sydney, Australia, 30 August - 2 September 2004; 708-712</li>
<li>Tropp, Joel A. and Dhillon, Inderjit S., el al. (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:TROissta04">Optimal CDMA signatures: a finite-step approach</a>; ISBN 0-7803-8408-3; International Symposium on Spread Spectrum Techniques and Applications, 8th, Sydney, Australia, 30 August - 2 September 2004; 335-339</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>
<li>Tropp, Joel A. and Dhillon, Inderjit S., el al. (2004) <a href="https://resolver.caltech.edu/CaltechAUTHORS:TROasilo03">CDMA signature sequences with low peak-to-average-power ratio via alternating projection</a>; ISBN 0-7803-8104-1; Asilomar Conference on Signals, Systems and Computers, 37th, Pacific Grove, CA, 9-12 November 2003; 475-479; <a href="https://doi.org/10.1109/ACSSC.2003.1291956">10.1109/ACSSC.2003.1291956</a></li>
<li>Tropp, Joel A. and Heath, Robert W., Jr., el al. (2003) <a href="https://resolver.caltech.edu/CaltechAUTHORS:TROisit03">Optimal CDMA signature sequences, inverse eigenvalue problems and alternating minimization</a>; ISBN 0-7803-7728-1; International Symposium on Information Theory (ISIT '03), Yokohama, Japan, 29 June - 4 July 2003; 407; <a href="https://doi.org/10.1109/ISIT.2003.1228424">10.1109/ISIT.2003.1228424</a></li>
<li>Tropp, J. A. and Gilbert, A. C., el al. (2003) <a href="https://resolver.caltech.edu/CaltechAUTHORS:TROicip03">Improved sparse approximation over quasi-incoherent dictionaries</a>; ISBN 0-7803-7750-8; International Conference on Image Processing (ICIP '03), Barcelona, Spain, 14-17 September 2003; I-37</li>
</ul>