点击次数：

论文类型：期刊论文

发表时间：2012-04-01

发表刊物：COMPUTATIONAL OPTIMIZATION AND APPLICATIONS

收录刊物：SCIE、EI

卷号：51

期号：3

页面范围：1037-1063

ISSN号：0926-6003

关键字：Complementarity problem; Second-order cone; Proximal point algorithm; Approximation criterion

摘要：This paper is devoted to the study of the proximal point algorithm for solving monotone second-order cone complementarity problems. The proximal point algorithm is to generate a sequence by solving subproblems that are regularizations of the original problem. After given an appropriate criterion for approximate solutions of subproblems by adopting a merit function, the proximal point algorithm is verified to have global and superlinear convergence properties. For the purpose of solving the subproblems efficiently, we introduce a generalized Newton method and show that only one Newton step is eventually needed to obtain a desired approximate solution that approximately satisfies the appropriate criterion under mild conditions. Numerical comparisons are also made with the derivative-free descent method used by Pan and Chen (Optimization 59:1173-1197, 2010), which confirm the theoretical results and the effectiveness of the algorithm.