The following pages link to Joel A. Tropp (Q341494):
Displaying 50 items.
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions (Q93618) (← links)
- Efron-Stein inequalities for random matrices (Q341495) (← links)
- The restricted isometry property for time-frequency structured random matrices (Q365713) (← links)
- (Q404301) (redirect page) (← links)
- Sharp recovery bounds for convex demixing, with applications (Q404302) (← links)
- Restricted isometries for partial random circulant matrices (Q412402) (← links)
- Freedman's inequality for matrix martingales (Q638273) (← links)
- User-friendly tail bounds for sums of random matrices (Q695625) (← links)
- A comparison principle for functions of a uniformly random subspace (Q714948) (← links)
- On the linear independence of spikes and sines (Q734952) (← links)
- From Steiner formulas for cones to concentration of intrinsic volumes (Q741611) (← links)
- On the conditioning of random subdictionaries (Q930731) (← links)
- On the existence of equiangular tight frames (Q996316) (← links)
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples (Q1012549) (← links)
- Algorithms for simultaneous sparse approximation. I: Greedy pursuit (Q1027254) (← links)
- Algorithms for simultaneous sparse approximation. II: Convex relaxation (Q1027255) (← links)
- Second-order matrix concentration inequalities (Q1742822) (← links)
- Two proposals for robust PCA using semidefinite programming (Q1952221) (← links)
- Simplicial faces of the set of correlation matrices (Q1991097) (← links)
- From Poincaré inequalities to nonlinear matrix concentration (Q2040088) (← links)
- Nonlinear matrix concentration via semigroup methods (Q2042805) (← links)
- Randomized block Krylov methods for approximating extreme eigenvalues (Q2068363) (← links)
- Matrix concentration for products (Q2098235) (← links)
- Robust computation of linear models by convex relaxation (Q2351804) (← links)
- Norms of random submatrices and sparse approximation (Q2378324) (← links)
- Paved with good intentions: analysis of a randomized block Kaczmarz method (Q2437339) (← links)
- Subadditivity of matrix \(\phi\)-entropy and concentration of random matrices (Q2448515) (← links)
- Matrix concentration inequalities via the method of exchangeable pairs (Q2450243) (← links)
- Convex Recovery of a Structured Signal from Independent Random Linear Measurements (Q2799918) (← links)
- The masked sample covariance estimator: an analysis using matrix concentration inequalities (Q2869798) (← links)
- Model-based scaling of the streamwise energy density in high-Reynolds-number turbulent channels (Q2878452) (← links)
- Integer Factorization of a Positive-Definite Matrix (Q2949717) (← links)
- The Expected Norm of a Sum of Independent Random Matrices: An Elementary Approach (Q2954044) (← links)
- IMPROVED ANALYSIS OF THE SUBSAMPLED RANDOMIZED HADAMARD TRANSFORM (Q3101550) (← links)
- Book Review: A mathematical introduction to compressive sensing (Q3178754) (← links)
- Matrix Nearness Problems with Bregman Divergences (Q3537440) (← links)
- Constructing Packings in Grassmannian Manifolds via Alternating Projection (Q3546249) (← links)
- Greed is Good: Algorithmic Results for Sparse Approximation (Q3547716) (← links)
- Recovery of Short, Complex Linear Combinations Via<tex>$ell _1$</tex>Minimization (Q3547717) (← links)
- Just relax: convex programming methods for identifying sparse signals in noise (Q3547718) (← links)
- Finite-Step Algorithms for Constructing Optimal CDMA Signature Sequences (Q3547719) (← links)
- Designing structured tight frames via an alternating projection method (Q3547720) (← links)
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit (Q3549018) (← links)
- (Q3549618) (← links)
- The Metric Nearness Problem (Q3609032) (← links)
- Practical Sketching Algorithms for Low-Rank Matrix Approximation (Q4598337) (← links)
- Column Subset Selection, Matrix Factorization, and Eigenvalue Optimization (Q4633911) (← links)
- Corrigendum in “Just Relax: Convex Programming Methods for Identifying Sparse Signals in Noise” [Mar 06 1030-1051] (Q4975747) (← links)
- Beyond Nyquist: Efficient Sampling of Sparse Bandlimited Signals (Q4976068) (← links)
- Scalable Semidefinite Programming (Q4999352) (← links)
