The following pages link to Compressed sensing (Q5900527):
Displaying 50 items.
- Further properties of the forward-backward envelope with applications to difference-of-convex programming (Q2364125) (← links)
- \(S_{1/2}\) regularization methods and fixed point algorithms for affine rank minimization problems (Q2364127) (← links)
- Performance of first- and second-order methods for \(\ell_1\)-regularized least squares problems (Q2374363) (← links)
- Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization (Q2374365) (← links)
- Fixed point algorithm based on adapted metric method for convex minimization problem with application to image deblurring (Q2374376) (← links)
- On polynomial chaos expansion via gradient-enhanced \(\ell_1\)-minimization (Q2375016) (← links)
- Improved sparse Fourier approximation results: Faster implementations and stronger guarantees (Q2376358) (← links)
- Compressed sensing by inverse scale space and curvelet thresholding (Q2378722) (← links)
- The application of joint sparsity and total variation minimization algorithms to a real-life art restoration problem (Q2391086) (← links)
- A Bayesian approach to sparse dynamic network identification (Q2391442) (← links)
- Efficient block-coordinate descent algorithms for the group Lasso (Q2392933) (← links)
- A polynomial case of the cardinality-constrained quadratic optimization problem (Q2393087) (← links)
- Recovery analysis for weighted \(\ell_{1}\)-minimization using the null space property (Q2397162) (← links)
- High-dimensional change-point estimation: combining filtering with convex optimization (Q2397167) (← links)
- Recovery error analysis of noisy measurement in compressed sensing (Q2398228) (← links)
- Compressed sensing based on trust region method (Q2398233) (← links)
- Reconstruction of sparse signals in impulsive disturbance environments (Q2399059) (← links)
- A sparse recovery method for DOA estimation based on the sample covariance vectors (Q2399135) (← links)
- Alternating proximal gradient method for convex minimization (Q2399191) (← links)
- A new bound on the block restricted isometry constant in compressed sensing (Q2400748) (← links)
- Compressed sensing for finite-valued signals (Q2401311) (← links)
- ESL-SELO: a robust image denoising algorithm with penalty (Q2401786) (← links)
- Adaptive step-size matching pursuit algorithm for practical sparse reconstruction (Q2402080) (← links)
- An NLMS algorithm with TAP-selection matrix for sparse system identification (Q2402093) (← links)
- Finite-length and asymptotic analysis of averaged correlogram for undersampled data (Q2402484) (← links)
- On the number of iterations for convergence of CoSaMP and subspace pursuit algorithms (Q2402492) (← links)
- Improved RIP conditions for compressed sensing with coherent tight frames (Q2403862) (← links)
- The modified accelerated Bregman method for regularized basis pursuit problem (Q2405606) (← links)
- A primal Douglas-Rachford splitting method for the constrained minimization problem in compressive sensing (Q2405990) (← links)
- \(\ell_1\)-norm and entanglement in screening out braiding from Yang-Baxter equation associated with \(\mathbb{Z}_3\) parafermion (Q2406125) (← links)
- Accelerated Bregman operator splitting with backtracking (Q2408418) (← links)
- Quantization of compressive samples with stable and robust recovery (Q2409038) (← links)
- Newly deterministic construction of compressed sensing matrices via singular linear spaces over finite fields (Q2410045) (← links)
- The local convexity of solving systems of quadratic equations (Q2410810) (← links)
- Generalized sparse recovery model and its neural dynamical optimization method for compressed sensing (Q2411691) (← links)
- Sparse adaptive channel estimation based on mixed controlled \(l_2\) and \(l_p\)-norm error criterion (Q2412500) (← links)
- L1-norm minimization for multi-dimensional signals based on geometric algebra (Q2416610) (← links)
- Accelerating block coordinate descent methods with identification strategies (Q2419524) (← links)
- A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection (Q2419541) (← links)
- General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems (Q2419543) (← links)
- Projective method of multipliers for linearly constrained convex minimization (Q2419546) (← links)
- Empirical risk minimization: probabilistic complexity and stepsize strategy (Q2419551) (← links)
- Convergence rates of accelerated proximal gradient algorithms under independent noise (Q2420162) (← links)
- A nonconvex model with minimax concave penalty for image restoration (Q2420696) (← links)
- Iterative identification for multiple-input systems with time-delays based on greedy pursuit and auxiliary model (Q2423989) (← links)
- Spatially distributed sampling and reconstruction (Q2424626) (← links)
- Correcting for unknown errors in sparse high-dimensional function approximation (Q2424851) (← links)
- A simple homotopy proximal mapping algorithm for compressive sensing (Q2425244) (← links)
- Basis adaptive sample efficient polynomial chaos (BASE-PC) (Q2425254) (← links)
- A near-optimal sampling strategy for sparse recovery of polynomial chaos expansions (Q2425261) (← links)
