The weighted complementarity problem (denoted by WCP) significantly extends the general
complementarity problem and can be used for modeling a larger class of problems from …

This paper considers the linear weighted complementarity problem (denoted by LWCP)
introduced by Potra (SIAM J Optim 22: 1634–1654, 2012). Based on two weighted …

In this paper, we present a new class of polynomial interior point algorithms for the Cartesian
P-matrix linear complementarity problem over symmetric cones based on a parametric …

In this paper, we investigate a smoothing-type algorithm with a nonmonotone line search for
solving a system of equalities and inequalities. We prove that the nonmonotone algorithm is …

In this paper we consider the nonlinear complementarity problem over circular cones
(CCNCP) which contains a lot of circular cone optimization problems. We study a one …

Recently, the study of symmetric cone complementarity problems has been a hot topic in the
literature. Many numerical methods have been proposed for solving such a class of …

In this paper, we present a new polynomial interior-point algorithm for the monotone linear
complementarity problem over symmetric cones by employing the framework of Euclidean …

The P-property of the linear transformation in second-order cone linear complementarity
problems (SOCLCP) plays an important role in checking the globally uniquely solvable …

The system of generalized absolute value equations (GAVE) has attracted more and more
attention in the optimization community. In this paper, by introducing a smoothing function …

The circular cone programming (CCP) problem is to minimize or maximize a linear function
over the intersection of an affine space with the Cartesian product of circular cones. In this …