Abstract

A neural network model is constructed on the basis of the duality theory, optimization theory, convex analysis theory and Lyapunov stability theory to solve convex second-order cone programming (CSOCP) problems. According to Karush-Kuhn-Tucker conditions of convex optimization, the equilibrium point of the proposed neural network is proved to be equivalent to the optimal solution of the CSOCP problem. By employing Lyapunov function approach, it is also shown that the presented neural network model is stable in the sense of Lyapunov and it is globally convergent to an exact optimal solution of the original optimization problem. Simulation results show that the neural network is feasible and efficient.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call