The following pages link to Justin Romberg (Q412401):
Displaying 43 items.
- Restricted isometries for partial random circulant matrices (Q412402) (← links)
- Efficient calculations of 3-D FFTs on spiral contours (Q427174) (← links)
- Errata: Quantitative robust uncertainty principles and optimally sparse decompositions. (Q941788) (← links)
- A flexible convex relaxation for phase retrieval (Q1688995) (← links)
- Improved bounds for the eigenvalues of prolate spheroidal wave functions and discrete prolate spheroidal sequences (Q1979916) (← links)
- Sequencing of multi-robot behaviors using reinforcement learning (Q2138943) (← links)
- Solving equations of random convex functions via anchored regression (Q2317380) (← links)
- The fast Slepian transform (Q2415405) (← links)
- Quantitative robust uncertainty principles and optimally sparse decompositions (Q2505655) (← links)
- Convex Cardinal Shape Composition (Q2797765) (← links)
- Sparse Shape Reconstruction (Q2873276) (← links)
- Matched Filtering From Limited Frequency Samples (Q2989188) (← links)
- Sparse channel separation using random probes (Q3061235) (← links)
- Lifting for Blind Deconvolution in Random Mask Imaging: Identifiability and Convex Relaxation (Q3454489) (← links)
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information (Q3546643) (← links)
- Compressive Sensing by Random Convolution (Q3649074) (← links)
- Fast and Accurate Algorithms for Re-Weighted $\ell _{1}$-Norm Minimization (Q4578842) (← links)
- Superfast Tikhonov Regularization of Toeplitz Systems (Q4579338) (← links)
- Sparse Recovery of Streaming Signals Using <formula formulatype="inline"><tex Notation="TeX">$\ell_1$</tex></formula>-Homotopy (Q4579383) (← links)
- Discrete and Continuous-Time Soft-Thresholding for Dynamic Signal Recovery (Q4580632) (← links)
- Compressed subspace matching on the continuum (Q4602825) (← links)
- Near-optimal estimation of simultaneously sparse and low-rank matrices from nested linear measurements (Q4603729) (← links)
- Extracting the Principal Shape Components via Convex Programming (Q4617357) (← links)
- ROAST: Rapid Orthogonal Approximate Slepian Transform (Q4622473) (← links)
- Fast and Guaranteed Blind Multichannel Deconvolution Under a Bilinear System Model (Q4682806) (← links)
- Beyond Nyquist: Efficient Sampling of Sparse Bandlimited Signals (Q4976068) (← links)
- Fast Convergence Rates of Distributed Subgradient Methods With Adaptive Quantization (Q4990221) (← links)
- Finite-Time Performance of Distributed Temporal-Difference Learning with Linear Function Approximation (Q4999359) (← links)
- Phase retrieval of low-rank matrices by anchored regression (Q5006490) (← links)
- Fast Convex Pruning of Deep Neural Networks (Q5027023) (← links)
- Convergence Rates of Distributed Gradient Methods Under Random Quantization: A Stochastic Approximation Approach (Q5036202) (← links)
- Thomson’s Multitaper Method Revisited (Q5088597) (← links)
- Trading Beams for Bandwidth: Imaging with Randomized Beamforming (Q5108477) (← links)
- (Q5149028) (← links)
- Spectral Methods for Passive Imaging: Nonasymptotic Performance and Robustness (Q5230405) (← links)
- Sparsity and incoherence in compressive sampling (Q5293662) (← links)
- Stable signal recovery from incomplete and inaccurate measurements (Q5486267) (← links)
- Finite-Time Convergence Rates of Decentralized Stochastic Approximation With Applications in Multi-Agent and Multi-Task Learning (Q6056034) (← links)
- Finite-Sample Analysis of Two-Time-Scale Natural Actor–Critic Algorithm (Q6080164) (← links)
- Optimal Convex Lifted Sparse Phase Retrieval and PCA With an Atomic Matrix Norm Regularizer (Q6194012) (← links)
- A Two-Time-Scale Stochastic Optimization Framework with Applications in Control and Reinforcement Learning (Q6195318) (← links)
- Approximately low-rank recovery from noisy and local measurements by convex program (Q6381568) (← links)
- Streaming solutions for time-varying optimization problems (Q6603020) (← links)
