The following pages link to (Q5491042):
Displaying 50 items.
- A flexible coordinate descent method (Q1639710) (← links)
- The sparsity of underdetermined linear system via \(l_p\) minimization for \(0 < p < 1\) (Q1666063) (← links)
- Random sampling of bandlimited signals on graphs (Q1690709) (← links)
- A hierarchical framework for recovery in compressive sensing (Q1693135) (← links)
- Fused Lasso penalized least absolute deviation estimator for high dimensional linear regression (Q1713210) (← links)
- Time-optimal hands-off control for linear time-invariant systems (Q1716632) (← links)
- A CS recovery algorithm for model and time delay identification of MISO-FIR systems (Q1736708) (← links)
- Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\) (Q1752352) (← links)
- Geometry of the Welch bounds (Q1758450) (← links)
- Linear program relaxation of sparse nonnegative recovery in compressive sensing microarrays (Q1929588) (← links)
- Strengthening hash families and compressive sensing (Q1932362) (← links)
- Sobolev duals for random frames and \(\varSigma \varDelta \) quantization of compressed sensing measurements (Q1946588) (← links)
- A super-resolution direction of arrival estimation algorithm for coprime array via sparse Bayesian learning inference (Q2003306) (← links)
- Measurement matrix optimization via mutual coherence minimization for compressively sensed signals reconstruction (Q2004244) (← links)
- Maximum correntropy adaptation approach for robust compressive sensing reconstruction (Q2004743) (← links)
- \textit{hp}-VPINNs: variational physics-informed neural networks with domain decomposition (Q2021230) (← links)
- Dual-density-based reweighted \(\ell_1\)-algorithms for a class of \(\ell_0\)-minimization problems (Q2052391) (← links)
- Adaptive dimension-discriminative low-rank tensor recovery for computational hyperspectral imaging (Q2054388) (← links)
- Efficient stochastic optimisation by unadjusted Langevin Monte Carlo. Application to maximum marginal likelihood and empirical Bayesian estimation (Q2058738) (← links)
- Nonuniqueness of solutions of a class of \(\ell_0\)-minimization problems (Q2059197) (← links)
- Memoryless scalar quantization for random frames (Q2059810) (← links)
- Image reconstruction based on improved block compressed sensing (Q2064972) (← links)
- Random sampling and approximation of signals with bounded derivatives (Q2067835) (← links)
- Efficiency of orthogonal super greedy algorithm under the restricted isometry property (Q2067856) (← links)
- Atmospheric radar imaging improvements using compressed sensing and MIMO (Q2106492) (← links)
- Complex best \(r\)-term approximations almost always exist in finite dimensions (Q2175019) (← links)
- Bipolar measurement matrix using chaotic sequence (Q2207348) (← links)
- Bayesian approach with extended support estimation for sparse linear regression (Q2211053) (← links)
- Fixed-point proximity algorithms solving an incomplete Fourier transform model for seismic wavefield modeling (Q2222155) (← links)
- A linearized Peaceman-Rachford splitting method for structured convex optimization with application to stable principal component pursuit (Q2227311) (← links)
- A perturbation analysis based on group sparse representation with orthogonal matching pursuit (Q2232085) (← links)
- Efficient sensing of von Kármán vortices using compressive sensing (Q2245408) (← links)
- Spectral compressive sensing (Q2252132) (← links)
- Fast thresholding algorithms with feedbacks for sparse signal recovery (Q2252504) (← links)
- A numerical exploration of compressed sampling recovery (Q2267399) (← links)
- On rank awareness, thresholding, and MUSIC for joint sparse recovery (Q2278470) (← links)
- A compressive sensing based privacy preserving outsourcing of image storage and identity authentication service in cloud (Q2293031) (← links)
- Approximate support recovery of atomic line spectral estimation: a tale of resolution and precision (Q2300766) (← links)
- Information based complexity for high dimensional sparse functions (Q2303421) (← links)
- Divide and conquer: an incremental sparsity promoting compressive sampling approach for polynomial chaos expansions (Q2309799) (← links)
- Optimal subgradient methods: computational properties for large-scale linear inverse problems (Q2315075) (← links)
- Compressed-sensing-based gradient reconstruction for ghost imaging (Q2323735) (← links)
- Sparse feature map-based Markov models for nonlinear fluid flows (Q2331856) (← links)
- Stable recovery of low rank matrices from nuclear norm minimization (Q2343583) (← links)
- An asymptotic existence result on compressed sensing matrices (Q2347356) (← links)
- Finding sparse solutions of systems of polynomial equations via group-sparsity optimization (Q2349523) (← links)
- Three stochastic measurement schemes for direction-of-arrival estimation using compressed sensing method (Q2354754) (← links)
- Sparse proximal support vector machine with a specialized interior-point method (Q2356343) (← links)
- Use of EM algorithm for data reduction under sparsity assumption (Q2358925) (← links)
- A novel coherence reduction method in compressed sensing for DOA estimation (Q2375584) (← links)