Smoothing neural network for \(L_0\) regularized optimization problem with general convex constraints
From MaRDI portal
Publication:6055122
DOI10.1016/j.neunet.2021.08.001zbMath1522.90209OpenAlexW3187109887MaRDI QIDQ6055122
No author found.
Publication date: 28 September 2023
Published in: Neural Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.neunet.2021.08.001
neural networkdifferential inclusionsmoothing methodnonsmooth nonconvex optimization\(L_0\) regularizationgeneral convex constraints
Related Items (2)
Asymptotic stability and synchronization of fractional delayed memristive neural networks with algebraic constraints ⋮ A convergent iterative support shrinking algorithm for non-Lipschitz multi-phase image labeling model
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A one-layer recurrent neural network for constrained pseudoconvex optimization and its application for dynamic portfolio optimization
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
- Smoothing methods for nonsmooth, nonconvex minimization
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Neural network for nonsmooth pseudoconvex optimization with general convex constraints
- A neurodynamic approach to nonlinear optimization problems with affine equality and convex inequality constraints
- Multi-stage convex relaxation for feature selection
- Strong oracle optimality of folded concave penalized estimation
- Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization
- Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization
- A Continuous Exact $\ell_0$ Penalty (CEL0) for Least Squares Regularized Problem
- Linearly Constrained Non-Lipschitz Optimization for Image Restoration
- Restricted isometry properties and nonconvex compressive sensing
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Optimization and nonsmooth analysis
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Optimality and Complexity for Constrained Optimization Problems with Nonconvex Regularization
- Sparse Approximate Solutions to Linear Systems
- Neural Network for Solving Constrained Convex Optimization Problems With Global Attractivity
- Generalized gradient projection neural networks for nonsmooth optimization problems
- A Unified View of Exact Continuous Penalties for $\ell_2$-$\ell_0$ Minimization
- Non-Lipschitz $\ell_{p}$-Regularization and Box Constrained Model for Image Restoration
- Nearest neighbor pattern classification
- Set-valued analysis
This page was built for publication: Smoothing neural network for \(L_0\) regularized optimization problem with general convex constraints
