Joint sparse optimization: lower-order regularization method and application in cell fate conversion
From MaRDI portal
Publication:6581202
Recommendations
- Group sparse optimization via \(\ell_{p,q}\) regularization
- Some advances in theory and algorithms for sparse optimization
- Exact recovery of sparse multiple measurement vectors by \(l_{2,p}\)-minimization
- Global convergence analysis of sparse regular nonconvex optimization problems
- Reconstruction of jointly sparse vectors via manifold optimization
Cites work
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A Unified Augmented Lagrangian Approach to Duality and Exact Penalization
- A mathematical introduction to compressive sensing
- A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem
- A proximal-gradient homotopy method for the sparse least-squares problem
- Algorithms for simultaneous sparse approximation. I: Greedy pursuit
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Analysis of multi-stage convex relaxation for sparse regularization
- Average Case Analysis of Multichannel Sparse Recovery Using Convex Relaxation
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Compressed sensing: how sharp is the restricted isometry property?
- Consistency of the group Lasso and multiple kernel learning
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Coordinate descent algorithms
- DC formulations and algorithms for sparse optimization problems
- Decoding by Linear Programming
- Greedy Algorithms for Joint Sparse Recovery
- Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions
- Group Sparse Recovery via the $\ell ^0(\ell ^2)$ Penalty: Theory and Algorithm
- Group sparse optimization via \(\ell_{p,q}\) regularization
- High-dimensional statistics. A non-asymptotic viewpoint
- Iterative hard thresholding for compressed sensing
- Joint sparse recovery based on variances
- Lasso-type recovery of sparse representations for high-dimensional data
- Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems
- Linear convergence of proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth minimization problems
- Lower bound theory of nonzero entries in solutions of \(\ell_2-\ell_p\) minimization
- Model Selection and Estimation in Regression with Grouped Variables
- Model-Based Compressive Sensing
- Nonconvex and nonsmooth sparse optimization via adaptively iterative reweighted methods
- On Recovery of Sparse Signals Via $\ell _{1}$ Minimization
- Optimization with sparsity-inducing penalties
- PET-MRI joint reconstruction by joint sparsity based tight frame regularization
- PET-MRI joint reconstruction with common edge weighted total variation regularization
- Quasi-convex feasibility problems: subgradient methods and convergence rates
- Recovery Algorithms for Vector-Valued Data with Joint Sparsity Constraints
- Simultaneous analysis of Lasso and Dantzig selector
- Sparse Approximate Solutions to Linear Systems
- Sparse and redundant representations. From theory to applications in signal and image processing.
- Sparse estimation via lower-order penalty optimization methods in high-dimensional linear regression
- The \(\ell_{2,q}\) regularized group sparse optimization: lower bound theory, recovery bound and algorithms
- The benefit of group sparsity
- Theoretical and Empirical Results for Recovery From Multiple Measurements
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
This page was built for publication: Joint sparse optimization: lower-order regularization method and application in cell fate conversion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6581202)