Group sparse optimization via $\ell_{p,q}$ regularization
From MaRDI portal
Publication:5361291
zbMath1433.90202arXiv1601.07779MaRDI QIDQ5361291
Chong Li, Kaiwen Meng, Yao-Hua Hu, Jing Qin, Xiao Qi Yang
Publication date: 27 September 2017
Full work available at URL: https://arxiv.org/abs/1601.07779
nonconvex optimizationrestricted eigenvalue conditioniterative thresholding algorithmproximal gradient methodgroup sparse optimizationgene regulation networklower-order regularization
Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (26)
Nonconvex flexible sparsity regularization: theory and monotone numerical schemes ⋮ Proximal methods for reweighted \(l_Q\)-regularization of sparse signal recovery ⋮ Weak Sharp Minima for Convex Infinite Optimization Problems in Normed Linear Spaces ⋮ Multiple-sets split quasi-convex feasibility problems: Adaptive subgradient methods with convergence guarantee ⋮ Solving constrained nonsmooth group sparse optimization via group Capped-\(\ell_1\) relaxation and group smoothing proximal gradient algorithm ⋮ Local optimality for stationary points of group zero-norm regularized problems and equivalent surrogates ⋮ Joint learning of multiple Granger causal networks via non-convex regularizations: inference of group-level brain connectivity ⋮ A unified analysis of convex and non-convex \(\ell_p\)-ball projection problems ⋮ A Regularized Newton Method for \({\boldsymbol{\ell}}_{q}\) -Norm Composite Optimization Problems ⋮ A forward-backward algorithm with different inertial terms for structured non-convex minimization problems ⋮ Sparse estimation via lower-order penalty optimization methods in high-dimensional linear regression ⋮ Relative Lipschitz-like Property of Parametric Systems via Projectional Coderivatives ⋮ Proximal gradient method with extrapolation and line search for a class of non-convex and non-smooth problems ⋮ Convergence rate of the relaxed CQ algorithm under Hölderian type error bound property ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Modified inexact Levenberg-Marquardt methods for solving nonlinear least squares problems ⋮ Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems ⋮ A family of projection gradient methods for solving the multiple-sets split feasibility problem ⋮ Computing the nearest polynomial to multiple given polynomials with a given zero via \(l_{2,q}\)-norm minimization ⋮ Computation of second-order directional stationary points for group sparse optimization ⋮ Level-set subdifferential error bounds and linear convergence of Bregman proximal gradient method ⋮ Nonconvex and nonsmooth sparse optimization via adaptively iterative reweighted methods ⋮ RIP-based performance guarantee for low-tubal-rank tensor recovery ⋮ The \(\ell_{2,q}\) regularized group sparse optimization: lower bound theory, recovery bound and algorithms ⋮ Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions
This page was built for publication: Group sparse optimization via $\ell_{p,q}$ regularization
