Recovery bounds for cardinality regularized optimization problem
From MaRDI portal
Cites work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A method for finding structured sparse solutions to nonnegative least squares problems with applications
- A proximal point algorithm for log-determinant optimization with group Lasso regularization
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- An application of sparse-group Lasso regularization to equity portfolio optimization and sector selection
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- An unconstrained \(\ell_q\) minimization with \(0<q\leq 1\) for sparse solution of underdetermined linear systems
- Analysis of multi-stage convex relaxation for sparse regularization
- Atomic decomposition by basis pursuit
- Decoding by Linear Programming
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Global convergence of splitting methods for nonconvex composite optimization
- Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions
- Group sparse optimization via \(\ell_{p,q}\) regularization
- Group variable selection via \(\ell_{p,0}\) regularization and application to optimal scoring
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- Iterative hard thresholding for compressed sensing
- Iterative mix thresholding algorithm with continuation technique for mix sparse optimization and application
- Iterative thresholding for sparse approximations
- Joint sparse optimization: lower-order regularization method and application in cell fate conversion
- Lasso-type recovery of sparse representations for high-dimensional data
- Linear convergence of CQ algorithms and applications in gene regulatory network inference
- Lower bound theory of nonzero entries in solutions of _2-_p minimization
- Model Selection and Estimation in Regression with Grouped Variables
- Multivariate sparse group Lasso for the multivariate multiple linear regression with an arbitrary group structure
- On convergence of iterative thresholding algorithms to approximate sparse solution for composite nonconvex optimization
- Restricted isometry properties and nonconvex compressive sensing
- Signal Recovery by Proximal Forward-Backward Splitting
- Simultaneous analysis of Lasso and Dantzig selector
- Sparse Approximation via Penalty Decomposition Methods
- Sparsity oracle inequalities for the Lasso
- Structured sparsity through convex optimization
- The \(\ell_{2,q}\) regularized group sparse optimization: lower bound theory, recovery bound and algorithms
- The benefit of group sparsity
- The sparsity and bias of the LASSO selection in high-dimensional linear regression
This page was built for publication: Recovery bounds for cardinality regularized optimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7316305)
