Pages that link to "Item:Q4834376"
From MaRDI portal
The following pages link to Sparse Approximate Solutions to Linear Systems (Q4834376):
Displaying 50 items.
- On solutions of sparsity constrained optimization (Q259112) (← links)
- Combining a relaxed EM algorithm with Occam's razor for Bayesian variable selection in high-dimensional regression (Q268752) (← links)
- Best subset selection via a modern optimization lens (Q282479) (← links)
- Operator theoretic framework for optimal placement of sensors and actuators for control of nonequilibrium dynamics (Q289533) (← links)
- Volume constrained 2-phase segmentation method utilizing a linear system solver based on the best uniform polynomial approximation of \(x^{- 1/2}\) (Q311414) (← links)
- Sparse solutions of linear complementarity problems (Q312696) (← links)
- DC approximation approaches for sparse optimization (Q319281) (← links)
- The non-convex sparse problem with nonnegative constraint for signal reconstruction (Q328467) (← links)
- Matrix sparsification and the sparse null space problem (Q329287) (← links)
- Sparse approximation is provably hard under coherent dictionaries (Q340554) (← links)
- Regularity properties of non-negative sparsity sets (Q342902) (← links)
- Checking strict positivity of Kraus maps is NP-hard (Q344532) (← links)
- ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals (Q372857) (← links)
- Some optimization problems on ranks and inertias of matrix-valued functions subject to linear matrix equation restrictions (Q380304) (← links)
- Sparsity and spectral properties of dual frames (Q389560) (← links)
- Sparse solutions of sparse linear systems: fixed-parameter tractability and an application of complex group testing (Q392033) (← links)
- Restricted normal cones and sparsity optimization with affine constraints (Q404252) (← links)
- Remote sensing via \(\ell_1\)-minimization (Q404256) (← links)
- Model-based multiple rigid object detection and registration in unstructured range data (Q408868) (← links)
- Restricted isometries for partial random circulant matrices (Q412402) (← links)
- Recovery of sparsest signals via \(\ell^q \)-minimization (Q413642) (← links)
- Sparse conjugate directions pursuit with application to fixed-size kernel models (Q413891) (← links)
- An approximation theory of matrix rank minimization and its application to quadratic equations (Q417562) (← links)
- General nonexact oracle inequalities for classes with a subexponential envelope (Q447832) (← links)
- Robust face recognition via block sparse Bayesian learning (Q474521) (← links)
- Compressed sensing with coherent tight frames via \(l_q\)-minimization for \(0 < q \leq 1\) (Q479885) (← links)
- Weighted-average alternating minimization method for magnetic resonance image reconstruction based on compressive sensing (Q479909) (← links)
- Minimal zero norm solutions of linear complementarity problems (Q481048) (← links)
- Sparse dual frames and dual Gabor functions of minimal time and frequency supports (Q485118) (← links)
- The road to deterministic matrices with the restricted isometry property (Q485193) (← links)
- Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications (Q489110) (← links)
- On the null space property of \(l_q\)-minimization for \(0 < q \leq 1\) in compressed sensing (Q492558) (← links)
- Computing sparse representation in a highly coherent dictionary based on difference of \(L_1\) and \(L_2\) (Q493283) (← links)
- Accelerating a Gibbs sampler for variable selection on genomics data with summarization and variable pre-selection combining an array DBMS and R (Q506436) (← links)
- On the solution uniqueness characterization in the L1 norm and polyhedral gauge recovery (Q511961) (← links)
- Sparse decomposition by iterating Lipschitzian-type mappings (Q517031) (← links)
- Sparse recovery under weak moment assumptions (Q520739) (← links)
- An iteratively approximated gradient projection algorithm for sparse signal reconstruction (Q529940) (← links)
- Identification of switched linear systems via sparse optimization (Q534276) (← links)
- Convergence of fixed-point continuation algorithms for matrix rank minimization (Q535287) (← links)
- Fixed point and Bregman iterative methods for matrix rank minimization (Q543413) (← links)
- Phase transitions for greedy sparse approximation algorithms (Q629259) (← links)
- A note on the complexity of \(L _{p }\) minimization (Q644905) (← links)
- Interpreting latent variables in factor models via convex optimization (Q681494) (← links)
- Optimality analysis on partial \(l_1\)-minimization recovery (Q683727) (← links)
- Iterative thresholding for sparse approximations (Q734940) (← links)
- Analysis of basis pursuit via capacity sets (Q734943) (← links)
- Image reconstruction for diffuse optical tomography based on radiative transfer equation (Q738275) (← links)
- A note on sparse solutions of sparse linear systems (Q740981) (← links)
- GPU accelerated greedy algorithms for compressed sensing (Q744210) (← links)
