Successfully reported this slideshow.
We use your LinkedIn profile and activity data to personalize ads and to show you more relevant ads. You can change your ad preferences anytime.

A TWO-LAYER RECURRENT NEURAL NETWORK FOR NONSMOOTH CONVEX OPTIMIZATION PROBLEMS

175 views

Published on

I3E Technologies,
#23/A, 2nd Floor SKS Complex,
Opp. Bus Stand, Karur-639 001.

IEEE PROJECTS AVAILABLE,
NON-IEEE PROJECTS AVAILABLE,
APPLICATION BASED PROJECTS AVAILABLE,
MINI-PROJECTS AVAILABLE.

Mobile : 99436 99916, 99436 99926, 99436 99936

Mail ID: i3eprojectskarur@gmail.com

Web: www.i3etechnologies.com, www.i3eprojects.com

Published in: Engineering
  • Be the first to comment

  • Be the first to like this

A TWO-LAYER RECURRENT NEURAL NETWORK FOR NONSMOOTH CONVEX OPTIMIZATION PROBLEMS

  1. 1. A TWO-LAYER RECURRENT NEURAL NETWORK FOR NONSMOOTH CONVEX OPTIMIZATION PROBLEMS ABSTRACT In this paper, a two-layer recurrent neural network is proposed to solve the non smooth convex optimization problem subject to convex inequality and linear equality constraints. Compared with existing neural network models, the proposed neural network has a low model complexity and avoids penalty parameters. It is proved that from any initial point, the state of the proposed neural network reaches the equality feasible region in finite time and stays there thereafter. Moreover, the state is unique if the initial point lies in the equality feasible region. The equilibrium point set of the proposed neural network is proved to be equivalent to the Karush–Kuhn–Tucker optimality set of the original optimization problem. It is further proved that the equilibrium point of the proposed neural network is stable in the sense of Lyapunov. Moreover, from any initial point, the state is proved to be convergent to an equilibrium point of the proposed neural network. Finally, as applications, the proposed neural network is used to solve nonlinear convex programming with linear constraints and L1-norm minimization problems.

×