A recurrent neural network approach for nonconvex interval quadratic programming

Abstract

In the paper, a new approach is presented to tackle an interval optimization problem with nonconvex interval objective function and affine interval equality and inequality constraints utilizing a recurrent neural network. The approach involves converting the nonconvex interval quadratic programming into a cubic optimization via convex combinations and considering its weight as a decision variable. The recurrent neural network is then established to solve the cubic optimization through subgradient techniques and an exterior penalty function method. Moreover, it is proven that there is a unique global solution to the recurrent neural network, and its trajectory can reach the feasible region in a finite time and remain there. Additionally, it is demonstrated that the trajectory of recurrent neural network converges exponentially or in finite time towards a singleton belonging to the set of critical points of the cubic optimization. This approach is beneficial for interval quadratic programming problems where the weight is unknown or challenging to determine in practical applications. Finally, the effectiveness of this approach is verified through two numerical examples.