A NEW DESCENT ALGORITHM FOR SOLVING QUADRATIC BILEVEL PROGRAMMING PROBLEMS

摘要

In this paper, we give a descent algorithm for solving quadratic bilevel programming prob- lems. It is proved that the descent algorithm finds a locally optimal solution to a quadratic bilevel programming problem in a finite number of iterations. Two numerical examples are given to illustrate this algorithm.