On choosing initial values of iteratively reweighted $\ell_1$ algorithms for the piece-wise exponential penalty

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Nearly unbiased variable selection under minimax concave penalty
Wavelet inpainting with the $\ell_{0}$ sparse regularization
DC approximation approaches for sparse optimization
Iterative thresholding for sparse approximations
Enhancing sparsity by reweighted $\ell _{1}$ minimization
New results on the equivalence between zero-one programming and continuous concave programming
One-step sparse estimates in nonconcave penalized likelihood models
Exact penalty functions for nonlinear integer programming problems
Sparsest solutions of underdetermined linear systems via $ \ell _q$-minimization for $0<q\leqslant 1$
Fast L1-L2 minimization via a proximal operator
Minimization of transformed $L_1$ penalty: theory, difference of convex function algorithm, and robust application in compressed sensing
Multi-task learning in vector-valued reproducing kernel Banach spaces with the $\ell^1$ norm
Nonconvex and nonsmooth sparse optimization via adaptively iterative reweighted methods
The proximity operator of the log-sum penalty
Relating $\ell_p$ regularization and reweighted $\ell_1$ regularization
Structured sparsity promoting functions
Ratio and difference of $l_1$ and $l_2$ norms and sparse representation with coherent dictionaries
Minimization of transformed $l_1$ penalty: closed form representation and iterative thresholding algorithms
A novel regularization based on the error function for sparse recovery
Convergence rate analysis of proximal iteratively reweighted $\ell_1$ methods for $\ell_p$ regularization problems
Feature Selection via Mathematical Programming
Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
The Convergence Guarantees of a Non-Convex Approach for Sparse Recovery
First-Order Methods in Optimization
Successive Concave Sparsity Approximation for Compressed Sensing
Learning theory of minimum error entropy under weak moment conditions
Minimization of $L_1$ Over $L_2$ for Sparse Signal Recovery with Convergence Guarantee
The Lambert W Function
Modified proximal symmetric ADMMs for multi-block separable convex optimization with linear constraints
Neural network interpolation operators activated by smooth ramp functions
A universal rank approximation method for matrix completion
Statistical Foundations of Data Science
High-Dimensional Data Analysis with Low-Dimensional Models
Minimization of $\ell_{1-2}$ for Compressed Sensing
On Iteratively Reweighted Algorithms for Nonsmooth Nonconvex Optimization in Computer Vision
Algorithmic versatility of SPF-regularization methods
Compressed data separation via unconstrained l1-split analysis
10.1162/153244303765208403
A constructive approach for computing the proximity operator of the $p$-th power of the $\ell_1$ norm
Error analysis of classification learning algorithms based on LUMs loss
A bisection method for computing the proximal operator of the $\ell_p$-norm for any $0 < p < 1$ with application to Schatten $p$-norms
Sparse recovery based on the generalized error function

This page was built for publication: On choosing initial values of iteratively reweighted $\ell_1$ algorithms for the piece-wise exponential penalty

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6587598)

On choosing initial values of iteratively reweighted \(\ell_1\) algorithms for the piece-wise exponential penalty