Pages that link to "Item:Q4899025"

The following pages link to Reweighted $\ell_1$-Minimization for Sparse Solutions to Underdetermined Linear Systems (Q4899025):

Displaying 50 items.

• Analysis of a nonsmooth optimization approach to robust estimation (Q254560) (← links)
• Entropy function-based algorithms for solving a class of nonconvex minimization problems (Q259115) (← links)
• 1-bit compressive sensing: reformulation and RRSP-based sign recovery theory (Q341409) (← links)
• Recent advances in mathematical programming with semi-continuous variables and cardinality constraint (Q384213) (← links)
• Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming (Q463732) (← links)
• Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications (Q489110) (← links)
• Sparse decomposition by iterating Lipschitzian-type mappings (Q517031) (← links)
• Nonconvex nonsmooth optimization via convex-nonconvex majorization-minimization (Q530079) (← links)
• Iteratively weighted thresholding homotopy method for the sparse solution of underdetermined linear equations (Q829377) (← links)
• On finding a generalized lowest rank solution to a linear semi-definite feasibility problem (Q1785372) (← links)
• A unified primal dual active set algorithm for nonconvex sparse recovery (Q2038299) (← links)
• Dual-density-based reweighted \(\ell_1\)-algorithms for a class of \(\ell_0\)-minimization problems (Q2052391) (← links)
• The nonconvex tensor robust principal component analysis approximation model via the weighted \(\ell_p\)-norm regularization (Q2053328) (← links)
• Partial gradient optimal thresholding algorithms for a class of sparse optimization problems (Q2079693) (← links)
• Weighted thresholding homotopy method for sparsity constrained optimization (Q2082209) (← links)
• Sparse signal reconstruction via the approximations of \(\ell_0\) quasinorm (Q2190319) (← links)
• Large-scale regression with non-convex loss and penalty (Q2192647) (← links)
• Effective zero-norm minimization algorithms for noisy compressed sensing (Q2198627) (← links)
• Geological facies recovery based on weighted \(\ell_1\)-regularization (Q2198925) (← links)
• Mathematical programs with complementarity constraints and a non-Lipschitz objective: optimality and approximation (Q2220667) (← links)
• The complexity results of the sparse optimization problems and reverse convex optimization problems (Q2228394) (← links)
• A new reweighted minimization algorithm for image deblurring (Q2258646) (← links)
• Error analysis of reweighted \(l_1\) greedy algorithm for noisy reconstruction (Q2345681) (← links)
• Rank-one and sparse matrix decomposition for dynamic MRI (Q2353466) (← links)
• A smoothing iterative method for quantile regression with nonconvex \(\ell_p\) penalty (Q2358473) (← links)
• Majorization-minimization generalized Krylov subspace methods for \({\ell _p}\)-\({\ell _q}\) optimization applied to image restoration (Q2359752) (← links)
• Iteratively reweighted \(\ell _1\) algorithms with extrapolation (Q2419549) (← links)
• The finite steps of convergence of the fast thresholding algorithms with \(f\)-feedbacks in compressed sensing (Q2672726) (← links)
• Newton-type optimal thresholding algorithms for sparse optimization problems (Q2676159) (← links)
• DC Approximation Approach for ℓ0-minimization in Compressed Sensing (Q2808067) (← links)
• Constructing New Weighted <i>ℓ</i>₁-Algorithms for the Sparsest Points of Polyhedral Sets (Q2976140) (← links)
• A Generalized Krylov Subspace Method for $\ell_p$-$\ell_q$ Minimization (Q3196655) (← links)
• A null-space-based weighted<i>l</i>₁minimization approach to compressed sensing (Q4603732) (← links)
• Proximal Mapping for Symmetric Penalty and Sparsity (Q4606656) (← links)
• Triangulated Surface Denoising using High Order Regularization with Dynamic Weights (Q4646449) (← links)
• Nonconvex flexible sparsity regularization: theory and monotone numerical schemes (Q5077167) (← links)
• A Subgradient-Based Approach for Finding the Maximum Feasible Subsystem with Respect to a Set (Q5110557) (← links)
• Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems (Q5210512) (← links)
• Weak Stability of <i>ℓ</i>₁-Minimization Methods in Sparse Data Reconstruction (Q5219713) (← links)
• Uniqueness Conditions for A Class of ℓ₀-Minimization Problems (Q5245836) (← links)
• Minimization of $\ell_{1-2}$ for Compressed Sensing (Q5251929) (← links)
• A New Computational Method for the Sparsest Solutions to Systems of Linear Equations (Q5258945) (← links)
• Heuristics for Finding Sparse Solutions of Linear Inequalities (Q6053490) (← links)
• Sparse reconstruction via the mixture optimization model with iterative support estimate (Q6065953) (← links)
• A wonderful triangle in compressed sensing (Q6122304) (← links)
• Nonnegative partial \(s\)-goodness for the equivalence of a 0-1 linear program to weighted linear programming (Q6173941) (← links)
• Sparsity-Inducing Nonconvex Nonseparable Regularization for Convex Image Processing (Q6176003) (← links)
• Scaled proximal gradient methods for sparse optimization problems (Q6184263) (← links)
• A Path-Based Approach to Constrained Sparse Optimization (Q6202768) (← links)
• k-Sparse Vector Recovery via $$\ell _1-\alpha \ell _2$$ Local Minimization (Q6493963) (← links)