A neurodynamic optimization technique based on overestimator and underestimator functions for solving a class of non-convex optimization problems
From MaRDI portal
Publication:2228767
DOI10.1016/j.matcom.2015.09.013OpenAlexW2193129507MaRDI QIDQ2228767
Alaeddin Malek, N. Hosseinipour-Mahani
Publication date: 19 February 2021
Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.matcom.2015.09.013
recurrent neural networknon-convex optimizationglobal optimality conditionsunderestimatoroverestimator
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A one-layer recurrent neural network for constrained nonconvex optimization
- Numerical solution for linear and quadratic programming problems using a recurrent neural network
- Lagrange multiplier necessary conditions for global optimality for non-convex minimization over a quadratic constraint via S-lemma
- New Kuhn-Tucker sufficiency for global optimality via convexification
- ``Neural computation of decisions in optimization problems
- A dynamic genetic algorithm based on continuous neural networks for a kind of non-convex optimization problems.
- A new type of recurrent neural networks for real-time solution of Lyapunov equation with time-varying coefficient matrices
- A new neural network for solving quadratic programming problems with equality and inequality constraints
- A collective neurodynamic optimization approach to bound-constrained nonconvex optimization
- Efficient recurrent neural network model for the solution of general nonlinear optimization problems
- Generalized Neural Network for Nonsmooth Nonlinear Programming Problems
- Advances in Neural Networks – ISNN 2005
This page was built for publication: A neurodynamic optimization technique based on overestimator and underestimator functions for solving a class of non-convex optimization problems
