@article{https://resolver.caltech.edu/CaltechAUTHORS:20220107-890431800,
    title = "Randomized block Krylov methods for approximating extreme eigenvalues",
    journal = "Numerische Mathematik",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20220107-890431800",
    id = "record",
    issn = "0029-599X",
    doi = "10.1007/s00211-021-01250-3",
    volume = "150"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20220204-680252000,
    title = "An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity",
    journal = "SIAM Journal of Optimization",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20220204-680252000",
    id = "record",
    issn = "1052-6234",
    doi = "10.1137/19m1244603",
    volume = "31"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20201218-154430753,
    title = "From Poincaré inequalities to nonlinear matrix concentration",
    journal = "Bernoulli",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20201218-154430753",
    id = "record",
    issn = "1350-7265",
    doi = "10.3150/20-BEJ1289",
    volume = "27"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20201218-154427353,
    title = "Nonlinear matrix concentration via semigroup methods",
    journal = "Electronic Journal of Probability",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20201218-154427353",
    id = "record",
    issn = "1083-6489",
    doi = "10.1214/20-EJP578",
    volume = "26"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20201218-154434116,
    title = "Matrix Concentration for Products",
    journal = "Foundations of Computational Mathematics",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20201218-154434116",
    id = "record",
    issn = "1615-3375",
    doi = "10.1007/s10208-021-09533-9"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20201217-104322985,
    title = "Randomized numerical linear algebra: Foundations and algorithms",
    journal = "Acta Numerica",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20201217-104322985",
    id = "record",
    issn = "0962-4929",
    doi = "10.1017/s0962492920000021",
    volume = "29"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20190212-160252658,
    title = "Fast state tomography with optimal error bounds",
    journal = "Journal of Physics A: Mathematical and General",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190212-160252658",
    id = "record",
    issn = "0305-4470",
    doi = "10.1088/1751-8121/ab8111",
    volume = "53"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20190920-085459909,
    title = "Streaming Low-Rank Matrix Approximation with an Application to Scientific Simulation",
    journal = "SIAM Journal on Scientific Computing",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190920-085459909",
    id = "record",
    issn = "1064-8275",
    doi = "10.1137/18m1201068",
    volume = "41"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20180103-154009197,
    title = "Simplicial Faces of the Set of Correlation Matrices",
    journal = "Discrete and Computational Geometry",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20180103-154009197",
    id = "record",
    issn = "0179-5376",
    doi = "10.1007/s00454-017-9961-0",
    volume = "60"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20180111-134219270,
    title = "Practical Sketching Algorithms for Low-Rank Matrix Approximation",
    journal = "SIAM Journal on Matrix Analysis and Applications",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20180111-134219270",
    id = "record",
    issn = "0895-4798",
    doi = "10.1137/17M1111590",
    volume = "38"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20170913-080352752,
    title = "A mathematical introduction to compressive sensing [Book Review]",
    journal = "Bulletin of the American Mathematical Society",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170913-080352752",
    id = "record",
    issn = "0273-0979",
    doi = "10.1090/bull/1546",
    volume = "54"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20161103-151616710,
    title = "Efron–Stein inequalities for random matrices",
    journal = "Annals of Probability",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20161103-151616710",
    id = "record",
    issn = "0091-1798",
    doi = "10.1214/15-AOP1054",
    volume = "44"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20160115-141425609,
    title = "Integer Factorization of a Positive-Definite Matrix",
    journal = "SIAM Journal on Discrete Mathematics",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160115-141425609",
    id = "record",
    issn = "0895-4801",
    doi = "10.1137/15M1024718",
    volume = "29"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20150611-103104163,
    title = "Designing Statistical Estimators That Balance Sample Size, Risk, and Computational Cost",
    journal = "IEEE Journal of Selected Topics in Signal Processing",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20150611-103104163",
    id = "record",
    issn = "1932-4553",
    doi = "10.1109/JSTSP.2015.2400412",
    volume = "9"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20150714-140245621,
    title = "An Introduction to Matrix Concentration Inequalities",
    journal = "Foundations and Trends in Machine Learning",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20150714-140245621",
    id = "record",
    issn = "1935-8237",
    doi = "10.1561/2200000048",
    volume = "8"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20150619-160809918,
    title = "Solving ptychography with a convex relaxation",
    journal = "New Journal of Physics",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20150619-160809918",
    id = "record",
    issn = "1367-2630",
    doi = "10.1088/1367-2630/17/5/053044",
    volume = "17",
    pmcid = "PMC4486359"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20150416-134303719,
    title = "Robust Computation of Linear Models by Convex Relaxation",
    journal = "Foundations of Computational Mathematics",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20150416-134303719",
    id = "record",
    issn = "1615-3375",
    doi = "10.1007/s10208-014-9221-0",
    volume = "15"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20150422-120051110,
    title = "Living on the edge: phase transitions in convex programs with random data",
    journal = "Information and Inference",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20150422-120051110",
    id = "record",
    issn = "2049-8772",
    doi = "10.1093/imaiai/iau005",
    volume = "3"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20140606-140701312,
    title = "Sharp Recovery Bounds for Convex Demixing, with Applications",
    journal = "Foundations of Computational Mathematics",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20140606-140701312",
    id = "record",
    issn = "1615-3375",
    doi = "10.1007/s10208-014-9191-2",
    volume = "14"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20140703-103651135,
    title = "From Steiner Formulas for Cones to Concentration of Intrinsic Volumes",
    journal = "Discrete and Computational Geometry",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20140703-103651135",
    id = "record",
    issn = "0179-5376",
    doi = "10.1007/s00454-014-9595-4",
    volume = "51"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20140605-070821101,
    title = "Matrix concentration inequalities via the method of exchangeable pairs",
    journal = "Annals of Probability",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20140605-070821101",
    id = "record",
    issn = "0091-1798",
    doi = "10.1214/13-AOP892",
    volume = "42"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20140519-153243814,
    title = "A low-order decomposition of turbulent channel flow via resolvent analysis and convex optimization",
    journal = "Physics of Fluids",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20140519-153243814",
    id = "record",
    issn = "1070-6631",
    doi = "10.1063/1.4876195",
    volume = "26"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20140918-084717665,
    title = "Subadditivity of matrix φ-entropy and concentration of random matrices",
    journal = "Electronic Journal of Probability",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20140918-084717665",
    id = "record",
    issn = "1083-6489",
    doi = "10.1214/EJP.v19-2964",
    volume = "19"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20140207-094442254,
    title = "Paved with good intentions: Analysis of a randomized block Kaczmarz method",
    journal = "Linear Algebra and its Applications",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20140207-094442254",
    id = "record",
    issn = "0024-3795",
    doi = "10.1016/j.laa.2012.12.022",
    volume = "441"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20140320-104900351,
    title = "Compact representation of wall-bounded turbulence using compressive sampling",
    journal = "Physics of Fluids",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20140320-104900351",
    id = "record",
    issn = "1070-6631",
    doi = "10.1063/1.4862303",
    volume = "26"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20131121-132351952,
    title = "Model-based scaling of the streamwise energy density in high-Reynolds-number turbulent channels",
    journal = "Journal of Fluid Mechanics",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20131121-132351952",
    id = "record",
    issn = "0022-1120",
    doi = "10.1017/jfm.2013.457",
    volume = "734"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20130815-130448316,
    title = "The restricted isometry property for time-frequency structured random matrices",
    journal = "Probability Theory and Related Fields",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20130815-130448316",
    id = "record",
    issn = "0178-8051",
    doi = "10.1007/s00440-012-0441-4",
    volume = "156"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20120821-072332716,
    title = "User-Friendly Tail Bounds for Sums of Random Matrices",
    journal = "Foundations of Computational Mathematics",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120821-072332716",
    id = "record",
    issn = "1615-3375",
    doi = "10.1007/s10208-011-9099-z",
    volume = "12"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20120820-074343297,
    title = "A comparison principle for functions of a uniformly random subspace",
    journal = "Probability Theory and Related Fields",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120820-074343297",
    id = "record",
    issn = "0178-8051",
    doi = "10.1007/s00440-011-0360-9",
    volume = "153"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20120515-094709707,
    title = "From joint convexity of quantum relative entropy to a concavity theorem of Lieb",
    journal = "Proceedings of the American Mathematical Society",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120515-094709707",
    id = "record",
    issn = "0002-9939",
    doi = "10.1090/S0002-9939-2011-11141-9",
    volume = "140"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20120302-134838002,
    title = "Restricted isometries for partial random circulant matrices",
    journal = "Applied and Computational Harmonic Analysis",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120302-134838002",
    id = "record",
    issn = "1063-5203",
    doi = "10.1016/j.acha.2011.05.001",
    volume = "32"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20120105-135621556,
    title = "Freedman's inequality for matrix martingales",
    journal = "Electronic Communications in Probability",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120105-135621556",
    id = "record",
    issn = "1083-589X",
    doi = "10.1214/ECP.v16-1624",
    volume = "16"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20110606-111746280,
    title = "Freedman's Inequality for Matrix Martingales",
    journal = "Electronic Communications in Probability",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20110606-111746280",
    id = "record",
    issn = "1083-589X",
    doi = "10.1214/ECP.v16-1624",
    volume = "16"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20180831-112120288,
    title = "Improved analysis of the subsampled randomized Hadamard transform",
    journal = "Advances in Adaptive Data Analysis",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20180831-112120288",
    id = "record",
    issn = "1793-5369",
    doi = "10.1142/S1793536911000787",
    volume = "3"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20111021-161307161,
    title = "Two proposals for robust PCA using semidefinite programming",
    journal = "Electronic Journal of Statistics",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20111021-161307161",
    id = "record",
    issn = "1935-7524",
    doi = "10.1214/11-EJS636",
    volume = "5"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20111025-085943917,
    title = "Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions",
    journal = "SIAM Review",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20111025-085943917",
    id = "record",
    issn = "0036-1445",
    doi = "10.1137/090771806",
    volume = "53"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20120321-092826256,
    title = "Improved Analysis of the Subsamples Randomized Hadamard Transform",
    journal = "Advances in Adaptive Data Analysis",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120321-092826256",
    id = "record",
    issn = "1793-5369",
    doi = "10.1142/S1793536911000787",
    volume = "3"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20110201-090245482,
    title = "CoSaMP: iterative signal recovery from incomplete and inaccurate samples",
    journal = "Communications of the ACM",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20110201-090245482",
    id = "record",
    issn = "0001-0782",
    doi = "10.1145/1859204.1859229",
    volume = "53"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20100608-080853280,
    title = "Computational Methods for Sparse Solution of Linear Inverse Problems",
    journal = "Proceedings of the IEEE",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20100608-080853280",
    id = "record",
    issn = "0018-9219",
    doi = "10.1109/JPROC.2010.2044010",
    volume = "98"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20100119-103356110,
    title = "Beyond Nyquist: Efficient Sampling of Sparse Bandlimited Signals",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20100119-103356110",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2009.2034811",
    volume = "56"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20090706-113128889,
    title = "CoSaMP: Iterative signal recovery from incomplete and inaccurate samples",
    journal = "Applied and Computational Harmonic Analysis",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20090706-113128889",
    id = "record",
    issn = "1063-5203",
    doi = "10.1016/j.acha.2008.07.002",
    volume = "26"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:TROcrm08,
    title = "Norms of random submatrices and sparse approximation",
    journal = "Comptes Rendus Mathematique",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:TROcrm08",
    id = "record",
    issn = "1631-073X",
    doi = "10.1016/j.crma.2008.10.008",
    volume = "346"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:TROjfaa08,
    title = "On the Linear Independence of Spikes and Sines",
    journal = "Journal of Fourier Analysis and Applications",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:TROjfaa08",
    id = "record",
    issn = "1069-5869",
    doi = "10.1007/s00041-008-9042-0",
    volume = "14"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20110513-152152857,
    title = "The Metric Nearness Problem",
    journal = "SIAM Journal on Matrix Analysis and Applications",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20110513-152152857",
    id = "record",
    issn = "0895-4798",
    doi = "10.1137/060653391",
    volume = "30"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:GILieeespm08,
    title = "A Tutorial on Fast Fourier Sampling [How to apply it to problems]",
    journal = "IEEE Signal Processing Magazine",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:GILieeespm08",
    id = "record",
    issn = "1053-5888",
    doi = "10.1109/MSP.2007.915000",
    volume = "25"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20170408-150838584,
    title = "The random paving property for uniformly bounded matrices",
    journal = "Studia Mathematica",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170408-150838584",
    id = "record",
    issn = "1730-6337",
    doi = "10.4064/sm185-1-4",
    volume = "185"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20180831-112106252,
    title = "Constructing Packings in Grassmannian Manifolds via Alternating Projection",
    journal = "Experimental Mathematics",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20180831-112106252",
    id = "record",
    issn = "1058-6458",
    doi = "10.1080/10586458.2008.10129018",
    volume = "17"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:TROieeetit07,
    title = "Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:TROieeetit07",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2007.909108",
    volume = "53"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:DHIsiamjmaa07,
    title = "Matrix Nearness Problems with Bregman Divergences",
    journal = "SIAM Journal on Matrix Analysis and Applications",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:DHIsiamjmaa07",
    id = "record",
    issn = "0895-4798",
    doi = "10.1137/060649021",
    volume = "29"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:TROieeetit06,
    title = "Just relax: convex programming methods for identifying sparse signals in noise",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:TROieeetit06",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2005.864420",
    volume = "52"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:DHIsiamjmaa05,
    title = "Generalized Finite Algorithms for Constructing Hermitian Matrices with Prescribed Diagonal and Spectrum",
    journal = "SIAM Journal on Matrix Analysis and Applications",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:DHIsiamjmaa05",
    id = "record",
    issn = "0895-4798",
    doi = "10.1137/S0895479803438183",
    volume = "27"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:TROieeetit05b,
    title = "Recovery of short, complex linear combinations via ℓ1 minimization",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:TROieeetit05b",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2005.844057",
    volume = "2005"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:TROieeetit05a,
    title = "Designing structured tight frames via an alternating projection method",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:TROieeetit05a",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2004.839492",
    volume = "51"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:TROieeetit04b,
    title = "Finite-step algorithms for constructing optimal CDMA signature sequences",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:TROieeetit04b",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2004.836698",
    volume = "50"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:TROieeetit04a,
    title = "Greed is good: algorithmic results for sparse approximation",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:TROieeetit04a",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2004.834793",
    volume = "50"
}