Neural network for a class of sparse optimization with L₀-regularization
From MaRDI portal
Neural network for a class of sparse optimization with \(L 0\)-regularization
Recommendations
- Smoothing neural network for L₀ regularized optimization problem with general convex constraints
- Newton method for \(\ell_0\)-regularized optimization
- Some advances in theory and algorithms for sparse optimization
- Sparse regularization with the ℓ0 norm
- Difference-of-Convex Algorithms for a Class of Sparse Group \ell₀ Regularized Optimization Problems
Cites work
- scientific article; zbMATH DE number 3674497 (Why is no real title available?)
- A collaborative neurodynamic approach to global and combinatorial optimization
- A continuous exact _0 penalty (CEL0) for least squares regularized problem
- A neurodynamic approach to nonlinear optimization problems with affine equality and convex inequality constraints
- A one-layer recurrent neural network for constrained nonconvex optimization
- A one-layer recurrent neural network for constrained nonsmooth invex optimization
- Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization
- Complexity of unconstrained \(L_2 - L_p\) minimization
- Compressed sensing
- Computing B-stationary points of nonsmooth DC programs
- DC approximation approaches for sparse optimization
- Distributed Partitioned Big-Data Optimization via Asynchronous Dual Decomposition
- Does $\ell _{p}$ -Minimization Outperform $\ell _{1}$ -Minimization?
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Generalized Neural Network for Nonsmooth Nonlinear Programming Problems
- High dimensional thresholded regression and shrinkage effect
- 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
- Learning sparse classifiers with difference of convex functions algorithms
- Nearly unbiased variable selection under minimax concave penalty
- Nondifferentiable optimization via smooth approximation: General analytical approach
- Optimization and nonsmooth analysis
- Optimization theory and methods. Nonlinear programming
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Smoothing inertial neurodynamic approach for sparse signal reconstruction via \(L_p\)-norm minimization
- Smoothing methods for nonsmooth, nonconvex minimization
- Sparse Approximate Solutions to Linear Systems
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Strong oracle optimality of folded concave penalized estimation
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Variational Analysis
- ``Neural computation of decisions in optimization problems
Cited in
(10)- Transformed \(\ell_1\) regularization for learning sparse deep neural networks
- Optimization of sparsity-constrained neural networks as a mixed integer linear program
- Limited memory bundle DC algorithm for sparse pairwise kernel learning
- Nonconvex regularization for sparse neural networks
- scientific article; zbMATH DE number 7108981 (Why is no real title available?)
- A gradient-based learning method with smoothing group L₀ regularization for interval perceptron and interval weights
- scientific article; zbMATH DE number 6378124 (Why is no real title available?)
- Nonconvex Sparse Regularization for Deep Neural Networks and Its Optimality
- Variable projection algorithms with sparse constraint for separable nonlinear models
- Combining neural networks for function approximation under conditions of sparse data: the biased regression approach
This page was built for publication: Neural network for a class of sparse optimization with \(L_0\)-regularization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6077003)
