A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems

The Second-Order Cone Complementarity Problem (SOCCP) is a wide class of problems containing the Nonlinear Complementarity Problem (NCP) and the Second-Order Cone Programming Problem (SOCP). Recently, Fukushima, Luo and Tseng extended some merit functions and their smoothing functions for NCP to SOCCP. Moreover, they derived computable formulas for the Jacobians of the smoothing functions and gave conditions for the Jacobians to be invertible. In this paper, we propose a globally and quadratically convergent algorithm, which is based on smoothing and regularization methods, for solving monotone SOCCP. In particular, we study strong semismoothness and Jacobian consistency, which play an important role in establishing quadratic convergence of the algorithm. Furthermore, we examine e#ectiveness of the algorithm by means of numerical experiments. Key words. second-order cone, complementarity problem, smoothing method, regularization method AMS subject classifications. 90C33, 65K05