No abstract

In last decades, there has been much effort on the solution and the analysis of the nonlinear complementarity problem (NCP) by reformulating NCP as an unconstrained minimization involving an NCP function. In this paper, we propose a family of new NCP functions, which include the Fischer-Burmeister function as a special case, based on a p-norm with p being any fixed real number in the interval (1, +∞), and show several favorable properties of the proposed functions. In addition, we also propose a descent algorithm that is indeed derivative-free for solving the unconstrained minimization based on the merit functions from the proposed NCP functions. Numerical results for the test problems from MCPLIB indicate that the descent algorithm has better performance when the parameter p decreases in (1, +∞). This implies that the merit functions associated with p ∈ (1, 2), for example p = 1.5, are more effective in numerical computations than the Fischer-Burmeister merit function, which exactly corresponds to p = 2.

No abstract

No abstract

MSC: 90C33 90C56 65K10Keywords: Complementarity problem NCP-function Merit function Derivative free algorithm a b s t r a c tIn this paper, we propose a new family of NCP-functions and the corresponding merit functions, which are the generalization of some popular NCP-functions and the related merit functions. We show that the new NCP-functions and the corresponding merit functions possess a system of favorite properties. Specially, we show that the new NCPfunctions are strongly semismooth, Lipschitz continuous, and continuously differentiable; and that the corresponding merit functions have SC 1 property (i.e., they are continuously differentiable and their gradients are semismooth) and LC 1 property (i.e., they are continuously differentiable and their gradients are Lipschitz continuous) under suitable assumptions. Based on the new NCP-functions and the corresponding merit functions, we investigate a derivative free algorithm for the nonlinear complementarity problem and discuss its global convergence. Some preliminary numerical results are reported.

No abstract

No abstract

Abstract. In this paper, we extend the one-parametric class of merit functions proposed by Kanzow and Kleinmichel [14] for the nonnegative orthant complementarity problem to the general symmetric cone complementarity problem (SCCP). We show that the class of merit functions is continuously differentiable everywhere and has a globally Lipschitz continuous gradient mapping. From this, we particularly obtain the smoothness of the Fischer-Burmeister merit function associated with symmetric cones and the Lipschitz continuity of its gradient. In addition, we also consider a regularized formulation for the class of merit functions which is actually an extension of one of the NCP function classes studied by [18] to the SCCP. By exploiting the Cartesian P -properties for a nonlinear transformation, we show that the class of regularized merit functions provides a global error bound for the solution of the SCCP, and moreover, has bounded level sets under a rather weak condition which can be satisfied by the monotone SCCP with a strictly feasible point or the SCCP with the joint Cartesian R 02 -property. All of these results generalize some recent important works in [4,25,28] under a unified framework.