A one-layer recurrent neural network for solving pseudoconvex optimization with box set constraints

DOI10.1155/2014/283092zbMath1407.90266OpenAlexW1983293521WikidataQ59065400 ScholiaQ59065400MaRDI QIDQ1718034

Huaiqin Wu, Rong Yao, Ruoxia Li, Xiaowei Zhang

Publication date: 8 February 2019

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/283092

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• A one-layer recurrent neural network for constrained pseudoconvex optimization and its application for dynamic portfolio optimization
• A deterministic annealing neural network for convex programming
• Application of projection neural network in solving convex programming problems
• A Dynamical Approach to Constrained Nonsmooth Convex Minimization Problem Coupling with Penalty Function Method in Hilbert Space
• Optimization and nonsmooth analysis
• Analysis and design of a recurrent neural network for linear programming
• Neural Network for Solving Constrained Convex Optimization Problems With Global Attractivity
• A projection neural network and its application to constrained optimization problems
• Dynamical Behaviors of Delayed Neural Network Systems with Discontinuous Activation Functions

This page was built for publication: A one-layer recurrent neural network for solving pseudoconvex optimization with box set constraints