Abstract
In this paper we present that solution of convex programming problems is equivalent with solution of projection formulation, then we introduce neural network models for solving projection formulation and analysis stability conditions and convergence. Simulation shows that the introduced neural network is effective in solving convex programming problems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have