| Abstrakt: |
Abstract: There has been much interest in studying symmetric cone complementarity problems. In this paper, we study the circular cone complementarity problem (denoted by CCCP) which is a type of nonsymmetric cone complementarity problem. We first construct two smoothing functions for the CCCP and show that they are all coercive and strong semismooth. Then we propose a smoothing algorithm to solve the CCCP. The proposed algorithm generates an infinite sequence such that the value of the merit function converges to zero. Moreover, we show that the iteration sequence must be bounded if the solution set of the CCCP is nonempty and bounded. At last, we prove that the proposed algorithm has local superlinear or quadratical convergence under some assumptions which are much weaker than Jacobian nonsingularity assumption. Some numerical results are reported which demonstrate that our algorithm is very effective for solving CCCPs. |
Full text from SpringerLink