A one-layer recurrent neural network for constrained nonsmooth invex optimization
DOI10.1016/J.NEUNET.2013.11.007zbMATH Open1298.90077DBLPjournals/nn/LiYW14OpenAlexW4248996067WikidataQ51137309 ScholiaQ51137309MaRDI QIDQ470180FDOQ470180
Authors: Guocheng Li, Zheng Yan, Jun Wang 
Publication date: 12 November 2014
Published in: Neural Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.neunet.2013.11.007
Recommendations
- A one-layer recurrent neural network for constrained nonconvex optimization
- Neural network for nonsmooth pseudoconvex optimization with general convex constraints
- A one-layer recurrent neural network for non-smooth convex optimization subject to linear inequality constraints
- A one-layer recurrent neural network for solving pseudoconvex optimization with box set constraints
- A recurrent neural network for solving a class of generalized convex optimization problems
Nonconvex programming, global optimization (90C26) Neural networks for/in biological studies, artificial life and related topics (92B20)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
- On sufficiency of the Kuhn-Tucker conditions
- What is invexity?
- ``Neural computation of decisions in optimization problems
- Fractional Programming
- A one-layer recurrent neural network for constrained pseudoconvex optimization and its application for dynamic portfolio optimization
- Lagrange programming neural networks
- A dynamic system model for solving convex nonlinear optimization problems
- Generalized Neural Network for Nonsmooth Nonlinear Programming Problems
- A projection neural network and its application to constrained optimization problems
- Title not available (Why is that?)
- An analysis of a class of neural networks for solving linear programming problems
- A deterministic annealing neural network for convex programming
- Generalized convexity of functions and generalized monotonicity of set-valued maps
- Analysis and design of a recurrent neural network for linear programming
- A recurrent neural network for solving a class of generalized convex optimization problems
- Generalized gradient projection neural networks for nonsmooth optimization problems
Cited In (15)
- A neurodynamic approach to convex optimization problems with general constraint
- An Interior Point Recurrent Neural Network for Convex Optimization Problems
- Neural network for a class of sparse optimization with \(L_0\)-regularization
- Cardinality-constrained portfolio selection based on collaborative neurodynamic optimization
- A neurodynamic optimization approach to supervised feature selection via fractional programming
- Sparse signal reconstruction via collaborative neurodynamic optimization
- A collaborative neurodynamic approach to global and combinatorial optimization
- A neurodynamic approach to nonsmooth constrained pseudoconvex optimization problem
- A one-layer recurrent neural network for constrained nonconvex optimization
- A non-penalty recurrent neural network for solving a class of constrained optimization problems
- A nonnegative matrix factorization algorithm based on a discrete-time projection neural network
- A collective neurodynamic optimization approach to bound-constrained nonconvex optimization
- A one-layer recurrent neural network for nonsmooth pseudoconvex optimization with quasiconvex inequality and affine equality constraints
- Invex programming problems with equality and inequality constraints
- A one-layer recurrent neural network for solving pseudoconvex optimization with box set constraints
This page was built for publication: A one-layer recurrent neural network for constrained nonsmooth invex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q470180)
