Abstract

In this paper, we propose a globally and quadratically convergent Newton-type algorithm for solving monotone second-order cone complementarity problems (denoted by SOCCPs). This algorithm is based on smoothing and regularization techniques by incorporating smoothing Newton’s method. Many Newton-type methods with smoothing and regularization techniques have been studied for solving nonlinear complementarity problems (NCPs) and box constrained variational inequalities (BVIs). Our algorithm is regarded as an extension of those methods to SOCCP. However, it is different from the existing methods, because we solve SOCCP by treating both the smoothing parameter μ and the regularization parameter ε as independent variables. In addition, numerical experiments indicate that the proposed method is quite effective.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call