A recurrent neural network for solving a class of generalized convex optimization problems
From MaRDI portal
Publication:459437
DOI10.1016/J.NEUNET.2013.03.010zbMATH Open1296.90088OpenAlexW2067811671WikidataQ46125443 ScholiaQ46125443MaRDI QIDQ459437FDOQ459437
Authors: Alireza Hosseini, Jun Wang, S. Mohammad Hosseini 
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
Recommendations
- A non-penalty recurrent neural network for solving a class of constrained optimization problems
- A one-layer recurrent neural network for constrained nonconvex optimization
- Neural network for nonsmooth pseudoconvex optimization with general convex constraints
- Efficient recurrent neural network model for the solution of general nonlinear optimization problems
- A one-layer recurrent neural network for solving pseudoconvex optimization with box set constraints
nonsmooth optimizationdifferential inclusionpseudoconvexityrecurrent neural networksgeneralized convex
Learning and adaptive systems in artificial intelligence (68T05) Convex programming (90C25) Neural networks for/in biological studies, artificial life and related topics (92B20)
Cites Work
- Title not available (Why is that?)
- Optimization and nonsmooth analysis
- Title not available (Why is that?)
- The origins of quasi-concavity: a development between mathematics and economics.
- A one-layer recurrent neural network for constrained pseudoconvex optimization and its application for dynamic portfolio optimization
- Generalized Neural Network for Nonsmooth Nonlinear Programming Problems
- Handbook of mathematical economics. Vol. I
- A recurrent neural network with exponential convergence for solving convex quadratic program and related linear piecewise equations
- A deterministic annealing neural network for convex programming
- Some extensions of nonconvex economic modeling: invexity, quasimax, and new stability conditions
- 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
- Generalized gradient projection neural networks for nonsmooth optimization problems
Cited In (33)
- A neurodynamic approach to convex optimization problems with general constraint
- Reliable asynchronous sampled-data filtering of T-S fuzzy uncertain delayed neural networks with stochastic switched topologies
- Radial basis function neural network (RBFNN) approximation of Cauchy inverse problems of the Laplace equation
- Non-fragile memory filtering of T-S fuzzy delayed neural networks based on switched fuzzy sampled-data control
- Efficient recurrent neural network model for the solution of general nonlinear optimization problems
- New reliable nonuniform sampling control for uncertain chaotic neural networks under Markov switching topologies
- An Interior Point Recurrent Neural Network for Convex Optimization Problems
- Stochastic switched sampled-data control for synchronization of delayed chaotic neural networks with packet dropout
- Cardinality-constrained portfolio selection based on collaborative neurodynamic optimization
- A neurodynamic optimization approach to supervised feature selection via fractional programming
- Some novel approaches on state estimation of delayed neural networks
- A neurodynamic approach to nonsmooth constrained pseudoconvex optimization problem
- A discrete-time neurodynamic approach to sparsity-constrained nonnegative matrix factorization
- A novel growing wavelet neural network algorithm for solving chemotaxis systems with blow‐up
- Neural network for solving convex quadratic bilevel programming problems
- A one-layer recurrent neural network for constrained nonconvex optimization
- Neural network for solving Nash equilibrium problem in application of multiuser power control
- A one-layer recurrent neural network for constrained nonsmooth invex optimization
- A non-penalty recurrent neural network for solving a class of constrained optimization problems
- Recurrent neutral network for solving the generalized eigenvalue problem
- A neurodynamic optimization approach for complex-variables programming problem
- Discrete-time Zhang neural networks for time-varying nonlinear optimization
- Neural network for stochastic multi-objective optimization problems
- A collective neurodynamic optimization approach to bound-constrained nonconvex optimization
- Neural network for nonsmooth pseudoconvex optimization with general convex constraints
- An augmented Lagrangian method for training recurrent neural networks
- A one-layer recurrent neural network for non-smooth convex optimization subject to linear inequality constraints
- A class of neural networks for solving optimization problems with global attractivity
- A simplified recurrent neural network for pseudoconvex optimization subject to linear equality constraints
- Recurrent neural network model based on projective operator and its application to optimization problems
- A Cooperative Recurrent Neural Network for Solving L1 Estimation Problems with General Linear Constraints
- A one-layer recurrent neural network for solving pseudoconvex optimization with box set constraints
- A Novel Recurrent Neural Network with Finite-Time Convergence for Linear Programming
This page was built for publication: A recurrent neural network for solving a class of generalized convex optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q459437)
