Tropp, Joel

Combined from CaltechAUTHORS

• Lotz, Martin and Tropp, Joel A. (2026) Sharp Phase Transitions in Euclidean Integral Geometry; ISBN 978-3-032-06059-4; High Dimensional Probability X: The Będlewo Volume; Progress in Probability; Vol. 82; 187-258; 10.1007/978-3-032-06057-0_8
• Chen, Yifan and Epperly, Ethan N., el al. (2024) Randomly pivoted Cholesky: Practical approximation of a kernel matrix with few entry evaluations; Communications on Pure and Applied Mathematics; 10.1002/cpa.22234
• Kireeva, Anastasia and Tropp, Joel A. (2024) Randomized matrix computations: themes and variations; 54 p; 10.7907/7yade-5k351
• Chen, Chi-Fang and Dalzell, Alexander M., el al. (2024) Sparse Random Hamiltonians Are Quantumly Easy; Physical Review X; Vol. 14; No. 1; 011014; 10.1103/physrevx.14.011014
• Tropp, Joel A. (2022) ACM 204: Lectures on Convex Geometry; 10.7907/geda-h205
• Tropp, Joel A. (2022) ACM 204: Matrix Analysis; 10.7907/m421-yb89
• Tropp, Joel A. (2022) ACM 217: Probability in High Dimensions; 10.7907/mxr0-c422
• Tropp, Joel A. (2022) Randomized block Krylov methods for approximating extreme eigenvalues; Numerische Mathematik; Vol. 150; No. 1; 217-255; 10.1007/s00211-021-01250-3
• Nakatasukasa, Yuji and Tropp, Joel A. (2021) Fast & accurate randomized algorithms for linear systems and eigenvalue problems; 10.7907/cmyh-va31
• Ding, Lijun and Yurtsever, Alp, el al. (2021) An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity; SIAM Journal of Optimization; Vol. 31; No. 4; 2695-2725; 10.1137/19m1244603
• Levis, Aviad and Lee, Daeyoung, el al. (2021) Inference of Black Hole Fluid-Dynamics from Sparse Interferometric Measurements; ISBN 978-1-6654-2812-5; 2021 IEEE/CVF International Conference on Computer Vision (ICCV); 2320-2329; 10.1109/iccv48922.2021.00234
• Huang, De and Niles-Weed, Jonathan, el al. (2021) Matrix Concentration for Products; Foundations of Computational Mathematics; 10.1007/s10208-021-09533-9
• Huang, De and Tropp, Joel A. (2021) From Poincaré inequalities to nonlinear matrix concentration; Bernoulli; Vol. 27; No. 3; 1724-1744; 10.3150/20-BEJ1289
• Sun, Yiming and Guo, Yang, el al. (2021) Tensor Random Projection for Low Memory Dimension Reduction; 10.48550/arXiv.2105.00105
• Tropp, Joel A. (2021) ACM 204: Randomized Algorithms for Matrix Computations; 10.7907/nwsv-df59
• Huang, De and Tropp, Joel A. (2021) Nonlinear matrix concentration via semigroup methods; Electronic Journal of Probability; Vol. 26; Art. No. 8; 10.1214/20-EJP578
• Chen, Chi-Fang and Huang, Hsin-Yuan (Robert), el al. (2020) Quantum simulation via randomized product formulas: Low gate complexity with accuracy guarantees; 10.48550/arXiv.2008.11751
• Lotz, Martin and McCoy, Michael B., el al. (2020) Concentration of the Intrinsic Volumes of a Convex Body; ISBN 978-3-030-46761-6; Geometric Aspects of Functional Analysis: Israel Seminar (GAFA) 2017-2019 Volume II; 139-167; 10.1007/978-3-030-46762-3_6
• Lotz, Martin and Tropp, Joel A. (2020) Sharp phase transitions in Euclidian integral geometry; 10.7907/9rja-rh15
• Martinsson, Per-Gunnar and Tropp, Joel A. (2020) Randomized numerical linear algebra: Foundations and algorithms; Acta Numerica; Vol. 29; 403-572; 10.1017/s0962492920000021
• Guta, M. and Kahn, J., el al. (2020) Fast state tomography with optimal error bounds; Journal of Physics A: Mathematical and General; Vol. 53; No. 20; Art. No. 204001; 10.1088/1751-8121/ab8111
• Yurtsever, Alp and Tropp, Joel A., el al. (2019) Scalable Semidefinite Programming; 10.48550/arXiv.1912.02949
• Kueng, Richard and Tropp, Joel A. (2019) Binary Component Decomposition. Part I: The Positive-Semidefinite Case; 10.48550/arXiv.1907.13603
• Kueng, Richard and Tropp, Joel A. (2019) Binary component decomposition. Part II: The asymmetric case; 10.48550/arXiv.1907.13602
• Tropp, Joel A. and Yurtsever, Alp, el al. (2019) Streaming Low-Rank Matrix Approximation with an Application to Scientific Simulation; SIAM Journal on Scientific Computing; Vol. 41; No. 4; A2430-A2463; 10.1137/18m1201068
• Tropp, Joel A. (2019) Matrix Concentration & Computational Linear Algebra; 10.7907/nbx6-vm05
• Tropp, Joel A. and Yurtsever, Alp, el al. (2018) More practical sketching algorithms for low-rank matrix approximation; 10.7907/bb7w-ve61
• Tropp, Joel A. (2018) Simplicial Faces of the Set of Correlation Matrices; Discrete and Computational Geometry; Vol. 60; No. 2; 512-529; 10.1007/s00454-017-9961-0
• Tropp, Joel A. (2018) Analysis of randomized block Krylov methods
• Tropp, Joel A. and Yurtsever, Alp, el al. (2017) Practical Sketching Algorithms for Low-Rank Matrix Approximation; SIAM Journal on Matrix Analysis and Applications; Vol. 38; No. 4; 1454-1485; 10.1137/17M1111590
• Tropp, Joel A. and Yurtsever, Alp, el al. (2017) Fixed-Rank Approximation of a Positive-Semidefinite Matrix from Streaming Data; 10.48550/arXiv.1706.05736
• Tropp, Joel A. (2017) Sketchy decisions: convex optimization with optimal storage (Conference Presentation); ISBN 9781510612457; Wavelets and Sparsity XVII; Art. No. 1039403; 10.1117/12.2281058
• Tropp, Joel A. and Yurtsever, Alp, el al. (2017) Fixed-Rank Approximation of a Positive-Semidefinite Matrix from Streaming Data; 10.7907/QJE2-RP11
• Yurtsever, Alp and Udell, Madeleine, el al. (2017) Sketchy Decisions: Convex Low-Rank Matrix Optimization with Optimal Storage; 10.48550/arXiv.1702.06838
• McCoy, Michael B. and Tropp, Joel A. (2017) The Achievable Performance of Convex Demixing; 10.7907/4KWM-5N31
• Tropp, Joel A. and Yurtsever, Alp, el al. (2017) Randomized Single-View Algorithms for Low-Rank Matrix Approximation; 10.7907/Z9HT2M9C
• Tropp, Joel A. (2017) A mathematical introduction to compressive sensing [Book Review]; Bulletin of the American Mathematical Society; Vol. 54; No. 1; 151-165; 10.1090/bull/1546
• Tropp, Joel A. (2016) The Expected Norm of a Sum of Independent Random Matrices: An Elementary Approach; ISBN 978-3-319-40517-9; High Dimensional Probability VII; 173-202; 10.1007/978-3-319-40519-3_8
• Paulin, Daniel and Mackey, Lester, el al. (2016) Efron–Stein inequalities for random matrices; Annals of Probability; Vol. 44; No. 5; 3431-3473; 10.1214/15-AOP1054
• Oymak, Samet and Tropp, Joel A. (2015) Universality laws for randomized dimension reduction, with applications; 10.48550/arXiv.1511.09433
• Tropp, Joel A. (2015) Integer Factorization of a Positive-Definite Matrix; SIAM Journal on Discrete Mathematics; Vol. 29; No. 4; 1783-1791; 10.1137/15M1024718
• Bruer, John J. and Tropp, Joel A., el 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; 612-624; 10.1109/JSTSP.2015.2400412
• Horstmeyer, Roarke and Chen, Richard Y., el al. (2015) Solving ptychography with a convex relaxation; New Journal of Physics; Vol. 17; No. 5; Art. No. 053044; PMCID PMC4486359; 10.1088/1367-2630/17/5/053044
• Tropp, Joel A. (2015) An Introduction to Matrix Concentration Inequalities; Foundations and Trends in Machine Learning; Vol. 8; No. 1-2; 1-230; 10.1561/2200000048
• Tropp, Joel A. (2015) Second-Order Matrix Concentration Inequalities; 10.48550/arXiv.1504.05919
• Lerman, Gilad and McCoy, Michael B., el al. (2015) Robust Computation of Linear Models by Convex Relaxation; Foundations of Computational Mathematics; Vol. 15; No. 2; 363-410; 10.1007/s10208-014-9221-0
• Tropp, Joel A. (2015) Convex Recovery of a Structured Signal from Independent Random Linear Measurements; ISBN 978-3-319-19748-7; Sampling Theory, a Renaissance: Compressive Sensing and Other Developments; 67-101; 10.1007/978-3-319-19749-4_2
• Moarref, Rashad and Sharma, Ati S., el al. (2014) A foundation for analytical developments in the logarithmic region of turbulent channels; 10.48550/arXiv.1409.6047
• Amelunxen, Dennis and Lotz, Martin, el al. (2014) Living on the edge: phase transitions in convex programs with random data; Information and Inference; Vol. 3; No. 3; 224-294; 10.1093/imaiai/iau005
• Gittens, A. and Tropp, J. A. (2014) Error Bounds for Random Matrix Approximation Schemes; 10.7907/03an-qj61
• Gittens, Alex A. and Tropp, Joel A. (2014) Tail Bounds for All Eigenvalues of a Sum of Random Matrices; 10.7907/tz8n-h623
• McCoy, Michael B. and Tropp, Joel A. (2014) From Steiner Formulas for Cones to Concentration of Intrinsic Volumes; Discrete and Computational Geometry; Vol. 51; No. 4; 926-963; 10.1007/s00454-014-9595-4
• McCoy, Michael B. and Tropp, Joel A. (2014) Sharp Recovery Bounds for Convex Demixing, with Applications; Foundations of Computational Mathematics; Vol. 14; No. 3; 503-567; 10.1007/s10208-014-9191-2
• Moarref, R. and Jovanović, M. R., el al. (2014) A low-order decomposition of turbulent channel flow via resolvent analysis and convex optimization; Physics of Fluids; Vol. 26; No. 5; Art. No. 051701; 10.1063/1.4876195
• Mackey, Lester and Jordan, Michael I., el al. (2014) Matrix concentration inequalities via the method of exchangeable pairs; Annals of Probability; Vol. 42; No. 3; 906-945; 10.1214/13-AOP892
• Chen, Richard Y. and Tropp, Joel A. (2014) Subadditivity of matrix φ-entropy and concentration of random matrices; Electronic Journal of Probability; Vol. 19; Art. No. 27; 10.1214/EJP.v19-2964
• Needell, Deanna and Tropp, Joel A. (2014) Paved with good intentions: Analysis of a randomized block Kaczmarz method; Linear Algebra and its Applications; Vol. 441; 199-221; 10.1016/j.laa.2012.12.022
• Bourguignon, J.-L. and Tropp, J. A., el al. (2014) Compact representation of wall-bounded turbulence using compressive sampling; Physics of Fluids; Vol. 26; No. 1; Art. No. 015109; 10.1063/1.4862303
• Bruer, John J. and Tropp, Joel A., el al. (2014) Time–Data Tradeoffs by Aggressive Smoothing
• Moarref, Rashad and Sharma, Ati S., el al. (2013) Model-based scaling of the streamwise energy density in high-Reynolds-number turbulent channels; Journal of Fluid Mechanics; Vol. 734; 275-316; 10.1017/jfm.2013.457
• McCoy, Michael B. and Tropp, Joel A. (2013) The achievable performance of convex demixing; 10.48550/arXiv.1309.7478
• Pfander, Götz E. and Rauhut, Holger, el al. (2013) The restricted isometry property for time-frequency structured random matrices; Probability Theory and Related Fields; Vol. 156; No. 3-4; 707-737; 10.1007/s00440-012-0441-4
• Moarref, Rashad and Sharma, Ati S., el al. (2013) On effectiveness of a rank-1 model of turbulent channels for representing the velocity spectra; 10.2514/6.2013-2480
• Paulin, Daniel and Mackey, Lester, el al. (2013) Deriving Matrix Concentration Inequalities from Kernel Couplings; 10.48550/arXiv.1305.0612
• Tropp, Joel A. (2012) User-Friendly Tail Bounds for Sums of Random Matrices; Foundations of Computational Mathematics; Vol. 12; No. 4; 389-434; 10.1007/s10208-011-9099-z
• Tropp, Joel A. (2012) A comparison principle for functions of a uniformly random subspace; Probability Theory and Related Fields; Vol. 153; No. 3-4; 759-769; 10.1007/s00440-011-0360-9
• 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; 1757-1760; 10.1090/S0002-9939-2011-11141-9
• Rauhut, Holger and Romberg, Justin, el al. (2012) Restricted isometries for partial random circulant matrices; Applied and Computational Harmonic Analysis; Vol. 32; No. 2; 242-254; 10.1016/j.acha.2011.05.001
• Chen, Richard Y. and Gittens, Alex A., el al. (2012) The Masked Sample Covariance Estimator: An Analysis via the Matrix Laplace Transform; 10.7907/6rfh-ce56
• Bittorf, Victor and Recht, Benjamin, el al. (2012) Factoring nonnegative matrices with linear programs; ISBN 978-1-62748-003-1; Advances in Neural Information Processing Systems 25 (NIPS 2012); 10.48550/arXiv.1206.1270
• Chen, Richard Y. and Gittens, Alex, el al. (2011) The Masked Sample Covariance Estimator: An Analysis via Matrix Concentration Inequalities; 10.48550/arXiv.1109.1637
• Probel, Clément J. and Tropp, Joel A. (2011) Large-Scales PCA with Sparsity Constraints; 10.7907/51g8-zc61
• Tropp, Joel A. (2011) Freedman's inequality for matrix martingales; Electronic Communications in Probability; Vol. 16; 262-270; 10.1214/ECP.v16-1624
• Tropp, Joel A. (2011) Freedman's Inequality for Matrix Martingales; Electronic Communications in Probability; Vol. 16; No. 25; 262-270; 10.1214/ECP.v16-1624
• Tropp, Joel A. (2011) Improved analysis of the subsampled randomized Hadamard transform; Advances in Adaptive Data Analysis; Vol. 3; No. 1-2; 115-126; 10.1142/S1793536911000787
• Tropp, Joel A. (2011) User-friendly Tail Bounds for Matrix Martingales; 10.7907/62v9-yh77
• McCoy, Michael and Tropp, Joel A. (2011) Two proposals for robust PCA using semidefinite programming; Electronic Journal of Statistics; Vol. 5; 1123-1160; 10.1214/11-EJS636
• Halko, N. and Martinsson, P. G., el al. (2011) Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions; SIAM Review; Vol. 53; No. 2; 217-288; 10.1137/090771806
• Tropp, Joel A. (2011) Improved Analysis of the Subsamples Randomized Hadamard Transform; Advances in Adaptive Data Analysis; Vol. 3; No. 1-2; 115-126; 10.1142/S1793536911000787
• Needell, Deanna and Tropp, Joel A. (2010) CoSaMP: iterative signal recovery from incomplete and inaccurate samples; Communications of the ACM; Vol. 53; No. 12; 93-100; 10.1145/1859204.1859229
• Tropp, Joel A. and Wright, Stephen J. (2010) Computational Methods for Sparse Solution of Linear Inverse Problems; Proceedings of the IEEE; Vol. 98; No. 6; 948-958; 10.1109/JPROC.2010.2044010
• Tropp, Joel A. (2010) User-Friendly Tail Bounds for Sums of Random Matrices; 10.7907/A14X-R435
• Tropp, Joel A. (2010) The sparsity gap: Uncertainty principles proportional to dimension; ISBN 978-1-4244-7416-5; 2010 44th Annual Conference on Information Sciences and Systems (CISS); 1-6; 10.1109/CISS.2010.5464824
• Tropp, Joel A. and Laska, Jason N., el al. (2010) Beyond Nyquist: Efficient Sampling of Sparse Bandlimited Signals; IEEE Transactions on Information Theory; Vol. 56; No. 1; 520-544; 10.1109/TIT.2009.2034811
• Lee, Jason and Recht, Benjamin, el al. (2010) Practical Large-Scale Optimization for Max-Norm Regularization; ISBN 9781617823800; Advances in Neural Information Processing Systems 23
• Halko, N. and Martinsson, P. G., el al. (2009) Finding Structure with Randomness: Stochastic Algorithms for Constructing Approximate matrix Decompositions; 10.7907/PK8V-V047
• Needell, D. and Tropp, J. A. (2009) CoSaMP: Iterative signal recovery from incomplete and inaccurate samples; Applied and Computational Harmonic Analysis; Vol. 26; No. 3; 301-321; 10.1016/j.acha.2008.07.002
• Tropp, Joel A. and Wright, Stephen J. (2009) Computational Methods for Sparse Solution of Linear Inverse Problems; 10.7907/QF0D-J303
• Tropp, Joel A. (2009) Column Subset Selection, Matrix Factorization, and Eigenvalue Optimization; ISBN 978-0-898716-80-1; Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms; 978-986; 10.48550/arXiv.0806.4404
• Tropp, Joel A. (2008) Norms of random submatrices and sparse approximation; Comptes Rendus Mathematique; Vol. 346; No. 23-24; 1271-1274; 10.1016/j.crma.2008.10.008
• Tropp, Joel A. (2008) On the Linear Independence of Spikes and Sines; Journal of Fourier Analysis and Applications; Vol. 14; No. 5-6; 838-858; 10.1007/s00041-008-9042-0
• Mishali, Moshe and Eldar, Yonina C., el al. (2008) Efficient Sampling of Sparse Wideband Analog Signals; ISBN 978-1-4244-2481-8; 2008 IEEE 25th Convention of Electrical and Electronics Engineers in Israel; 290-294; 10.1109/EEEI.2008.4736707
• Needell, Deanna and Tropp, Joel, el al. (2008) Greedy Signal Recovery Review; ISBN 978-1-4244-2941-7; 2008 42nd Asilomar Conference on Signals, Systems and Computers; 1048-1050; 10.1109/ACSSC.2008.5074572
• Needell, D. and Tropp, J. A. (2008) CoSaMP: Iterative Signal Recovery from Incomplete and Inaccurate Samples; 10.7907/KE0N-TN13
• Tropp, Joel A. (2008) Column Subset Selection, Matrix Factorization, and Eigenvalue Optimization; 10.7907/82PQ-TF75
• Brickell, Justin and Dhillon, Inderjit S., el al. (2008) The Metric Nearness Problem; SIAM Journal on Matrix Analysis and Applications; Vol. 30; No. 1; 375-396; 10.1137/060653391
• Gilnert, Anna C. and Strauss, Martin J., el al. (2008) A Tutorial on Fast Fourier Sampling [How to apply it to problems]; IEEE Signal Processing Magazine; Vol. 25; No. 2; 57-66; 10.1109/MSP.2007.915000
• Tropp, Joel A. (2008) The random paving property for uniformly bounded matrices; Studia Mathematica; Vol. 185; No. 1; 67-82; 10.4064/sm185-1-4
• Dhillon, I. S. and Heath, R. W., Jr., el al. (2008) Constructing Packings in Grassmannian Manifolds via Alternating Projection; Experimental Mathematics; Vol. 17; No. 1; 9-35; 10.1080/10586458.2008.10129018
• Tropp, Joel A. and Gilbert, Anna C. (2007) Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit; IEEE Transactions on Information Theory; Vol. 53; No. 12; 4655-4666; 10.1109/TIT.2007.909108
• Dhillon, Inderjit S. and Tropp, Joel A. (2007) Matrix Nearness Problems with Bregman Divergences; SIAM Journal on Matrix Analysis and Applications; Vol. 29; No. 4; 1120-1146; 10.1137/060649021
• Tropp, Joel A. and Gilbert, Anna C. (2007) Signal Recovery from Random Measurements Via Orthogonal Matching Pursuit: The Gaussian Case; 10.7907/EG9R-Y984
• Tropp, Joel A. (2007) Random Filters for Compressive Sampling; ISBN 1-4244-0350-2; Conference on Information Sciences and Systems, 40th (CISS 2006), Princeton, NJ, 22-24 March 2006; 216-217; 10.1109/CISS.2006.286465
• Gilbert, A. C. and Strauss, M. J., el al. (2006) Algorithmic linear dimension reduction in the ℓ_1 norm for sparse vectors; 10.48550/arXiv.0608079
• Tropp, Joel A. and Wakin, Michael ., el al. (2006) Random Filters for Compressive Sampling and Reconstruction; ISBN 1-4244-0469-X; International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2006), Toulouse, France, 14-19 May 2006; III-872; 10.1109/ICASSP.2006.1660793
• Herrity, Kyle K. and Gilbert, Anna C., el al. (2006) Sparse Approximation Via Iterative Thresholding; ISBN 1-4244-0469-X; International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2006), Toulouse, France, 14-19 May 2006; III-624; 10.1109/ICASSP.2006.1660731
• Sra, Suvrit and Tropp, Joel A. (2006) Row-Action Methods for Compressed Sensing; ISBN 1-4244-0469-X; International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2006), Toulouse, France, 14-19 May 2006; III-868; 10.1109/ICASSP.2006.1660792
• Tropp, Joel A. (2006) Just relax: convex programming methods for identifying sparse signals in noise; IEEE Transactions on Information Theory; Vol. 52; No. 3; 1030-1051; 10.1109/TIT.2005.864420
• Gilbert, A. C. and Tropp, J. A. (2005) Applications of sparse approximation in communications; ISBN 0-7803-9151-9; International Symposium on Information Theory (ISIT '05), Adelaide, Australia, 4-9 September 2005; 1000-1004; 10.1109/ISIT.2005.1523488
• Dhillon, Inderjit S. and Heath, Robert W., Jr., el 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; 61-71; 10.1137/S0895479803438183
• Tropp, J. A. and Gilbert, A. C., el al. (2005) Simultaneous sparse approximation via greedy pursuit; ISBN 0-7803-8874-7; IEEE International Conference on Acoustic, Speech, and Signal Processing (ICASSP '05), Philadelphia, PA, 18-23 March 2005; V-721; 10.1109/ICASSP.2005.1416405
• Tropp, Joel A. (2005) Recovery of short, complex linear combinations via ℓ1 minimization; IEEE Transactions on Information Theory; Vol. 2005; No. 4; 1568-1570; 10.1109/TIT.2005.844057
• Tropp, Joel A. and Dhillon, Inderjit S., el al. (2005) Optimal CDMA signatures: a finite-step approach; ISBN 0-7803-8408-3; International Symposium on Spread Spectrum Techniques and Applications, 8th, Sydney, Australia, 30 August - 2 September 2004; 335-339
• Heath, Robert W., Jr. and Tropp, Joel A., el al. (2005) Construction of equiangular signatures for synchronous CDMA systems; ISBN 0-7803-8408-3; International Symposium on Spread Spectrum Techniques and Applications, 8th, Sydney, Australia, 30 August - 2 September 2004; 708-712
• Tropp, Joel A. and Dhillon, Inderjit S., el al. (2005) Designing structured tight frames via an alternating projection method; IEEE Transactions on Information Theory; Vol. 51; No. 1; 188-209; 10.1109/TIT.2004.839492
• Tropp, Joel A. and Dhillon, Inderjit S., el al. (2004) Finite-step algorithms for constructing optimal CDMA signature sequences; IEEE Transactions on Information Theory; Vol. 50; No. 11; 2916-2921; 10.1109/TIT.2004.836698
• Tropp, Joel A. (2004) Greed is good: algorithmic results for sparse approximation; IEEE Transactions on Information Theory; Vol. 50; No. 10; 2231-2242; 10.1109/TIT.2004.834793
• Tropp, Joel A. and Dhillon, Inderjit S., el al. (2004) CDMA signature sequences with low peak-to-average-power ratio via alternating projection; ISBN 0-7803-8104-1; Asilomar Conference on Signals, Systems and Computers, 37th, Pacific Grove, CA, 9-12 November 2003; 475-479; 10.1109/ACSSC.2003.1291956
• Tropp, Joel A. and Heath, Robert W., Jr., el al. (2003) Optimal CDMA signature sequences, inverse eigenvalue problems and alternating minimization; ISBN 0-7803-7728-1; International Symposium on Information Theory (ISIT '03), Yokohama, Japan, 29 June - 4 July 2003; 407; 10.1109/ISIT.2003.1228424
• Tropp, J. A. and Gilbert, A. C., el al. (2003) Improved sparse approximation over quasi-incoherent dictionaries; ISBN 0-7803-7750-8; International Conference on Image Processing (ICIP '03), Barcelona, Spain, 14-17 September 2003; I-37