Pages that link to "Item:Q4834376"
From MaRDI portal
The following pages link to Sparse Approximate Solutions to Linear Systems (Q4834376):
Displaying 50 items.
- Sparse Solutions by a Quadratically Constrained ℓq (0 <<i>q</i>< 1) Minimization Model (Q4995085) (← links)
- Analysis and Algorithms for Some Compressed Sensing Models Based on L1/L2 Minimization (Q4997175) (← links)
- (Q4999097) (← links)
- (Q5002622) (← links)
- (Q5002756) (← links)
- Approximate 1-Norm Minimization and Minimum-Rank Structured Sparsity for Various Generalized Inverses via Local Search (Q5003211) (← links)
- An accelerated majorization-minimization algorithm with convergence guarantee for non-Lipschitz wavelet synthesis model <sup>*</sup> (Q5019920) (← links)
- Block Bregman Majorization Minimization with Extrapolation (Q5037560) (← links)
- (Q5037987) (← links)
- Sparsity constrained optimization problems via disjunctive programming (Q5039398) (← links)
- Sparse index tracking using sequential Monte Carlo (Q5039622) (← links)
- Optimizing Sparsity over Lattices and Semigroups (Q5041733) (← links)
- On the Convexification of Constrained Quadratic Optimization Problems with Indicator Variables (Q5041763) (← links)
- Sparse Representation for Sampled-Data $$H^\infty $$ Filters (Q5049251) (← links)
- A General Framework of Rotational Sparse Approximation in Uncertainty Quantification (Q5052909) (← links)
- (Q5054626) (← links)
- Global optimization for sparse solution of least squares problems (Q5058393) (← links)
- A penalty decomposition approach for multi-objective cardinality-constrained optimization problems (Q5058409) (← links)
- Cross validation in sparse linear regression with piecewise continuous nonconvex penalties and its acceleration (Q5059117) (← links)
- An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems (Q5060779) (← links)
- Model Selection With Lasso-Zero: Adding Straw to the Haystack to Better Find Needles (Q5066436) (← links)
- Minimization of $L_1$ Over $L_2$ for Sparse Signal Recovery with Convergence Guarantee (Q5071446) (← links)
- A polynomial algorithm for best-subset selection problem (Q5073242) (← links)
- Approximation Bounds for Sparse Programs (Q5073726) (← links)
- Minimizing L <sub>1</sub> over L <sub>2</sub> norms on the gradient (Q5076010) (← links)
- Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems (Q5093646) (← links)
- Stable Image Reconstruction Using Transformed Total Variation Minimization (Q5094633) (← links)
- Sparse Probability Assessment Heuristic Based on Orthogonal Matching Pursuit (Q5121287) (← links)
- An unbiased approach to compressed sensing (Q5132273) (← links)
- Quantum tomography via compressed sensing: error bounds, sample complexity and efficient estimators (Q5137733) (← links)
- A tree-based dictionary learning framework (Q5137935) (← links)
- Convex Optimization for Group Feature Selection in Networked Data (Q5139860) (← links)
- Exact Recovery of Multichannel Sparse Blind Deconvolution via Gradient Descent (Q5143310) (← links)
- Fast Best Subset Selection: Coordinate Descent and Local Combinatorial Optimization Algorithms (Q5144778) (← links)
- Scalable Algorithms for the Sparse Ridge Regression (Q5148400) (← links)
- (Q5148934) (← links)
- (Q5149225) (← links)
- (Q5149233) (← links)
- Fast Thresholding Algorithms with Feedbacks and Partially Known Support for Compressed Sensing (Q5149553) (← links)
- (Q5159402) (← links)
- The Trimmed Lasso: Sparse Recovery Guarantees and Practical Optimization by the Generalized Soft-Min Penalty (Q5162621) (← links)
- A Scale-Invariant Approach for Sparse Signal Recovery (Q5204007) (← links)
- Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems (Q5210512) (← links)
- Sparse reconstructions from few noisy data: analysis of hierarchical Bayesian models with generalized gamma hyperpriors (Q5213327) (← links)
- (Q5214255) (← links)
- Random Projections for Linear Programming (Q5219688) (← links)
- Sparse System Identification in Pairs of Pulse and Takenaka--Malmquist Bases (Q5222159) (← links)
- Nonconvex Optimization for 3-Dimensional Point Source Localization Using a Rotating Point Spread Function (Q5236639) (← links)
- Uniqueness Conditions for A Class of ℓ<sub>0</sub>-Minimization Problems (Q5245836) (← links)
- Sampling in Image Representation and Compression (Q5249768) (← links)