Inexact sequential injective algorithm for weakly univalent vector equation and its application to regularized smoothing Newton algorithm for mixed second-order cone complementarity problems

Abstract

It is known that the complementarity problems and the variational inequality problems are reformulated equivalently as a vector equation by using the natural residual or Fischer-Burmeister function. In this paper, we first propose an inexact sequential injective algorithm (ISIA) for a vector equation, and show the global convergence under weak univalence assumption. Roughly speaking, the ISIA generates the sequence of inexact solutions of approximate vector equations, which consist of the injectives converging to the original vector-valued function. Although the ISIA is simple and conceptual, it can be a prototype to many other algorithms such as a smoothing Newton algorithm, semismooth Newton algorithm, etc. Next, we apply the ISIA prototype to the regularized smoothing Newton algorithm (ReSNA) for mixed second-order cone complementarity problems (MSOCCPs). Exploiting the ISIA convergence scheme, we prove that the ReSNA is globally convergent under Cartesian \begin{document}$ P_0 $\end{document} assumption.