A one-layer recurrent neural network for constrained pseudoconvex optimization and its application for dynamic portfolio optimization

Qingshan Liu, Zhishan Guo, Jun Wang

Research output: Contribution to journalArticlepeer-review

122 Citations (Scopus)

Abstract

In this paper, a one-layer recurrent neural network is proposed for solving pseudoconvex optimization problems subject to linear equality and bound constraints. Compared with the existing neural networks for optimization (e.g., the projection neural networks), the proposed neural network is capable of solving more general pseudoconvex optimization problems with equality and bound constraints. Moreover, it is capable of solving constrained fractional programming problems as a special case. The convergence of the state variables of the proposed neural network to achieve solution optimality is guaranteed as long as the designed parameters in the model are larger than the derived lower bounds. Numerical examples with simulation results illustrate the effectiveness and characteristics of the proposed neural network. In addition, an application for dynamic portfolio optimization is discussed.

Original languageEnglish
Pages (from-to)99-109
Number of pages11
JournalNeural Networks
Volume26
DOIs
Publication statusPublished - Feb 2012
Externally publishedYes

Keywords

  • Convergence
  • Differential inclusion
  • Lyapunov function
  • Pseudoconvex optimization
  • Recurrent neural networks

Fingerprint

Dive into the research topics of 'A one-layer recurrent neural network for constrained pseudoconvex optimization and its application for dynamic portfolio optimization'. Together they form a unique fingerprint.

Cite this