A one-layer recurrent neural network for constrained nonconvex optimization

Publication Type:
Journal Article
Neural Networks, 2015, 61 pp. 10 - 21
Issue Date:
Filename Description Size
1-s2.0-S0893608014002196-main.pdfPublished Version1.86 MB
Adobe PDF
Full metadata record
© 2014 Elsevier Ltd. In this paper, a one-layer recurrent neural network is proposed for solving nonconvex optimization problems subject to general inequality constraints, designed based on an exact penalty function method. It is proved herein that any neuron state of the proposed neural network is convergent to the feasible region in finite time and stays there thereafter, provided that the penalty parameter is sufficiently large. The lower bounds of the penalty parameter and convergence time are also estimated. In addition, any neural state of the proposed neural network is convergent to its equilibrium point set which satisfies the Karush-Kuhn-Tucker conditions of the optimization problem. Moreover, the equilibrium point set is equivalent to the optimal solution to the nonconvex optimization problem if the objective function and constraints satisfy given conditions. Four numerical examples are provided to illustrate the performances of the proposed neural network.
Please use this identifier to cite or link to this item: