Neural network for nonsmooth pseudoconvex optimization with general convex constraints
From MaRDI portal
Recommendations
- A one-layer recurrent neural network for solving pseudoconvex optimization with box set constraints
- A one-layer recurrent neural network for constrained pseudoconvex optimization and its application for dynamic portfolio optimization
- A one-layer recurrent neural network for non-smooth convex optimization subject to linear inequality constraints
- A recurrent neural network for solving a class of generalized convex optimization problems
- Neural network for constrained nonsmooth optimization using Tikhonov regularization
Cites work
- ``Neural computation of decisions in optimization problems
- A class of finite-time dual neural networks for solving quadratic programming problems and its \(k\)-winners-take-all application
- A dynamical approach to convex minimization coupling approximation with the steepest descent method
- A one-layer recurrent neural network for constrained nonconvex optimization
- A one-layer recurrent neural network for constrained pseudoconvex optimization and its application for dynamic portfolio optimization
- Characterization of nonsmooth quasiconvex and pseudoconvex functions
- Convergence to equilibrium of solutions to a nonautonomous semilinear viscoelastic equation with finite or infinite memory
- Elasticity
- From error bounds to the complexity of first-order descent methods for convex functions
- Generalized convexity of functions and generalized monotonicity of set-valued maps
- Generalized Neural Network for Nonsmooth Nonlinear Programming Problems
- Global exponential stability of complex-valued neural networks with both time-varying delays and impulsive effects
- scientific article; zbMATH DE number 4027357 (Why is no real title available?)
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 3224758 (Why is no real title available?)
- Lagrange Programming Neural Network Approach for Target Localization in Distributed MIMO Radar
- Neural Network for Solving Constrained Convex Optimization Problems With Global Attractivity
- Nondifferentiable optimization via smooth approximation: General analytical approach
- On Nonlinear Fractional Programming
- Performance Analysis of Gradient Neural Network Exploited for Online Time-Varying Matrix Inversion
- Smoothing methods for nonsmooth, nonconvex minimization
Cited in
(42)- A novel neural network to nonlinear complex-variable constrained nonconvex optimization
- A neurodynamic optimization approach for complex-variables programming problem
- Stochastic generalized gradient methods for training nonconvex nonsmooth neural networks
- Continuous-time distributed optimization with strictly pseudoconvex objective functions
- A neurodynamic approach to nonlinear optimization problems with affine equality and convex inequality constraints
- A neurodynamic approach to nonsmooth constrained pseudoconvex optimization problem
- Discrete-time Zhang neural networks for time-varying nonlinear optimization
- A simplified recurrent neural network for pseudoconvex optimization subject to linear equality constraints
- A new steepest descent differential inclusion-based method for solving general nonsmooth convex optimization problems
- Subgradient-based feedback neural networks for non-differentiable convex optimization problems
- A nonpenalty neurodynamic model for complex-variable optimization
- Non-smooth optimization based on resilient backpropagation search for unconstrained and simply bounded problems
- scientific article; zbMATH DE number 988747 (Why is no real title available?)
- A one-layer recurrent neural network for constrained pseudoconvex optimization and its application for dynamic portfolio optimization
- A recurrent neural network for solving a class of generalized convex optimization problems
- A one-layer recurrent neural network for constrained nonsmooth invex optimization
- A one-layer recurrent neural network for non-smooth convex optimization subject to linear inequality constraints
- scientific article; zbMATH DE number 7108981 (Why is no real title available?)
- scientific article; zbMATH DE number 6025195 (Why is no real title available?)
- A continuous-time neurodynamic approach and its discretization for distributed convex optimization over multi-agent systems
- Smoothing neural network for L₀ regularized optimization problem with general convex constraints
- Cardinality-constrained portfolio selection based on collaborative neurodynamic optimization
- A neurodynamic approach for nonsmooth optimal power consumption of intelligent and connected vehicles
- A one-layer recurrent neural network for nonsmooth pseudoconvex optimization with quasiconvex inequality and affine equality constraints
- Neurodynamics-driven portfolio optimization with targeted performance criteria
- A subgradient-based neurodynamic algorithm to constrained nonsmooth nonconvex interval-valued optimization
- A neurodynamic optimization approach to supervised feature selection via fractional programming
- Recurrent neural network with noise rejection for cyclic motion generation of robotic manipulators
- A varying-parameter fixed-time gradient-based dynamic network for convex optimization
- Online distributed optimization with strongly pseudoconvex-sum cost functions and coupled inequality constraints
- A framework for controllable Pareto front learning with completed scalarization functions and its applications
- Neurodynamics-driven holistic approaches to semi-supervised feature selection
- Self-adaptive algorithms for quasiconvex programming and applications to machine learning
- A hyper-transformer model for controllable Pareto front learning with split feasibility constraints
- A smoothing approximation-based adaptive neurodynamic approach for nonsmooth resource allocation problem
- Random gradient-free method for online distributed optimization with strongly pseudoconvex cost functions
- On a minimization problem of the maximum generalized eigenvalue: properties and algorithms
- A neurodynamic approach for a class of pseudoconvex semivectorial bilevel optimization problems
- Neurodynamic optimization model for bilevel programming with pseudoconvex upper-level optimization
- Distributed proximal algorithms for constrained resource allocation over continuous and discrete communication
- A one-layer recurrent neural network for constrained nonconvex optimization
- Neural network for constrained nonsmooth optimization using Tikhonov regularization
This page was built for publication: Neural network for nonsmooth pseudoconvex optimization with general convex constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2179805)
