A nonfeasible gradient projection recurrent neural network for equality-constrained optimization problems.
In this paper, a recurrent neural network for both convex and nonconvex equality-constrained optimization problems is proposed, which makes use of a cost gradient projection onto the tangent space of the constraints. The proposed neural network constructs a generically nonfeasible trajectory, satisfying the constraints only as t --> infinity. Local convergence results are given that do not assume convexity of the optimization problem to be solved. Global convergence results are established for convex optimization problems. An exponential convergence rate is shown to hold both for the convex case and the nonconvex case. Numerical results indicate that the proposed method is efficient and accurate.
Barbarosou
Maria P
MP
School of Electrical and Computer Engineering, National Technical University of Athens, Athens, Greece.
Maratos
Nicholas G
NG
D000465:Algorithms; D003198:Computer Simulation; D005246:Feedback; D008962:Models, Theoretical; D016571:Neural Networks, Computer; D009716:Numerical Analysis, Computer-Assisted