Joint sparse optimization: lower-order regularization method and application in cell fate conversion

DOI10.1088/1361-6420/AD617DMaRDI QIDQ6581202FDOQ6581202

Authors: Yaohua Hu, Xinlin Hu, Carisa Kwok Wai Yu, J. Qin 

Publication date: 30 July 2024

Published in: Inverse Problems (Search for Journal in Brave)

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

zbMATH Keywords

global convergenceproximal gradient algorithmjoint sparse optimizationconsistency theorylower-order regularizationcell fate conversion

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Nonlinear programming (90C30)

Cites Work

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

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)