Pages that link to "Item:Q734323"
From MaRDI portal
The following pages link to Iterative hard thresholding for compressed sensing (Q734323):
Displaying 50 items.
- Sparse estimation of Cox proportional hazards models via approximated information criteria (Q154277) (← links)
- A note on the complexity of proximal iterative hard thresholding algorithm (Q259117) (← links)
- Best subset selection via a modern optimization lens (Q282479) (← links)
- Relationship between the optimal solutions of least squares regularized with \(\ell_{0}\)-norm and constrained by \(k\)-sparsity (Q285544) (← links)
- Minimum \( n\)-rank approximation via iterative hard thresholding (Q299732) (← links)
- Recent development of dual-dictionary learning approach in medical image analysis and reconstruction (Q308734) (← links)
- Conjugate gradient acceleration of iteratively re-weighted least squares methods (Q316180) (← links)
- Design of wideband fractional-order differentiator using interlaced sampling method (Q318551) (← links)
- Error bounds and stability in the \(\ell_0\) regularized for CT reconstruction from small projections (Q326422) (← links)
- Robust sparse phase retrieval made easy (Q347523) (← links)
- Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations (Q347862) (← links)
- The essential ability of sparse reconstruction of different compressive sensing strategies (Q362190) (← links)
- Sparse microwave imaging: principles and applications (Q362310) (← links)
- Compressed sensing SAR imaging based on sparse representation in fractional Fourier domain (Q362320) (← links)
- Restricted isometries for partial random circulant matrices (Q412402) (← links)
- Sparse Legendre expansions via \(\ell_1\)-minimization (Q420755) (← links)
- Compressive sensing of analog signals using discrete prolate spheroidal sequences (Q448495) (← links)
- Iterative hard thresholding methods for \(l_0\) regularized convex cone programming (Q463721) (← links)
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming (Q463732) (← links)
- Optimal computational and statistical rates of convergence for sparse nonconvex learning problems (Q482875) (← links)
- Tensor networks and hierarchical tensors for the solution of high-dimensional partial differential equations (Q506609) (← links)
- Sparse signal recovery using a new class of random matrices (Q520894) (← links)
- Convergence of fixed-point continuation algorithms for matrix rank minimization (Q535287) (← links)
- Gradient iteration with \(\ell _{p}\)-norm constraints (Q542878) (← links)
- A non-adapted sparse approximation of PDEs with stochastic inputs (Q543721) (← links)
- Compressed sensing with coherent and redundant dictionaries (Q544040) (← links)
- Phase transitions for greedy sparse approximation algorithms (Q629259) (← links)
- Projected gradient iteration for nonlinear operator equation (Q633958) (← links)
- Democracy in action: quantization, saturation, and compressive sensing (Q643647) (← links)
- A note on the complexity of \(L _{p }\) minimization (Q644905) (← links)
- On support sizes of restricted isometry constants (Q711053) (← links)
- Iterative hard thresholding for compressed sensing (Q734323) (← links)
- Iterative hard thresholding based on randomized Kaczmarz method (Q736906) (← links)
- Hard thresholding pursuit algorithms: number of iterations (Q739467) (← links)
- GPU accelerated greedy algorithms for compressed sensing (Q744210) (← links)
- An attention algorithm for solving large scale structured \(l_0\)-norm penalty estimation problems (Q825333) (← links)
- A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem (Q890462) (← links)
- Efficient nonconvex sparse group feature selection via continuous and discrete optimization (Q892230) (← links)
- Adaptive projected gradient thresholding methods for constrained \(l_0\) problems (Q892792) (← links)
- Sampling in the analysis transform domain (Q900778) (← links)
- Interpolation via weighted \(\ell_{1}\) minimization (Q905907) (← links)
- MOEA/D with chain-based random local search for sparse optimization (Q1626237) (← links)
- Observable dictionary learning for high-dimensional statistical inference (Q1639590) (← links)
- Expander \(\ell_0\)-decoding (Q1669068) (← links)
- Recovery of block sparse signals under the conditions on block RIC and ROC by BOMP and BOMMP (Q1673807) (← links)
- Existence and convergence analysis of \(\ell_{0}\) and \(\ell_{2}\) regularizations for limited-angle CT reconstruction (Q1673835) (← links)
- A globally convergent algorithm for nonconvex optimization based on block coordinate update (Q1676921) (← links)
- An iterative support shrinking algorithm for non-Lipschitz optimization in image restoration (Q1716780) (← 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)
