On choosing initial values of iteratively reweighted _1 algorithms for the piece-wise exponential penalty
From MaRDI portal
Publication:6587598
Cites work
- 10.1162/153244303765208403
- A bisection method for computing the proximal operator of the \(\ell_p\)-norm for any \(0 < p < 1\) with application to Schatten \(p\)-norms
- A constructive approach for computing the proximity operator of the \(p\)-th power of the \(\ell_1\) norm
- A novel regularization based on the error function for sparse recovery
- A universal rank approximation method for matrix completion
- Algorithmic versatility of SPF-regularization methods
- Analysis of multi-stage convex relaxation for sparse regularization
- Compressed data separation via unconstrained l1-split analysis
- Convergence rate analysis of proximal iteratively reweighted \(\ell_1\) methods for \(\ell_p\) regularization problems
- DC approximation approaches for sparse optimization
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Error analysis of classification learning algorithms based on LUMs loss
- Exact penalty functions for nonlinear integer programming problems
- Fast L1-L2 minimization via a proximal operator
- Feature Selection via Mathematical Programming
- First-order methods in optimization
- High-Dimensional Data Analysis with Low-Dimensional Models
- scientific article; zbMATH DE number 1215260 (Why is no real title available?)
- Iterative thresholding for sparse approximations
- Learning theory of minimum error entropy under weak moment conditions
- Minimization of \(\ell_{1-2}\) for compressed sensing
- Minimization of L₁ over L₂ for sparse signal recovery with convergence guarantee
- Minimization of transformed \(l_1\) penalty: closed form representation and iterative thresholding algorithms
- Minimization of transformed L₁ penalty: theory, difference of convex function algorithm, and robust application in compressed sensing
- Modified proximal symmetric ADMMs for multi-block separable convex optimization with linear constraints
- Multi-task learning in vector-valued reproducing kernel Banach spaces with the \(\ell^1\) norm
- Nearly unbiased variable selection under minimax concave penalty
- Neural network interpolation operators activated by smooth ramp functions
- New results on the equivalence between zero-one programming and continuous concave programming
- Nonconvex and nonsmooth sparse optimization via adaptively iterative reweighted methods
- On iteratively reweighted algorithms for nonsmooth nonconvex optimization in computer vision
- One-step sparse estimates in nonconcave penalized likelihood models
- Ratio and difference of \(l_1\) and \(l_2\) norms and sparse representation with coherent dictionaries
- Relating _p regularization and reweighted _1 regularization
- Sparse recovery based on the generalized error function
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Statistical foundations of data science
- Structured sparsity promoting functions
- Successive Concave Sparsity Approximation for Compressed Sensing
- The Convergence Guarantees of a Non-Convex Approach for Sparse Recovery
- The Lambert W Function
- The proximity operator of the log-sum penalty
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Wavelet inpainting with the \(\ell_{0}\) sparse regularization
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)
