Neural network for solving convex quadratic bilevel programming problems. Academic Article uri icon


  • In this paper, using the idea of successive approximation, we propose a neural network to solve convex quadratic bilevel programming problems (CQBPPs), which is modeled by a nonautonomous differential inclusion. Different from the existing neural network for CQBPP, the model has the least number of state variables and simple structure. Based on the theory of nonsmooth analysis, differential inclusions and Lyapunov-like method, the limit equilibrium points sequence of the proposed neural networks can approximately converge to an optimal solution of CQBPP under certain conditions. Finally, simulation results on two numerical examples and the portfolio selection problem show the effectiveness and performance of the proposed neural network.

published proceedings

  • Neural Netw

author list (cited authors)

  • He, X., Li, C., Huang, T., & Li, C.

citation count

  • 44

complete list of authors

  • He, Xing||Li, Chuandong||Huang, Tingwen||Li, Chaojie

publication date

  • March 2014