Pages that link to "Item:Q4834376"

The following pages link to Sparse Approximate Solutions to Linear Systems (Q4834376):

Displaying 50 items.

• Reconstruction of jointly sparse vectors via manifold optimization (Q2311804) (← links)
• Optimality conditions for rank-constrained matrix optimization (Q2314061) (← links)
• Sparse radial basis function approximation with spatially variable shape parameters (Q2323479) (← links)
• A smoothed \(l_0\)-norm and \(l_1\)-norm regularization algorithm for computed tomography (Q2337028) (← links)
• An asymptotic existence result on compressed sensing matrices (Q2347356) (← links)
• Do semidefinite relaxations solve sparse PCA up to the information limit? (Q2352742) (← links)
• The sparsest solution to the system of absolute value equations (Q2356345) (← links)
• NP-hardness and inapproximability of sparse PCA (Q2361497) (← links)
• A new bound on the block restricted isometry constant in compressed sensing (Q2400748) (← links)
• Compressed sensing for finite-valued signals (Q2401311) (← links)
• Improved RIP conditions for compressed sensing with coherent tight frames (Q2403862) (← links)
• Newly deterministic construction of compressed sensing matrices via singular linear spaces over finite fields (Q2410045) (← links)
• Generalized sparse recovery model and its neural dynamical optimization method for compressed sensing (Q2411691) (← links)
• RNLp: mixing nonlocal and TV-Lp methods to remove impulse noise from images (Q2417936) (← links)
• A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection (Q2419541) (← links)
• Complexity of unconstrained \(L_2 - L_p\) minimization (Q2436652) (← links)
• Special issue on sparse approximate solution of linear systems (Q2437329) (← links)
• A note on the hardness of sparse approximation (Q2444766) (← links)
• A note on sparse least-squares regression (Q2446076) (← links)
• The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder). (Q2473068) (← links)
• Nonconvex sorted \(\ell_1\) minimization for sparse approximation (Q2516375) (← links)
• Relaxed leverage sampling for low-rank matrix completion (Q2628266) (← links)
• An efficient augmented Lagrangian method with applications to total variation minimization (Q2636603) (← links)
• A theoretical result of sparse signal recovery via alternating projection method (Q2656767) (← links)
• Low-rank and joint-sparse signal recovery using sparse Bayesian learning in a WBAN (Q2658582) (← links)
• When does OMP achieve exact recovery with continuous dictionaries? (Q2659744) (← links)
• Smoothing strategy along with conjugate gradient algorithm for signal reconstruction (Q2660684) (← links)
• A novel regularization based on the error function for sparse recovery (Q2660696) (← links)
• The finite steps of convergence of the fast thresholding algorithms with \(f\)-feedbacks in compressed sensing (Q2672726) (← links)
• Sparse estimation via lower-order penalty optimization methods in high-dimensional linear regression (Q2687439) (← links)
• A new hybrid \(l_p\)-\(l_2\) model for sparse solutions with applications to image processing (Q2691208) (← links)
• On sparse recovery algorithms in unions of orthonormal bases (Q2696630) (← links)
• Uniqueness in nuclear norm minimization: flatness of the nuclear norm sphere and simultaneous polarization (Q2697005) (← links)
• Compressive Sensing (Q2789803) (← links)
• Low Complexity Regularization of Linear Inverse Problems (Q2799919) (← links)
• Sparse PCA: Convex Relaxations, Algorithms and Applications (Q2802550) (← links)
• Fast Implementation of ℓ 1-Greedy Algorithm (Q2840660) (← links)
• Solving Parametric Sparse Linear Systems by Local Blocking (Q2879345) (← links)
• Sparse Solutions of Sparse Linear Systems: Fixed-Parameter Tractability and an Application of Complex Group Testing (Q2891340) (← links)
• Learning an adaptive dictionary using a projected gradient method and its application on image de-noising (Q2893482) (← links)
• A Linearly Convergent Algorithm for Solving a Class of Nonconvex/Affine Feasibility Problems (Q2897274) (← links)
• Entropic Regularization of the ℓ 0 Function (Q2897276) (← links)
• An inexact continuation accelerated proximal gradient algorithm for low<i>n</i>-rank tensor recovery (Q2935378) (← links)
• An L p Norm Relaxation Approach to Positive Influence Maximization in Social Network under the Deterministic Linear Threshold Model (Q2938023) (← links)
• Solving sparse rational linear systems (Q2958972) (← links)
• Sparse Approximation using $\ell_1-\ell_2$ Minimization and Its Application to Stochastic Collocation (Q2964447) (← links)
• On optimal solutions of the constrained <i>ℓ</i> ₀ regularization and its penalty problem (Q2965692) (← links)
• Constructing New Weighted <i>ℓ</i>₁-Algorithms for the Sparsest Points of Polyhedral Sets (Q2976140) (← links)
• Nonconvex-TV Based Image Restoration with Impulse Noise Removal (Q3130761) (← links)
• Identifying small mean-reverting portfolios (Q3169214) (← links)