Pages that link to "Item:Q4834376"

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

Displaying 50 items.

• Column subset selection via sparse approximation of SVD (Q764372) (← links)
• A theoretical perspective of solving phaseless compressive sensing via its nonconvex relaxation (Q778434) (← links)
• Iteratively weighted thresholding homotopy method for the sparse solution of underdetermined linear equations (Q829377) (← links)
• Local search methods for \(\ell_{1}\)-minimization in frame based signal compression (Q833415) (← links)
• Near-ideal model selection by \(\ell _{1}\) minimization (Q834335) (← links)
• Compressed history matching: Exploiting transform-domain sparsity for regularization of nonlinear dynamic data integration problems (Q848925) (← links)
• Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm (Q890292) (← links)
• Efficient nonconvex sparse group feature selection via continuous and discrete optimization (Q892230) (← links)
• A perturbation inequality for concave functions of singular values and its applications in low-rank matrix recovery (Q905912) (← links)
• On the conditioning of random subdictionaries (Q930731) (← links)
• Sparse approximate solution of partial differential equations (Q972312) (← links)
• When do stepwise algorithms meet subset selection criteria? (Q995431) (← links)
• Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\) (Q1012556) (← links)
• Sparse solutions to underdetermined Kronecker product systems (Q1039753) (← links)
• Sparse approximate multiquadric interpolation (Q1323626) (← links)
• MOEA/D with chain-based random local search for sparse optimization (Q1626237) (← links)
• Three \(l_1\) based nonconvex methods in constructing sparse mean reverting portfolios (Q1635895) (← links)
• Global optimization for low-dimensional switching linear regression and bounded-error estimation (Q1640233) (← links)
• \(l_1\)-\(l_2\) regularization of split feasibility problems (Q1652788) (← links)
• Quasi-interpolation and outliers removal (Q1652793) (← links)
• Prior model identification during subsurface flow data integration with adaptive sparse representation techniques (Q1663631) (← links)
• The sparsity of underdetermined linear system via \(l_p\) minimization for \(0 < p < 1\) (Q1666063) (← links)
• Best subset binary prediction (Q1668571) (← links)
• A globally convergent algorithm for nonconvex optimization based on block coordinate update (Q1676921) (← links)
• Optimality condition and complexity of order-value optimization problems and low order-value optimization problems (Q1679497) (← links)
• An improved algorithm for the \(L_2-L_p\) minimization problem (Q1683685) (← links)
• A generalized elastic net regularization with smoothed \(\ell _{q}\) penalty for sparse vector recovery (Q1687319) (← links)
• Analysis of the equivalence relationship between \(l_{0}\)-minimization and \(l_{p}\)-minimization (Q1688516) (← links)
• Exact recovery of sparse multiple measurement vectors by \(l_{2,p}\)-minimization (Q1691327) (← links)
• Weak fault detection of tapered rolling bearing based on penalty regularization approach (Q1712040) (← links)
• Optimization methods for regularization-based ill-posed problems: a survey and a multi-objective framework (Q1712546) (← links)
• An iterative support shrinking algorithm for non-Lipschitz optimization in image restoration (Q1716780) (← links)
• Sparse Markowitz portfolio selection by using stochastic linear complementarity approach (Q1716964) (← links)
• Robust missing traffic flow imputation considering nonnegativity and road capacity (Q1719096) (← links)
• Median filter based compressed sensing model with application to MR image reconstruction (Q1721512) (← links)
• An adaptive gradient projection algorithm for piecewise convex optimization and its application in compressed spectrum sensing (Q1721691) (← links)
• Analysis sparse representation for nonnegative signals based on determinant measure by DC programming (Q1722682) (← links)
• A new piecewise quadratic approximation approach for \(L_0\) norm minimization problem (Q1729942) (← links)
• Efficient projected gradient methods for cardinality constrained optimization (Q1729947) (← links)
• Maximal solutions of sparse analysis regularization (Q1730389) (← links)
• An overview on the applications of matrix theory in wireless communications and signal processing (Q1736835) (← links)
• Learning semidefinite regularizers (Q1740575) (← links)
• Measuring and moderating opinion polarization in social networks (Q1741348) (← links)
• Fast L1-L2 minimization via a proximal operator (Q1742664) (← links)
• Sparse recovery in probability via \(l_q\)-minimization with Weibull random matrices for \(0 < q\leq 1\) (Q1747365) (← links)
• A probabilistic learning algorithm for robust modeling using neural networks with random weights (Q1749195) (← links)
• DC formulations and algorithms for sparse optimization problems (Q1749449) (← links)
• Minimization of transformed \(L_1\) penalty: theory, difference of convex function algorithm, and robust application in compressed sensing (Q1749455) (← links)
• Dictionary evaluation and optimization for sparse coding based speech processing (Q1749610) (← links)
• Matrix completion under interval uncertainty (Q1752160) (← links)