Solving mathematical programs with complementarity constraints by disjunctive regularizations

Le résumé fourni par la source

We propose a new disjunctive regularization for mathematical programs with complementarity constraints (MPCC). Its feasible set coincides with that of the Kanzow-Schwartz regularization. However, their functional descriptions differ considerably. For the disjunctive regularization, the logical operator OR and equivalent max-type constraints are used. Unlike the Kanzow-Schwartz, the disjunctive regularization satisfies the tailored linear independence constraint qualification if the original MPCC does. More than that, the favorable convergence properties - known to hold for the Kanzow-Schwartz regularization - remain valid for the disjunctive regularization as well. In particular, no second order necessary conditions are required to guarantee convergence towards S-stationary points of MPCC. Additionally, we keep track of the topological type of approximating and limiting nondegenerate C-stationary points in terms of their C-indices. Quadratic and biactive parts of the C-indices are shown to generically correspond to each other while regularizing. This is a new phenomenon as compared to the Scholtes or sign-type regularizations studied before. Numerical experiments illustrate that the proposed disjunctive regularization clearly outperforms the Kanzow-Schwartz regularization. Its numerical performance is even better than that of the Scholtes regularization if solving MPCCs with high accuracy.

Ce résumé expose les affirmations des auteurs. BNTIC ne l’interprète pas comme une validation indépendante des résultats.