求解一类MPEC问题的序列束方法

In this paper we consider a convex MPEC problem with a nondifferentiable convex objective function and constraints separable in two variable vectors whose second variable vector belongs to the set of optimal solutions of the constraint problem. A sequential bundle method for dealing with this kind of problem is presented. It is constructed by combining a proximal bundle method due to Hintermuller (2001) and a descent proximal level bundle method due to Brannlund, Kiwiel and Lindberg (1995). The first bundle method is used to provide a starting point at the beginning of each iteration of the sequential iterate process and the second one is used to find an (approximate) optimal solution of the constraint problem at each iteration of the sequential iterate process. The convergence analysis given in the last section shows that under some conditions the algorithm presented can terminate at an approximate solution in finite steps according to a given tolerance error.