Pages that link to "Item:Q3604921"
From MaRDI portal
The following pages link to Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse (Q3604921):
Displaying 50 items.
- Sparse microwave imaging: principles and applications (Q362310) (← links)
- Robust visual tracking with structured sparse representation appearance model (Q408075) (← links)
- Sparse conjugate directions pursuit with application to fixed-size kernel models (Q413891) (← links)
- Sharp support recovery from noisy random measurements by \(\ell_1\)-minimization (Q427066) (← links)
- Sparse and nonnegative sparse D-MORPH regression (Q498497) (← links)
- Convergence of fixed-point continuation algorithms for matrix rank minimization (Q535287) (← links)
- A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization (Q535291) (← links)
- Fixed point and Bregman iterative methods for matrix rank minimization (Q543413) (← links)
- Compressive wave computation (Q544804) (← links)
- Phase transitions for greedy sparse approximation algorithms (Q629259) (← links)
- Beyond sparsity: the role of \(L_{1}\)-optimizer in pattern classification (Q650959) (← links)
- On support sizes of restricted isometry constants (Q711053) (← links)
- Sparsity preserving projections with applications to face recognition (Q733184) (← links)
- Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization (Q742293) (← links)
- GPU accelerated greedy algorithms for compressed sensing (Q744210) (← links)
- Sparse regression with output correlation for cardiac ejection fraction estimation (Q781053) (← links)
- A fast splitting method tailored for Dantzig selector (Q887167) (← links)
- Sparsity in time-frequency representations (Q967573) (← links)
- Iterative nearest neighbors (Q1677025) (← links)
- Symmetric alternating direction method with indefinite proximal regularization for linearly constrained convex optimization (Q1706414) (← links)
- Optimization methods for regularization-based ill-posed problems: a survey and a multi-objective framework (Q1712546) (← links)
- A computational study of the role of spatial receptive field structure in processing natural and non-natural scenes (Q1714199) (← links)
- A probabilistic learning algorithm for robust modeling using neural networks with random weights (Q1749195) (← links)
- Templates for convex cone problems with applications to sparse signal recovery (Q1762456) (← links)
- Sparse representation-based patient-specific diagnosis and treatment for esophageal squamous cell carcinoma (Q1786926) (← links)
- A parameterized proximal point algorithm for separable convex optimization (Q1800446) (← links)
- Weighted thresholding homotopy method for sparsity constrained optimization (Q2082209) (← links)
- Convergence analysis of positive-indefinite proximal ADMM with a Glowinski's relaxation factor (Q2173337) (← links)
- A smoothing neural network for minimization \(l_1\)-\(l_p\) in sparse signal reconstruction with measurement noises (Q2185680) (← links)
- Flexible semi-supervised embedding based on adaptive loss regression: application to image categorization (Q2195309) (← links)
- Adaptive decomposition-based evolutionary approach for multiobjective sparse reconstruction (Q2198239) (← links)
- Generalized Peaceman-Rachford splitting method with substitution for convex programming (Q2228367) (← links)
- Local behavior of sparse analysis regularization: applications to risk estimation (Q2252165) (← links)
- Ways to sparse representation: An overview (Q2267103) (← links)
- Inertial proximal strictly contractive peaceman-Rachford splitting method with an indefinite term for convex optimization (Q2306407) (← links)
- An indefinite proximal Peaceman-Rachford splitting method with substitution procedure for convex programming (Q2326924) (← links)
- Global sensitivity analysis based on high-dimensional sparse surrogate construction (Q2363869) (← links)
- A single gallery-based face recognition using extended joint sparse representation (Q2422966) (← links)
- A generalization of linearized alternating direction method of multipliers for solving two-block separable convex programming (Q2424935) (← links)
- A simple homotopy proximal mapping algorithm for compressive sensing (Q2425244) (← links)
- Large sparse signal recovery by conjugate gradient algorithm based on smoothing technique (Q2629501) (← links)
- Inertial generalized proximal Peaceman-Rachford splitting method for separable convex programming (Q2664392) (← links)
- Contraction-based model predictive control for stochastic nonlinear discrete-time systems with time-varying delays via multi-dimensional Taylor network (Q2684605) (← links)
- Compressive Sensing (Q2789803) (← links)
- Low Complexity Regularization of Linear Inverse Problems (Q2799919) (← links)
- Tensor Least Angle Regression for Sparse Representations of Multidimensional Signals (Q3386399) (← links)
- Low-Rank and Sparse Dictionary Learning (Q3449318) (← links)
- Two Algorithms for Compressed Sensing of Sparse Tensors (Q3460836) (← links)
- A Projection Proximal-Point Algorithm for ℓ<sup>1</sup>Minimization (Q3578007) (← links)
- Iteratively reweighted least squares minimization for sparse recovery (Q3655588) (← links)
