Neural network for a class of sparse optimization with \(L_0\)-regularization
From MaRDI portal
Publication:6077003
DOI10.1016/j.neunet.2022.03.033OpenAlexW4224049752MaRDI QIDQ6077003
Jiazhen Wei, Zhe Wei, Wei Bian, Qingfa Li
Publication date: 17 October 2023
Published in: Neural Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.neunet.2022.03.033
critical pointnonconvex optimizationsparse optimization\(L_0\)-regularizationprojected neural network
Cites Work
- Unnamed Item
- Nearly unbiased variable selection under minimax concave penalty
- DC approximation approaches for sparse optimization
- A one-layer recurrent neural network for constrained nonsmooth invex optimization
- Smoothing methods for nonsmooth, nonconvex minimization
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- A one-layer recurrent neural network for constrained nonconvex optimization
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- ``Neural computation of decisions in optimization problems
- Nondifferentiable optimization via smooth approximation: General analytical approach
- A neurodynamic approach to nonlinear optimization problems with affine equality and convex inequality constraints
- A collaborative neurodynamic approach to global and combinatorial optimization
- Complexity of unconstrained \(L_2 - L_p\) minimization
- Optimization theory and methods. Nonlinear programming
- Strong oracle optimality of folded concave penalized estimation
- Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization
- Learning sparse classifiers with difference of convex functions algorithms
- Computing B-Stationary Points of Nonsmooth DC Programs
- A Continuous Exact $\ell_0$ Penalty (CEL0) for Least Squares Regularized Problem
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Optimization and nonsmooth analysis
- Variational Analysis
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Does $\ell _{p}$ -Minimization Outperform $\ell _{1}$ -Minimization?
- Generalized Neural Network for Nonsmooth Nonlinear Programming Problems
- Distributed Partitioned Big-Data Optimization via Asynchronous Dual Decomposition
- Sparse Approximate Solutions to Linear Systems
- High-Accuracy Compressed Sensing Decoder Based on Adaptive <inline-formula> <tex-math notation="LaTeX">$(\ell_{0},\ell_{1})$</tex-math> </inline-formula> Complex Approximate Message Passing: Cross-layer Design
- High Dimensional Thresholded Regression and Shrinkage Effect
- Compressed sensing
- Smoothing inertial neurodynamic approach for sparse signal reconstruction via \(L_p\)-norm minimization
