Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems (Q5093646)

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

Difference-of-Convex Algorithms for a Class of Sparse Group \ell₀ Regularized Optimization Problems

scientific article; zbMATH DE number 7565254

Language	Label	Description	Also known as
default for all languages	No label defined
English	Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems	scientific article; zbMATH DE number 7565254

Statements

instance of

scholarly article

0 references

title

Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems (English)

0 references

published in

SIAM Journal on Optimization

0 references

publication date

29 July 2022

0 references

full work available at URL

https://arxiv.org/abs/2109.05251

0 references

zbMATH Keywords

sparse group $\ell_0$ regularization

0 references

continuous relaxation

0 references

DC algorithm

0 references

global convergence

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Difference-of-convex learning: directional stationarity, optimality, and sparsity

0 references

The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions

0 references

On the convergence of the proximal algorithm for nonsmooth functions involving analytic features

0 references

Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods

0 references

Optimization problems involving group sparsity terms

0 references

Enhancing sparsity by reweighted $\ell _{1}$ minimization

0 references

Restricted isometry properties and nonconvex compressive sensing

0 references

Non-Lipschitz $\ell_{p}$-Regularization and Box Constrained Model for Image Restoration

0 references

Optimization and nonsmooth analysis

0 references

Structured Compressed Sensing: From Theory to Applications

0 references

Block-Sparse Signals: Uncertainty Relations and Efficient Recovery

0 references

Robust Recovery of Signals From a Structured Union of Subspaces

0 references

Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties

0 references

Sparsest solutions of underdetermined linear systems via $ \ell _q$-minimization for $0<q\leqslant 1$

0 references

DC formulations and algorithms for sparse optimization problems

0 references

A selective review of group selection in high-dimensional models

0 references

Asymptotic properties of bridge estimators in sparse high-dimensional regression models

0 references

Structured variable selection with sparsity-inducing norms

0 references

Group Sparse Recovery via the $\ell ^0(\ell ^2)$ Penalty: Theory and Algorithm

0 references

DC programming and DCA: thirty years of developments

0 references

DC approximation approaches for sparse optimization

0 references

Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods

0 references

A highly efficient semismooth Newton augmented Lagrangian method for solving lasso problems

0 references

Efficient sparse semismooth Newton methods for the clustered Lasso problem

0 references

A refined convergence analysis of $\mathrm{pDCA}_{e}$ with applications to simultaneous sparse recovery and outlier detection

0 references

Iterative hard thresholding methods for $l_0$ regularized convex cone programming

0 references

Nonmonotone enhanced proximal DC algorithms for a class of structured nonsmooth DC programming

0 references

Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization

0 references

Sparse Approximate Solutions to Linear Systems

0 references

Relationship between the optimal solutions of least squares regularized with $\ell_{0}$-norm and constrained by $k$-sparsity

0 references

Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions

0 references

Computing B-stationary points of nonsmooth DC programs

0 references

A bilinear formulation for vector sparsity optimization

0 references

Group variable selection via $\ell_{p,0}$ regularization and application to optimal scoring

0 references

Q4235027

0 references

A continuous exact $\ell_0$ penalty (CEL0) for least squares regularized problem

0 references

A unified view of exact continuous penalties for $\ell_2$-$\ell_0$ minimization

0 references

On the Reconstruction of Block-Sparse Signals With an Optimal Number of Measurements

0 references

Q5149020

0 references

Probing the Pareto frontier for basis pursuit solutions

0 references

A proximal difference-of-convex algorithm with extrapolation

0 references

Sparse Reconstruction by Separable Approximation

0 references

Multi-Tissue Decomposition of Diffusion MRI Signals via L0 Sparse-Group Estimation

0 references

Nearly unbiased variable selection under minimax concave penalty

0 references

An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems

0 references

Newton method for $\ell_0$-regularized optimization

0 references

Identifiers

zbMATH Open document ID

1496.90097

0 references

DOI

10.1137/21M1443455

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Difference-of-Convex Algorithms for a Class of Sparse Group $\ell 0$ Regularized Optimization Problems