A recurrent neural network for solving a class of generalized convex optimization problems
DOI10.1016/j.neunet.2013.03.010zbMath1296.90088OpenAlexW2067811671WikidataQ46125443 ScholiaQ46125443MaRDI QIDQ459437
Alireza Hosseini, Jun Wang, Mohammed Hosseini Ali Abadi
Publication date: 9 October 2014
Published in: Neural Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.neunet.2013.03.010
nonsmooth optimizationdifferential inclusionpseudoconvexityrecurrent neural networksgeneralized convex
Convex programming (90C25) Learning and adaptive systems in artificial intelligence (68T05) Neural networks for/in biological studies, artificial life and related topics (92B20)
Related Items (19)
Cites Work
- Unnamed Item
- Unnamed Item
- A one-layer recurrent neural network for constrained pseudoconvex optimization and its application for dynamic portfolio optimization
- Handbook of mathematical economics. Vol. I
- A deterministic annealing neural network for convex programming
- The origins of quasi-concavity: a development between mathematics and economics.
- Some extensions of nonconvex economic modeling: invexity, quasimax, and new stability conditions
- A recurrent neural network with exponential convergence for solving convex quadratic program and related linear piecewise equations
- A new steepest descent differential inclusion-based method for solving general nonsmooth convex optimization problems
- A differential inclusion-based approach for solving nonsmooth convex optimization problems
- Minimizing the Condition Number of a Gram Matrix
- Optimizing Condition Numbers
- Optimization and nonsmooth analysis
- Generalized Neural Network for Nonsmooth Nonlinear Programming Problems
- Generalized gradient projection neural networks for nonsmooth optimization problems
This page was built for publication: A recurrent neural network for solving a class of generalized convex optimization problems