In the Pipeline...
 More to come!
Monograph

An Introduction to Matrix Concentration Inequalities.
by J. A. Tropp.
Found. Trends Mach. Learning, Vol. 8, num. 12, pp. 1230, May 2015.
doi:10.1561/2200000048.
[ FnTML Draft, revised 
arXiv ma.PR 1501.01571 ]
Book Chapters
 "The expected norm of a sum of independent random matrices: An elementary approach"
by J. A. Tropp.
HighDimensional Probability VII: The Cargese Volume.
Eds. C. Houdre, D. M. Mason, P. ReynaudBouret, and J. Rosinski.
Ser. Progress in Probability 71. Birkhaeuser, Basel, 2016.
doi:10.1007/9783319405193.
[ .pdf 
arXiv ma.PR 1506.04711 ]
 "Convex recovery of a structured signal from independent random linear measurements"
by J. A. Tropp.
Sampling Theory, a Renaissance: Compressive sampling and other developments.
Ed. G. Pfander. Ser. Applied and Numerical Harmonic Analysis. Birkhaeuser, Basel, 2015.
doi:10.1007/9783319197494.
[ .pdf 
arXiv cs.IT 1405.1102 ]
Book Review
 "A mathematical introduction to compressive sampling, by Simon Foucart and Holger Rauhut."
by J. A. Tropp.
Invited review for Bull. Amer. Math. Soc., July 2016.
[ .pdf ]
Theses

Topics in Sparse Approximation.
by J. A. Tropp.
Ph.D. dissertation, Computational and Applied Mathematics, Univ. Texas at Austin, Aug. 2004.
Advisors: I. S. Dhillon and A. C. Gilbert.
[ .pdf ]

Infinitesimals: History and Application
by J. A. Tropp.
Senior thesis, Mathematics Dept., Univ. Texas at Austin, May 1999.
[ .pdf ]
Refereed Journal Publications
 "Simplicial faces of the set of correlation matrices"
by J. A. Tropp.
Discrete Comput. Geom., Jan. 2018.
doi:10.1007/s0045401799610.
[ Preprint .pdf 
arXiv ma.MG 1801.00749 ]
 "Practical sketching algorithms for lowrank matrix approximation"
by J. A. Tropp, A. Yurtsever, M. Udell, and V. Cevher.
SIAM J. Matrix Anal. Appl., Vol. 38, num 4, pp. 14541485, Dec. 2017.
doi:10.1137/17M1111590.
[ .pdf 
arXiv cs.NA 1609.00048 
report .pdf 
code .zip ]
 "Universality laws for randomized dimension reduction, with applications"
by S. Oymak and J. A. Tropp.
Inform. Inference, Nov. 2017.
doi:10.1093/imaiai/iax011.
[ Journal 
Preprint .pdf 
arXiv ma.PR 1511.09433 
code .zip ]
 "Secondorder matrix concentration inequalities"
by J. A. Tropp.
Accepted to
Appl. Comput. Harmonic Anal., July 2016. To appear.
doi:10.1016/j.acha.2016.07.005.
[ Preprint .pdf 
arXiv ma.PR 1504.05919 ]
 "EfronStein inequalities for random matrices"
by D. Paulin, L. Mackey, and J. A. Tropp.
Ann. Probab., Vol. 44, num. 5, pp. 34313473, 2016.
doi:10.1214/15AOP1054.
[ Paper .pdf 
arXiv ma.PR 1408.3470 ]
 "Integer factorization of a positivedefinite matrix"
by J. A. Tropp.
SIAM J. Discrete Math., Vol. 29, num. 4, pp. 17831791, 2015.
doi:10.1137/15M1024718.
[ Paper .pdf 
arXiv ma.MG 1506.00340 ]
 "Designing statistical estimators that balance sample size, risk, and computational cost"
by J. J. Bruer, J. A. Tropp, V. Cevher, and S. J. Becker.
IEEE J. Selected Topics Signal Processing, Vol. 9, num. 4, pp. 612624, June 2015.
[ Paper .pdf ]
 "Solving ptychography with a convex relaxation"
by R. Horstmeyer, R. Y. Chen, X. Ou, B. Ames, J. A. Tropp, and C. Yang.
New J. Physics, Vol. 17, article 053044, pp. 115, May 2015.
doi:10.1088/13672630/17/5/053044.
[ Paper .pdf 
arXiv physics.optics 1412.1209 ]
 "Robust computation of linear models via convex relaxation"
by G. Lerman, M. McCoy, J. A. Tropp, and T. Zhang.
Found. Comput. Math, Vol. 15, num. 2, pp. 363410, Apr. 2015.
doi:10.1007/s1020801492210.
[ Preprint .pdf 
arXiv cs.IT 1202.4044 ]
 "Living on the edge: Phase transitions in convex programs with random data"
by D. Amelunxen, M. Lotz, M. B. McCoy, and J. A. Tropp.
Inform. Inference, Vol. 3, num. 3, pp. 224294, 2014. doi:10.1093/imaiai/iau005
IMA Information and Inference Best Paper Award, 2015.
Published version available from
Oxford Univ. Press.
[ Preprint .pdf 
arXiv cs.IT 1303.6672 ]
 "Sharp recovery bounds for convex demixing, with applications"
by M. B. McCoy and J. A. Tropp.
Found. Comput. Math., Vol. 14, num. 3, pp. 503567, 2014.
doi:10.1007/s1020801491912.
[ Preprint .pdf 
arXiv cs.IT 1205.1580 ]
 "From Steiner formulas for cones to concentration of intrinsic volumes"
by M. B. McCoy and J. A. Tropp.
Discrete Comput. Geom., Vol. 51, num. 4, pp. 926963, 2014.
doi:10.1007/s0045401495954.
Note: arXiv version contains several corrections.
[ Preprint .pdf 
arXiv ma.MG
1308.5265 ]
 "A loworder decomposition of turbulent channel flow via resolvent
analysis and convex optimization"
by R. Moarref, M. R. Jovanovic, J. A. Tropp, A. S. Sharma, and B.
J. McKeon.
Phys. Fluids, Vol. 26, num. 5, 051701, 2014.
doi:10.1063/1.4876195.
[ arXiv physics.fludyn 1401.6417 ]
 "Matrix concentration inequalities via the method of exchangeable pairs"
by L. Mackey, M. I. Jordan, R. Y. Chen, B. Farrell, and J. A. Tropp.
Ann. Probab.,
Vol. 42, num. 3, pp. 906945, 2014.
[ Paper .pdf 
arXiv math.PR 1201.6002 ]
 "Subadditivity of matrix phientropy and concentration of random matrices"
by R. Y. Chen and J. A. Tropp.
Electron. J. Probab., Vol. 19, Article 27, pp. 130, Mar. 2014.
doi:10.1214/EJP.v192964.
[ Paper .pdf 
arXiv cs.IT
1308.2952 ]
 "Compact representation of wallbounded turbulence using compressive sampling"
by J.L. Bourguignon, J. A. Tropp, A. S. Sharma, and B. J. McKeon.
This article appeared in Phys. Fluids, Vol. 26, num. 1, online 22 Jan. 2014.
doi:10.1063/1.4862303. It may be found at
this URL.
Copyright 2014 American Institute of Physics. This article may be downloaded for personal use only.
Any other use requires prior permission of the author and the American Institute of Physics.
[ Reprint .pdf ]
 "Paved with good intentions: Analysis of a randomized block Kaczmarz method"
by D. Needell and J. A. Tropp.
Linear Alg. Appl., Vol. 441, pp. 199221, Jan. 2014. doi:10.1016/j.laa.2012.12.022.
[ Preprint .pdf 
arXiv math.NA 1208.3805 ]
 "Modelbased scaling and prediction of the streamwise energy intensity in highReynolds number turbulent channels"
by R. Moarref, A. S. Sharma, J. A. Tropp, and B. J. McKeon.
J. Fluid. Mech., Vol. 734, pp. 275316, 2013.
[ Preprint .pdf 
arXiv physics.fludyn 1302.1594 ]
 "The restricted isometry property for timefrequency structured random matrices"
by G. Pfander, H. Rauhut, and J. A. Tropp.
Probab. Theory Related Fields, Vol. 156, num. 34, pp. 707737, Aug. 2013.
doi:10.1007/s0044001204414.
[ Preprint .pdf 
arXiv cs.IT 1106.3184 ]
 "The masked sample covariance estimator: An analysis via matrix concentration inequalities"
by R. Y. Chen, A. Gittens, and J. A. Tropp.
Inform. Inference, Vol. 1, pp. 220, 2012.
doi:10.1093/imaiai/ias001.
[ Paper .pdf 
Report .pdf 
arXiv math.ST 1109.1637 ]
 "Userfriendly tail bounds for sums of random matrices"
by J. A. Tropp.
Found. Comput. Math., Vol. 12, num. 4, pp. 389434, 2012.
doi:10.1007/s102080119099z.
[ Paper .pdf 
Report .pdf 
arXiv math.PR 1004.4389 ]
 "A comparison principle for functions of a uniformly random subspace"
by J. A. Tropp.
Probab. Theory Related Fields, Vol. 153, num. 34, pp. 759769, 2012. doi:10.1007/s0044001103609.
[ Paper .pdf 
arXiv math.PR 1102.0534 ]
 "From the joint convexity of quantum relative entropy to a concavity theorem of Lieb"
by J. A. Tropp.
Proc. Amer. Math. Soc., Vol. 140, num. 5, pp. 17571760, May 2012.
doi:10.1090/S000299392011111419.
[ Paper .pdf 
arXiv math.IT 1101.1070 ]
 "Restricted isometries for partial random circulant matrices"
by H. Rauhut, J. Romberg, and J. A. Tropp.
Appl. Comput. Harmon. Anal., Vol. 32, pp. 242254, 2012.
doi:10.1016/j.acha.2011.05.001.
[ Preprint .pdf 
arXiv cs.IT 1010.1847 ]
 "Two proposals for robust PCA using semidefinite programming"
by M. McCoy and J. A. Tropp.
Electron. J. Stat., Vol. 5, num. 0, pp. 11231160, June 2011.
doi:10.1214/11EJS636.
[ Paper .pdf 
arXiv stat.CO 1012.1086 
code .tar.gz ]
 "Improved analysis of the subsampled randomized Hadamard transform"
by J. A. Tropp.
Adv. Adapt. Data Anal., Vol. 3, num. 12, special issue,
"Sparse Representation of Data and Images," pp. 115126, 2011.
[ Preprint .pdf 
arXiv math.NA 1011.1595 ]
 "Freedman's inequality for matrix martingales"
by J. A. Tropp.
Electron. Commun. Probab., Vol. 16, pp. 262270, 2011.
[ Paper .pdf 
Report .pdf 
arXiv math.PR 1101.3039 ]
 "Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions"
by N. Halko, P. G. Martinsson, and J. A. Tropp.
SIAM Rev., Survey and Review section, Vol. 53, num. 2, pp. 217288, June 2011.
[ Paper .pdf 
arXiv math.NA 0909.4061 ]
 "Computational methods for sparse solution of linear inverse problems"
by J. A. Tropp and S. J. Wright.
Proc. IEEE, invited paper, special issue, "Applications of sparse representation and compressive sensing,"
Vol. 98, num. 5, pp. 948958, June 2010.
[ Paper .pdf 
Report .pdf ]
 "Beyond Nyquist: Efficient sampling of sparse, bandlimited signals"
by J. A. Tropp, J. N. Laska, M. F. Duarte, J. K. Romberg, and R. G. Baraniuk.
IEEE Trans. Inform. Theory, Vol.56, num. 1, pp. 520544, Jan. 2010.
[ Paper .pdf 
arXiv cs.IT 0902.0026 ]
 "CoSaMP: Iterative signal recovery from incomplete and inaccurate samples"
by D. Needell and J. A. Tropp.
Appl. Comput. Harmon. Anal., Vol. 26, pp. 301321, 2008.
Selected as the ScienceWatch fastbreaking paper in mathematics, Aug. 2010.
Extended abstract published in Commun. Assoc. Comput. Mach., "Research Highlights" section, Dec. 2010.
[ CACM Abstract .pdf 
Preprint .pdf 
Report .pdf 
arXiv math.NA 0803.2392 ]
 "On the linear independence of spikes and sines"
by J. A. Tropp.
J. Fourier Anal. Appl., Vol. 14, pp. 838858, 2008.
[ Preprint .pdf 
arXiv math.FA 0709.0517 ]
 "Norms of random submatrices and sparse approximation"
by J. A. Tropp.
C. R. Acad. Sci. Paris, Ser. I, Vol. 346, pp. 12711274, 2008.
[ Preprint .pdf ]

"The metric nearness problem"
by J. Brickell, I. S. Dhillon, S. Sra, and J. A. Tropp.
SIAM J. Matrix Anal. Appl., vol. 30, num. 1, pp. 375396, Apr. 2008.
SIAM 2011 Outstanding Paper Prize.
[ Paper .pdf ]
 "A Tutorial on Fast Fourier Sampling"
by A. C. Gilbert, M. J. Strauss, and J. A. Tropp
Signal Processing Mag., pp. 5766. Mar. 2008.
[ Paper .pdf ]

"Constructing packings in Grassmannian manifolds via alternating projection"
by I. S. Dhillon, R. W. Heath Jr., T. Strohmer, and J. A. Tropp.
Exper. Math., vol. 17, num. 1, pp. 935, 2008.
[ Preprint .pdf 
arXiv math.MG 0709.0535 ]

"On the conditioning of random subdictionaries"
by J. A. Tropp.
Appl. Comput. Harmon. Anal., vol. 25, pp. 124, 2008.
[ Preprint .pdf ]
 "The random paving property for uniformly bounded matrices"
by J. A. Tropp.
Studia Math., vol. 185, num. 1, pp. 6782, 2008.
[ Preprint .pdf 
arXiv math.MG 0612.5070 ]

"Signal recovery from random measurements via Orthogonal Matching Pursuit"
by J. A. Tropp and A. C. Gilbert.
IEEE Trans. Inform. Theory, vol. 53, num. 12, pp. 46554666, Dec. 2007.
[ Paper .pdf ]

"Matrix nearness problems with Bregman divergences"
by I. S. Dhillon and J. A. Tropp.
SIAM J. Matrix Anal. Appl., vol. 29, num. 4, pp. 11201146, Nov. 2007.
[ Paper .pdf ]

"On the existence of equiangular tight frames"
by M. Sustik, J. A. Tropp, I. S. Dhillon, and R. W. Heath Jr.
Linear Algebra Appl., vol. 426, num. 23, pp. 619635, 2007.
[ Preprint .pdf ]

"Algorithms for simultaneous sparse approximation. Part I: Greedy pursuit"
by J. A. Tropp, A. C. Gilbert, and M. J. Strauss.
Signal Processing, special issue "Sparse approximations in signal and image processing," vol. 86, pp. 572588, Apr. 2006.
EUSIPCO Best Paper Award, 2010.
[ Preprint .pdf ]
 "Algorithms for simultaneous sparse approximation. Part II: Convex relaxation"
by J. A. Tropp.
Signal Processing, special issue "Sparse approximations in signal and image processing," vol. 86, pp. 589602, Apr. 2006.
[ Preprint .pdf ]

"Just relax: Convex programming methods for identifying sparse signals"
by J. A. Tropp.
IEEE Trans. Inform. Theory, vol. 52, num. 3, pp. 10301051, Mar. 2006.
Correction, IEEE Trans. Inform. Theory, vol. 55, num. 2, pp. 917918, Feb. 2009.
[ Paper .pdf 
Correction .pdf ]

"Generalized finite algorithms for constructing Hermitian matrices with prescribed diagonal and spectrum"
by I. S. Dhillon, R. W. Heath Jr., M. Sustik, and J. A. Tropp.
SIAM J. Matrix Anal. Appl., vol. 27, num. 1, pp. 6171, June 2005.
[ Paper .pdf ]

"Recovery of short, complex linear combinations via l_{1} minimization"
by J. A. Tropp.
IEEE Trans. Inform. Theory, vol. 51, num. 4, pp. 15681570, Apr. 2005.
[ Paper .pdf ]

"Designing structured tight frames via alternating projection"
by Joel A. Tropp, I. S. Dhillon, R. W. Heath Jr., and T. Strohmer.
IEEE Trans. Inform. Theory, vol. 51, num. 1, pp. 188209, Jan. 2005.
[ Paper .pdf ]

"Finitestep algorithms for constructing optimal CDMA signature sequences"
by J. A. Tropp, I. S. Dhillon, and R. W. Heath Jr.
IEEE Trans. Inform. Theory, vol. 50, num. 11, pp. 29162921, Nov. 2004.
[ Paper .pdf ]

"Greed is good: Algorithmic results for sparse approximation"
by J. A. Tropp.
IEEE Trans. Inform. Theory, vol. 50, num. 10, pp. 22312242, Oct. 2004.
[ Paper .pdf ]
Refereed Conference Publications
 "Fixedrank approximation of a positivesemidefinite matrix from streaming data"
by J. A. Tropp, A. Yurtsever, M. Udell, and V. Cevher.
Caltech ACM TR 201703, May 2017. NIPS 2017.
[ paper .pdf 
supplement .pdf 
report .pdf  arXiv cs.NA 1706.05736 
code ]
 "Sketchy decisions: Convex lowrank matrix optimization with optimal storage"
by A. Yurtsever, M. Udell, J. A. Tropp, and V. Cevher.
In Proc. 20th Intl. Conf. Artificial Intelligence and Statistics (AISTATS), Fort Lauderdale, Apr. 2017.
[ AISTATS .pdf 
full paper .pdf 
arXiv math.OC 1702.06838 ]
 "Timedata tradeoffs via aggressive smoothing"
by J. J. Bruer, J. A. Tropp, V. Cevher, and S. Becker.
In Advances in Neural Information Processing Systems 27 (NIPS), Montreal, Dec. 2014.
[ Paper .pdf ]
 "Factoring Nonnegative Matrices with Linear Programs"
by V. Bittorf, C. Ré, B. Recht, and J. A. Tropp.
In Advances in Neural Information Processing Systems 25 (NIPS), pp. 12231231, Stateline, NV, Dec. 2012.
[ Paper .pdf 
Report .pdf 
arXiv math.OC 1206.1270 ]
 "Practical largescale optimization for maxnorm regularization"
by J. Lee, B. Recht, R. Salakhutdinov, N. Srebro, and J. A. Tropp.
In Advances in Neural Information Processing Systems 23 (NIPS), pp. 12971305, Vancouver, Dec. 2010.
[ Paper .pdf ]
 "Column subset selection, matrix factorization, and eigenvalue optimization"
by J. A. Tropp.
In Proc. 2009 ACMSIAM Symp. Discrete Algorithms (SODA), pp. 978986, New York, NY, Jan. 2009.
[ Paper .pdf 
Report .pdf 
arXiv math.NA 0608.4404 ]

"Efficient sampling and stable reconstruction of wide band sparse analog signals"
by M. Mishali, Y. C. Eldar, and J. A. Tropp.
In Proc. 25th IEEE Conv. Electrical and Electronics Engineers in Israel (IEEEI), Eilat, Dec. 2008.
"Best Student Paper" award.
[ Paper .pdf ]

"Greedy signal recovery review"
by D. Needell, J. A. Tropp, and R. Vershynin.
In Proc. 42nd Asilomar Conf. Signals, Systems and Computers, Pacific Grove, CA, Oct. 2008.
[ Paper .pdf 
arXiv math.NA 0812.2202 ]

"One sketch for all: Fast algorithms for Compressed Sensing"
by A. C. Gilbert, M. J. Strauss, and R. Vershynin.
In Proc. 39th ACM Symp. Theory of Computing (STOC), San Diego, CA, June 2007.
[ Submission .pdf 
code .tar.gz ]

"Algorithmic linear dimension reduction in the l_{1} norm for sparse vectors"
by A. C. Gilbert, M. J. Strauss, J. A. Tropp, and R. Vershynin.
Invited paper, special session "Compressed Sensing,"
in Proc. 44th Allerton Conf. Communication, Control, and Computing,
Allerton, IL, Sep. 2006.
[ Paper .pdf ]

"Rowaction methods for Compressed Sensing"
by S. Sra and J. A. Tropp.
In Proc. 2006 IEEE Int. Conf. Acoustics, Speech, and Signal Processing (ICASSP),
vol. 3, pp. 868871, Toulouse, May 2006.
[ Paper .pdf ]

"Sparse approximation via iterative thresholding"
by K. K. Herrity, A. C. Gilbert, and J. A. Tropp.
In Proc. 2006 IEEE Int. Conf. Acoustics, Speech, and Signal Processing (ICASSP),
vol. 3, pp. 624627, Toulouse, May 2006.
[ Paper .pdf ]

"Random filters for compressive sampling and reconstruction"
by J. A. Tropp, M. B. Wakin, M. F. Duarte, D. Baron, and R. G. Baraniuk.
In Proc. 2006 IEEE Intl. Conf. Acoustics, Speech, and Signal Processing (ICASSP),
vol. 3, pp. 872875, Toulouse, May 2006.
[ Paper .pdf ]

"Applications of sparse approximation in communications"
by A. C. Gilbert and J. A. Tropp.
In Proc. 2005 IEEE Intl. Symp. Information Theory (ISIT),
pp. 10001004, Adelaide, Sep. 2005.
[ Paper .pdf ]

"Simultaneous sparse approximation via greedy pursuit"
by J. A. Tropp, A. C. Gilbert, and M. J. Strauss.
Special session "Sparse representations in signal processing,"
in Proc. 2005 IEEE Intl. Conf. Acoustics, Speech, and Signal Processing (ICASSP),
vol. 5, pp. 721724, Philadelphia, PA, Mar. 2005.
[ Paper .pdf ]

"Metric Nearness: Problem formulation and algorithms"
by I. S. Dhillon, S. Sra, and J. A. Tropp.
Advances in Neural Information Processing 17 (NIPS),
pp. 361368, Vancouver, Dec. 2004.
[ Paper .pdf ]

"Construction of equiangular signatures for synchronous CDMA systems"
by R. W. Heath Jr., J. A. Tropp, I. S. Dhillon, and T. Strohmer.
In Proc. 2004 IEEE Intl. Symp. Spread Spectrum Technologies (ISSST),
pp. 708712, Sydney, Aug. 2004.
[ Paper .pdf ]

"Optimal CDMA signatures: a finitestep approach"
by J. A. Tropp, I. S. Dhillon, and R. W. Heath Jr.
In Proc. 2004 IEEE Intl. Symp. Spread Spectrum Technologies (ISSST),
pp. 335340, Sydney, Aug. 2004.
[ Paper .pdf ]

"CDMA signature sequences with low peaktoaveragepower ratio via alternating projection"
by J. A. Tropp, I. S. Dhillon, R. W. Heath Jr. and T. Strohmer.
In Proc. 37th Asilomar Conf. Signals, Systems, and Computers,
pp. 475479, Monterrey, CA, Nov. 2003.
[ Paper .pdf ]

"Improved sparse approximation over quasiincoherent dictionaries"
by J. A. Tropp, A. C. Gilbert, S. Muthukrishnan, and M. J. Strauss.
Invited paper, special session "Redundant representations in image processing,"
in Proc. 2003 IEEE Intl. Conf. Image Processing (ICIP),
vol. 1, pp. 3740, Barcelona, Sept. 2003.
[ Paper .pdf ]

"Optimal CDMA signature sequences, inverse eigenvalue problems, and alternating minimization"
by J. A. Tropp, R. W. Heath Jr., and T. Strohmer.
In Proc. 2003 IEEE Intl. Symp. Information Theory (ISIT),
p. 407, Yokohama, July 2003.
[ Paper .pdf ]
Other Conference Publications
 "The sparsity gap: Uncertainty principles proportional to dimension"
by J. A. Tropp.
Invited paper, Proc. 44th IEEE Conf. Information Sciences and Systems (CISS), pp. 16, Princeton, NJ, Mar. 2010.
[ .pdf 
arXiv cs.IT 1003.0415 ]

"Sublinear approximation of compressible signals"
by A. C. Gilbert, M. J. Strauss, J. A. Tropp, and R. Vershynin.
Invited paper, special session "Compressive Sensing,"
in Proc. SPIE Intelligent Integrated Microsystems (IIM), pp. 623206.0109, Orlando, Apr. 2006.
[ Preprint .pdf ]

"Random filters for compressive sampling"
by J. A. Tropp.
Proc. 40th Conf. Information Sciences and Systems (CISS),
pp. 216217, Princeton, Mar. 2006
[ Paper .pdf ]

"Averagecase analysis of greedy pursuit"
by J. A. Tropp.
Invited paper, in Proc. SPIE Wavelets XI, pp. 590401.0111, San Diego, Aug. 2005.
[ Preprint .pdf ]

"Complex equiangular tight frames"
by J. A. Tropp.
In Proc. SPIE Wavelets XI, pp. 590412.0111, San Diego, Aug. 2005.
[ Preprint .pdf ]
Selected Technical Reports
 "The achievable performance of convex demixing"
by M. B. McCoy and J. A. Tropp.
ACM Report 201702, Caltech, Feb. 2017. Paper dated Sept. 2013.
[ Report .pdf 
arXiv cs.IT
1309.7478 ]
 "Deriving matrix concentration inequalities from kernel couplings"
by D. Paulin, L. Mackey, and J. A. Tropp.
Technical Report No. 201410, Stanford Department of Statistics, Aug. 2014.
Paper dated May 2013.
[ Report .pdf 
arXiv ma.PR 1305.0612 ]
 "Tail bounds for all eigenvalues of a sum of random matrices"
by A. Gittens and J. A. Tropp.
ACM Report 201402, Caltech, Aug. 2014. Paper dated Apr. 2011.
[ .pdf 
arXiv math.PR 1104.4513 ]
 "Error bounds for randomized matrix approximation schemes"
by A. Gittens and J. A. Tropp.
ACM Report 201401, Caltech, Aug. 2014. Paper dated Nov. 2009.
[ .pdf 
arXiv math.NA 0911.4108 ]

"The masked sample covariance estimator: An analysis via the matrix Laplace transform"
by R. Y. Chen, A. Gittens, and J. A. Tropp.
ACM Report 201201, Caltech, Feb. 2012.
[ Report .pdf ]

"Largescale PCA with sparsity constraints"
by C. J. Probel and J. A. Tropp.
ACM Report 201102, Caltech, Aug. 2011.
[ Report .pdf ]

"Userfriendly tail bounds for matrix martingales"
by J. A. Tropp.
ACM Report 201101, Caltech, Jan. 2011.
[ Report .pdf ]

"Column subset selection, matrix factorization, and eigenvalue optimization"
by J. A. Tropp.
ACM Report 200802, Caltech, July 2008.
[ Report .pdf ]

"CoSaMP: Iterative signal recovery from incomplete and inaccurate measurements"
by D. Needell and J. A. Tropp.
ACM Report 200801, Caltech, Mar. 2008. Revised, July 2008.
[ Report .pdf ]
 "Algorithmic linear dimension reduction in the l_{1} norm for sparse vectors"
by A. C. Gilbert, M. J. Strauss, J. A. Tropp, and R. Vershynin.
Nov. 2005. Revised, Aug. 2006.
[ Report .pdf 
arXiv cs.DS 0608.6079 ]

"Signal recovery from random measurements via Orthogonal Matching Pursuit: The Gaussian Case"
by J. A. Tropp and A. C. Gilbert.
ACM Report 200701, Caltech, Apr. 2005. Revised, Nov. 2006 and Aug. 2007.
[ Report .pdf ]

"Just relax: Convex programming methods for subset selection and sparse approximation"
by J. A. Tropp.
ICES Report 0404, Univ. Texas at Austin, Feb. 2004.
[ Report .pdf ]

"Greed is good: Algorithmic results for sparse approximation"
by J. A. Tropp.
ICES Report 0304, Univ. Texas at Austin, Feb. 2003.
[ Report .pdf ]
Unpublished
 "A foundation for analytical developments in the logarithmic region of turbulent channels"
by R. Moarref, A. S. Sharma, J. A. Tropp, and B. J. McKeon.
Sep. 2014.
[ arXiv physics.fludyn 1409.6047 ]

"An alternating minimization algorithm for nonnegative matrix approximation"
by J. A. Tropp.
Unpublished note, May 2003.
[ .pdf ]

"Literature survey: Nonnegative matrix factorization"
by J. A. Tropp.
Unpublished note, Mar. 2003.
[ .pdf ]

"An elementary proof of the spectral radius formula for matrices"
by J. A. Tropp.
Unpublished note, Nov. 2001.
[ .pdf ]

"Cnoidal solutions to the pth order Kortewegde Vries equation"
by J. L. Bona and J. A. Tropp.
Unpublished note, Nov. 2000.
[ .pdf ]
Legal Stuff: This material is presented to ensure timely dissemination
of scholarly and technical work. Copyright and all rights therein are
retained by authors or by other copyright holders. All persons copying this
information are expected to adhere to the terms and constraints invoked
by each author's copyright. In most cases, these works may not be reposted
without the explicit permission of the copyright holder.
