(orcid 0000-0003-1024-1791)
Tropp, Joel A. (2022) ACM 204: Matrix Analysis Series Caltech CMS Lecture Notes; No. 2022-01; https://doi.org/10.7907/m421-yb89
Tropp, Joel A. (2022) Randomized block Krylov methods for approximating extreme eigenvalues Numerische Mathematik; Vol. 150; No. 1; https://doi.org/10.1007/s00211-021-01250-3
Nakatasukasa, Yuji; Tropp, Joel A. (2021) Fast & accurate randomized algorithms for linear systems and eigenvalue problems Series ACM Technical Reports, 2021-01. https://doi.org/10.7907/cmyh-va31
Ding, Lijun; Yurtsever, Alp et al. (2021) An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity SIAM Journal of Optimization; Vol. 31; No. 4; https://doi.org/10.1137/19m1244603
Levis, Aviad; Lee, Daeyoung et al. (2021) Inference of Black Hole Fluid-Dynamics from Sparse Interferometric Measurements In: 2021 IEEE/CVF International Conference on Computer Vision (ICCV); In: 2021 IEEE/CVF International Conference on Computer Vision (ICCV), 10-17 October 2021, Montreal, QB https://doi.org/10.1109/iccv48922.2021.00234
Huang, De; Niles-Weed, Jonathan et al. (2021) Matrix Concentration for Products Foundations of Computational Mathematics; https://doi.org/10.1007/s10208-021-09533-9 (In Press)
Huang, De; Tropp, Joel A. (2021) From Poincaré inequalities to nonlinear matrix concentration Bernoulli; Vol. 27; No. 3; https://doi.org/10.3150/20-BEJ1289
Sun, Yiming; Guo, Yang et al. (2021) Tensor Random Projection for Low Memory Dimension Reduction arXiv; https://doi.org/10.48550/arXiv.2105.00105
Tropp, Joel A. (2021) ACM 217: Probability in High Dimensions Series Caltech CMS Lecture Notes; No. 2021-01; https://doi.org/10.7907/mxr0-c422
Huang, De; Tropp, Joel A. (2021) Nonlinear matrix concentration via semigroup methods Electronic Journal of Probability; Vol. 26; https://doi.org/10.1214/20-EJP578
Chen, Chi-Fang; Huang, Hsin-Yuan (Robert) et al. (2020) Quantum simulation via randomized product formulas: Low gate complexity with accuracy guarantees arXiv; https://doi.org/10.48550/arXiv.2008.11751
Lotz, Martin; McCoy, Michael B. et al. (2020) Concentration of the Intrinsic Volumes of a Convex Body In: Geometric Aspects of Functional Analysis: Israel Seminar (GAFA) 2017-2019 Volume II; Quantum Potential Theory; Series Lecture Notes in Mathematics; No. 2266; https://doi.org/10.1007/978-3-030-46762-3_6
Lotz, Martin; Tropp, Joel A. (2020) Sharp phase transitions in Euclidian integral geometry Series ACM Technical Reports, 2020-01. https://doi.org/10.7907/9rja-rh15
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; https://doi.org/10.1088/1751-8121/ab8111
Martinsson, Per-Gunnar; Tropp, Joel A. (2020) Randomized numerical linear algebra: Foundations and algorithms Acta Numerica; Vol. 29; https://doi.org/10.1017/s0962492920000021
Tropp, Joel A. (2020) ACM 204: Randomized Algorithms for Matrix Computations Series Caltech CMS Lecture Notes; No. 2020-01; https://doi.org/10.7907/nwsv-df59
Yurtsever, Alp; Tropp, Joel A. et al. (2019) Scalable Semidefinite Programming arXiv; https://doi.org/10.48550/arXiv.1912.02949
Kueng, Richard; Tropp, Joel A. (2019) Binary Component Decomposition. Part I: The Positive-Semidefinite Case arXiv; https://doi.org/10.48550/arXiv.1907.13603
Kueng, Richard; Tropp, Joel A. (2019) Binary component decomposition. Part II: The asymmetric case arXiv; https://doi.org/10.48550/arXiv.1907.13602
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; https://doi.org/10.1137/18m1201068
Tropp, Joel A. (2019) Matrix Concentration & Computational Linear Algebra Series Caltech CMS Lecture Notes; No. 2019-01; https://doi.org/10.7907/nbx6-vm05
Tropp, Joel A. (2019) ACM 204: Lectures on Convex Geometry Series Caltech CMS Lecture Notes; No. 2019-02; https://doi.org/10.7907/geda-h205
Tropp, Joel A.; Yurtsever, Alp et al. (2018) More practical sketching algorithms for low-rank matrix approximation Series ACM Technical Reports, 2018-01. https://doi.org/10.7907/bb7w-ve61
Tropp, Joel A. (2018) Simplicial Faces of the Set of Correlation Matrices Discrete and Computational Geometry; Vol. 60; No. 2; https://doi.org/10.1007/s00454-017-9961-0
Tropp, Joel A. (2018) Analysis of randomized block Krylov methods Series ACM Technical Reports, 2018-02. https://resolver.caltech.edu/CaltechAUTHORS:20210624-180721369
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; https://doi.org/10.1137/17M1111590
Tropp, Joel A.; Yurtsever, Alp et al. (2017) Fixed-Rank Approximation of a Positive-Semidefinite Matrix from Streaming Data In: 31st Conference on Neural Information Processing Systems (NIPS 2017); In: 31st Conference on Neural Information Processing Systems (NIPS 2017), 4-9 December 2017, Long Beach, CA https://doi.org/10.48550/arXiv.1706.05736
Tropp, Joel A. (2017) Sketchy decisions: convex optimization with optimal storage (Conference Presentation) In: Wavelets and Sparsity XVII; Series Proceedings of SPIE; No. 10394; In: SPIE Optical Engineering + Applications, 2017, 6-10 August 2017, San Diego, CA https://doi.org/10.1117/12.2281058
Tropp, Joel A.; Yurtsever, Alp et al. (2017) Fixed-Rank Approximation of a Positive-Semidefinite Matrix from Streaming Data Series ACM Technical Reports, 2017-03. https://doi.org/10.7907/QJE2-RP11
Yurtsever, Alp; Udell, Madeleine et al. (2017) Sketchy Decisions: Convex Low-Rank Matrix Optimization with Optimal Storage In: 20th International Conference on Artificial Intelligence and Statistics (AISTATS), 20-22 April 2017, Fort Lauderdale, FL https://doi.org/10.48550/arXiv.1702.06838 (Submitted)
McCoy, Michael B.; Tropp, Joel A. (2017) The Achievable Performance of Convex Demixing Series ACM Technical Reports, 2017-02. https://doi.org/10.7907/4KWM-5N31
Tropp, Joel A. (2017) A mathematical introduction to compressive sensing [Book Review] Bulletin of the American Mathematical Society; Vol. 54; No. 1; https://doi.org/10.1090/bull/1546
Tropp, Joel A.; Yurtsever, Alp et al. (2017) Randomized Single-View Algorithms for Low-Rank Matrix Approximation Series ACM Technical Reports, 2017-01. https://doi.org/10.7907/Z9HT2M9C
Tropp, Joel A. (2016) The Expected Norm of a Sum of Independent Random Matrices: An Elementary Approach In: High Dimensional Probability VII; Series Progress in Probability (PRPR); No. 71; https://doi.org/10.1007/978-3-319-40519-3_8
Paulin, Daniel; Mackey, Lester et al. (2016) Efron–Stein inequalities for random matrices Annals of Probability; Vol. 44; No. 5; https://doi.org/10.1214/15-AOP1054
Oymak, Samet; Tropp, Joel A. (2015) Universality laws for randomized dimension reduction, with applications arXiv; https://doi.org/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; https://doi.org/10.1137/15M1024718
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; https://doi.org/10.1109/JSTSP.2015.2400412
Tropp, Joel A. (2015) An Introduction to Matrix Concentration Inequalities Foundations and Trends in Machine Learning; Vol. 8; No. 1-2; https://doi.org/10.1561/2200000048
Horstmeyer, Roarke; Chen, Richard Y. et al. (2015) Solving ptychography with a convex relaxation New Journal of Physics; Vol. 17; No. 5; https://doi.org/10.1088/1367-2630/17/5/053044
Tropp, Joel A. (2015) Second-Order Matrix Concentration Inequalities arXiv; https://doi.org/10.48550/arXiv.1504.05919
Lerman, Gilad; McCoy, Michael B. et al. (2015) Robust Computation of Linear Models by Convex Relaxation Foundations of Computational Mathematics; Vol. 15; No. 2; https://doi.org/10.1007/s10208-014-9221-0
Tropp, Joel A. (2015) Convex Recovery of a Structured Signal from Independent Random Linear Measurements In: Sampling Theory, a Renaissance: Compressive Sensing and Other Developments; Vol. I; Series Applied and Numerical Harmonic Analysi; https://doi.org/10.1007/978-3-319-19749-4_2
Moarref, Rashad; Sharma, Ati S. et al. (2014) A foundation for analytical developments in the logarithmic region of turbulent channels arXiv; https://doi.org/10.48550/arXiv.1409.6047
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; https://doi.org/10.1093/imaiai/iau005
Gittens, A.; Tropp, J. A. (2014) Error Bounds for Random Matrix Approximation Schemes Series ACM Technical Reports, 2014-01. https://doi.org/10.7907/03an-qj61
Gittens, Alex A.; Tropp, Joel A. (2014) Tail Bounds for All Eigenvalues of a Sum of Random Matrices Series ACM Technical Reports, 2014-02. https://doi.org/10.7907/tz8n-h623
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; https://doi.org/10.1007/s00454-014-9595-4
McCoy, Michael B.; Tropp, Joel A. (2014) Sharp Recovery Bounds for Convex Demixing, with Applications Foundations of Computational Mathematics; Vol. 14; No. 3; https://doi.org/10.1007/s10208-014-9191-2
Moarref, R.; Jovanović, M. R. et al. (2014) A low-order decomposition of turbulent channel flow via resolvent analysis and convex optimization Physics of Fluids; Vol. 26; No. 5; https://doi.org/10.1063/1.4876195
Mackey, Lester; Jordan, Michael I. et al. (2014) Matrix concentration inequalities via the method of exchangeable pairs Annals of Probability; Vol. 42; No. 3; https://doi.org/10.1214/13-AOP892
Chen, Richard Y.; Tropp, Joel A. (2014) Subadditivity of matrix φ-entropy and concentration of random matrices Electronic Journal of Probability; Vol. 19; https://doi.org/10.1214/EJP.v19-2964
Needell, Deanna; Tropp, Joel A. (2014) Paved with good intentions: Analysis of a randomized block Kaczmarz method Linear Algebra and its Applications; Vol. 441; https://doi.org/10.1016/j.laa.2012.12.022
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; https://doi.org/10.1063/1.4862303
Bruer, John J.; Tropp, Joel A. et al. (2014) Time–Data Tradeoffs by Aggressive Smoothing In: Advances in Neural Information Processing Systems 27 (NIPS 2014); Series Advances in Neural Information Processing Systems; No. 27; In: Twenty-eighth Annual Conference on Neural Information Processing Systems (NIPS), December 8-13, 2014, Montreal, Canada https://resolver.caltech.edu/CaltechAUTHORS:20160401-170735760
Moarref, Rashad; Sharma, Ati S. et al. (2013) Model-based scaling of the streamwise energy density in high-Reynolds-number turbulent channels Journal of Fluid Mechanics; Vol. 734; https://doi.org/10.1017/jfm.2013.457
McCoy, Michael B.; Tropp, Joel A. (2013) The achievable performance of convex demixing arXiv; https://doi.org/10.48550/arXiv.1309.7478
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; https://doi.org/10.1007/s00440-012-0441-4
Moarref, Rashad; Sharma, Ati S. et al. (2013) On effectiveness of a rank-1 model of turbulent channels for representing the velocity spectra In: 43rd Fluid Dynamics Conference, June 24-27, 2013, San Diego, CA https://doi.org/10.2514/6.2013-2480
Paulin, Daniel; Mackey, Lester et al. (2013) Deriving Matrix Concentration Inequalities from Kernel Couplings arXiv; https://doi.org/10.48550/arXiv.1305.0612
Tropp, Joel A. (2012) A comparison principle for functions of a uniformly random subspace Probability Theory and Related Fields; Vol. 153; No. 3-4; https://doi.org/10.1007/s00440-011-0360-9
Tropp, Joel A. (2012) User-Friendly Tail Bounds for Sums of Random Matrices Foundations of Computational Mathematics; Vol. 12; No. 4; https://doi.org/10.1007/s10208-011-9099-z
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; https://doi.org/10.1090/S0002-9939-2011-11141-9
Rauhut, Holger; Romberg, Justin et al. (2012) Restricted isometries for partial random circulant matrices Applied and Computational Harmonic Analysis; Vol. 32; No. 2; https://doi.org/10.1016/j.acha.2011.05.001
Chen, Richard Y.; Gittens, Alex A. et al. (2012) The Masked Sample Covariance Estimator: An Analysis via the Matrix Laplace Transform Series ACM Technical Reports, 2012-01. https://doi.org/10.7907/6rfh-ce56
Bittorf, Victor; Recht, Benjamin et al. (2012) Factoring nonnegative matrices with linear programs In: Advances in Neural Information Processing Systems 25 (NIPS 2012); Series Advances in Neural Information Processing Systems; No. 25; In: 26th Annual Conference on Neural Information Processing Systems 2012, December 3-6, 2012, Lake Tahoe, NV https://doi.org/10.48550/arXiv.1206.1270
Chen, Richard Y.; Gittens, Alex et al. (2011) The Masked Sample Covariance Estimator: An Analysis via Matrix Concentration Inequalities arXiv; https://doi.org/10.48550/arXiv.1109.1637 (Submitted)
Probel, Clément J.; Tropp, Joel A. (2011) Large-Scales PCA with Sparsity Constraints Series ACM Technical Reports, 2011-02. https://doi.org/10.7907/51g8-zc61
Tropp, Joel A. (2011) Freedman's inequality for matrix martingales Electronic Communications in Probability; Vol. 16; https://doi.org/10.1214/ECP.v16-1624
Tropp, Joel A. (2011) Freedman’s Inequality for Matrix Martingales Electronic Communications in Probability; Vol. 16; No. 25; https://doi.org/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; https://doi.org/10.1142/S1793536911000787
Tropp, Joel A. (2011) User-friendly Tail Bounds for Matrix Martingales Series ACM Technical Reports, 2011-01. https://doi.org/10.7907/62v9-yh77
Halko, N.; Martinsson, P. G. et al. (2011) Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions SIAM Review; Vol. 53; No. 2; https://doi.org/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; https://doi.org/10.1142/S1793536911000787
McCoy, Michael; Tropp, Joel A. (2011) Two proposals for robust PCA using semidefinite programming Electronic Journal of Statistics; Vol. 5; https://doi.org/10.1214/11-EJS636
Needell, Deanna; Tropp, Joel A. (2010) CoSaMP: iterative signal recovery from incomplete and inaccurate samples Communications of the ACM; Vol. 53; No. 12; https://doi.org/10.1145/1859204.1859229
Tropp, Joel A.; Wright, Stephen J. (2010) Computational Methods for Sparse Solution of Linear Inverse Problems Proceedings of the IEEE; Vol. 98; No. 6; https://doi.org/10.1109/JPROC.2010.2044010
Tropp, Joel A. (2010) User-Friendly Tail Bounds for Sums of Random Matrices Series ACM Technical Reports, 2010-01. https://doi.org/10.7907/A14X-R435
Tropp, Joel A. (2010) The sparsity gap: Uncertainty principles proportional to dimension In: 2010 44th Annual Conference on Information Sciences and Systems (CISS); In: 44th Annual Conference on Information Sciences and Systems (CISS), 17-19 March 2010, Princeton, NJ https://doi.org/10.1109/CISS.2010.5464824
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; https://doi.org/10.1109/TIT.2009.2034811
Lee, Jason; Recht, Benjamin et al. (2010) Practical Large-Scale Optimization for Max-Norm Regularization In: Advances in Neural Information Processing Systems 23 ; Series Advances in Neural Information Processing Systems; No. 23; In: Twenty-fourth Annual Conference on Neural Information Processing Systems (NIPS), December 6-9, 2010, Vancouver, B. C., Canada https://resolver.caltech.edu/CaltechAUTHORS:20160331-164724199
Halko, N.; Martinsson, P. G. et al. (2009) Finding Structure with Randomness: Stochastic Algorithms for Constructing Approximate matrix Decompositions Series ACM Technical Reports, 2009-05. https://doi.org/10.7907/PK8V-V047
Needell, D.; Tropp, J. A. (2009) CoSaMP: Iterative signal recovery from incomplete and inaccurate samples Applied and Computational Harmonic Analysis; Vol. 26; No. 3; https://doi.org/10.1016/j.acha.2008.07.002
Tropp, Joel A.; Wright, Stephen J. (2009) Computational Methods for Sparse Solution of Linear Inverse Problems Series ACM Technical Reports, 2009-01. https://doi.org/10.7907/QF0D-J303
Tropp, Joel A. (2009) Column Subset Selection, Matrix Factorization, and Eigenvalue Optimization In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms; In: 20th Annual ACM-SIAM Symposium on Discrete Algorithms, January 4-6, 2009, New York, NY https://doi.org/10.48550/arXiv.0806.4404
Mishali, Moshe; Eldar, Yonina C. et al. (2008) Efficient Sampling of Sparse Wideband Analog Signals In: 2008 IEEE 25th Convention of Electrical and Electronics Engineers in Israel; In: 2008 IEEE 25th Convention of Electrical and Electronics Engineers in Israel, 3-5 December 2008, Eilat, Israel https://doi.org/10.1109/EEEI.2008.4736707
Tropp, Joel A. (2008) Norms of random submatrices and sparse approximation Comptes Rendus Mathematique; Vol. 346; No. 23-24; https://doi.org/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; https://doi.org/10.1007/s00041-008-9042-0
Needell, Deanna; Tropp, Joel et al. (2008) Greedy Signal Recovery Review In: 2008 42nd Asilomar Conference on Signals, Systems and Computers; In: 42nd Asilomar Conference on Signals, Systems and Computers, 26-29 October 2008, Pacific Grove, CA https://doi.org/10.1109/ACSSC.2008.5074572
Needell, D.; Tropp, J. A. (2008) CoSaMP: Iterative Signal Recovery from Incomplete and Inaccurate Samples Series ACM Technical Reports, 2008-01. https://doi.org/10.7907/KE0N-TN13
Tropp, Joel A. (2008) Column Subset Selection, Matrix Factorization, and Eigenvalue Optimization Series ACM Technical Reports, 2008-02. https://doi.org/10.7907/82PQ-TF75
Brickell, Justin; Dhillon, Inderjit S. et al. (2008) The Metric Nearness Problem SIAM Journal on Matrix Analysis and Applications; Vol. 30; No. 1; https://doi.org/10.1137/060653391
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; https://doi.org/10.1109/MSP.2007.915000
Dhillon, I. S.; Heath, R. W., Jr. et al. (2008) Constructing Packings in Grassmannian Manifolds via Alternating Projection Experimental Mathematics; Vol. 17; No. 1; https://doi.org/10.1080/10586458.2008.10129018
Tropp, Joel A. (2008) The random paving property for uniformly bounded matrices Studia Mathematica; Vol. 185; No. 1; https://doi.org/10.4064/sm185-1-4
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; https://doi.org/10.1109/TIT.2007.909108
Dhillon, Inderjit S.; Tropp, Joel A. (2007) Matrix Nearness Problems with Bregman Divergences SIAM Journal on Matrix Analysis and Applications; Vol. 29; No. 4; https://doi.org/10.1137/060649021
Tropp, Joel A.; Gilbert, Anna C. (2007) Signal Recovery from Random Measurements Via Orthogonal Matching Pursuit: The Gaussian Case Series ACM Technical Reports, 2007-01. https://doi.org/10.7907/EG9R-Y984
Tropp, Joel A. (2007) Random Filters for Compressive Sampling In: Conference on Information Sciences and Systems, 40th (CISS 2006), Princeton, NJ, 22-24 March 2006; https://doi.org/10.1109/CISS.2006.286465
Gilbert, A. C.; Strauss, M. J. et al. (2006) Algorithmic linear dimension reduction in the ℓ_1 norm for sparse vectors https://doi.org/10.48550/arXiv.0608079 (Submitted)
Tropp, Joel A.; Wakin, Michael . et al. (2006) Random Filters for Compressive Sampling and Reconstruction In: International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2006), Toulouse, France, 14-19 May 2006; Vol. III; https://doi.org/10.1109/ICASSP.2006.1660793
Sra, Suvrit; Tropp, Joel A. (2006) Row-Action Methods for Compressed Sensing In: International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2006), Toulouse, France, 14-19 May 2006; Vol. III; https://doi.org/10.1109/ICASSP.2006.1660792
Herrity, Kyle K.; Gilbert, Anna C. et al. (2006) Sparse Approximation Via Iterative Thresholding In: International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2006), Toulouse, France, 14-19 May 2006; Vol. III; https://doi.org/10.1109/ICASSP.2006.1660731
Tropp, Joel A. (2006) Just relax: convex programming methods for identifying sparse signals in noise IEEE Transactions on Information Theory; Vol. 52; No. 3; https://doi.org/10.1109/TIT.2005.864420
Gilbert, A. C.; Tropp, J. A. (2005) Applications of sparse approximation in communications In: International Symposium on Information Theory (ISIT '05), Adelaide, Australia, 4-9 September 2005; https://doi.org/10.1109/ISIT.2005.1523488
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; https://doi.org/10.1137/S0895479803438183
Tropp, J. A.; Gilbert, A. C. et al. (2005) Simultaneous sparse approximation via greedy pursuit In: IEEE International Conference on Acoustic, Speech, and Signal Processing (ICASSP '05), Philadelphia, PA, 18-23 March 2005; Vol. 5; https://doi.org/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; https://doi.org/10.1109/TIT.2005.844057
Heath, Robert W., Jr.; Tropp, Joel A. et al. (2005) Construction of equiangular signatures for synchronous CDMA systems In: International Symposium on Spread Spectrum Techniques and Applications, 8th, Sydney, Australia, 30 August - 2 September 2004; https://resolver.caltech.edu/CaltechAUTHORS:HEAissta04
Tropp, Joel A.; Dhillon, Inderjit S. et al. (2005) Optimal CDMA signatures: a finite-step approach In: International Symposium on Spread Spectrum Techniques and Applications, 8th, Sydney, Australia, 30 August - 2 September 2004; https://resolver.caltech.edu/CaltechAUTHORS:TROissta04
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; https://doi.org/10.1109/TIT.2004.839492
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; https://doi.org/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; https://doi.org/10.1109/TIT.2004.834793
Tropp, Joel A.; Dhillon, Inderjit S. et al. (2004) CDMA signature sequences with low peak-to-average-power ratio via alternating projection In: Asilomar Conference on Signals, Systems and Computers, 37th, Pacific Grove, CA, 9-12 November 2003; Vol. 1; https://doi.org/10.1109/ACSSC.2003.1291956
Tropp, Joel A.; Heath, Robert W., Jr. et al. (2003) Optimal CDMA signature sequences, inverse eigenvalue problems and alternating minimization In: International Symposium on Information Theory (ISIT '03), Yokohama, Japan, 29 June - 4 July 2003; https://doi.org/10.1109/ISIT.2003.1228424
Tropp, J. A.; Gilbert, A. C. et al. (2003) Improved sparse approximation over quasi-incoherent dictionaries In: International Conference on Image Processing (ICIP '03), Barcelona, Spain, 14-17 September 2003; Vol. 1; https://resolver.caltech.edu/CaltechAUTHORS:TROicip03