A recurrent neural network for nonlinear continuously differentiable optimization over a compact convex subset

• Published in: IEEE transaction on neural networks and learning systems 2001-11, Vol.12 (6), p.1487-1490
• Main Author: Liang, X B
• Format: Article
• Language: English
• Subjects: Algorithms; Constraint optimization; Convergence; Hardware; Mathematical programming; Neural networks; Numerical simulation; Parallel programming; Quadratic programming; Recurrent neural networks; Studies
• ISSN: 1045-9227; 2162-237X; 1941-0093; 2162-2388
• DOI: 10.1109/72.963784

We propose a general recurrent neural-network (RNN) model for nonlinear optimization over a nonempty compact convex subset which includes the bound subset and spheroid subset as special cases. It is shown that the compact convex subset is a positive invariant and attractive set of the RNN system and that all the network trajectories starting from the compact convex subset converge to the equilibrium set of the RNN system. The above equilibrium set of the RNN system coincides with the optimum set of the minimization problem over the compact convex subset when the objective function is convex. The analysis of these qualitative properties for the RNN model is conducted by employing the properties of the projection operator of Euclidean space onto the general nonempty closed convex subset. A numerical simulation example is also given to illustrate the qualitative properties of the proposed general RNN model for solving an optimization problem over various compact convex subsets.