New Starting Point of the Continuous Hopfield Network

In recent years, the continuous Hopfield network has become the most required tool to solve quadratic problems (QP). But, it suffers from some drawbacks, such as, the initial states. This later affect the convergence to the optimal solution and if a bad starting point is arbitrarily specified, the infeasible solution is generated. In this paper, we examine this issue and try to provide a new technique to choose a good starting point in order to give a good optimal solution for any quadratic problems (QP). Numerical simulations are provided to demonstrate the performance of this new technique applied to task assignment problems.