抄録
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, based on smoothing and regularization methods, we propose a concrete algorithm for solving SOCCP. Moreover, we show that our algorithm is globally and quadratically convergent under the monotonicity assumption.
