Non-Interior Continuation Method for Solving the Monotone Semidefinite Complementarity Problem

Abstract. Recently, Chen and Tseng extended non-interior continuation/ smooth- ing methods for solving linear/ nonlinear complementarity problems to semidefinite complementarity problems (SDCP). In this paper we propose a non-interior continuation method for solving the monotone SDCP based on the smoothed Fischer—Burmeister function, which is shown to be globally linearly and locally quadratically convergent under suitable assumptions. Our algorithm needs at most to solve a linear system of equations at each iteration. In addition, in our analysis on global linear convergence of the algorithm, we need not use the assumption that the Fréchet derivative of the function involved in the SDCP is Lipschitz continuous. For non-interior continuation/ smoothing methods for solving the nonlinear complementarity problem, such an assumption has been used widely in the literature in order to achieve global linear convergence results of the algorithms.

[1]  A. Fischer.  A special newton-type optimization method , 1992 .

[2]  Paul Tseng,et al.  Analysis of Nonsmooth Symmetric-Matrix-Valued Functions with Applications to Semidefinite Complementarity Problems , 2003, SIAM J. Optim..

[3]  Bintong Chen,et al.  A Global Linear and Local Quadratic Noninterior Continuation Method for Nonlinear Complementarity Problems Based on Chen-Mangasarian Smoothing Functions , 1999, SIAM J. Optim..

[4]  Christian Kanzow,et al.  Some Noninterior Continuation Methods for Linear Complementarity Problems , 1996, SIAM J. Matrix Anal. Appl..

[5]  Charles R. Johnson,et al.  Topics in Matrix Analysis , 1991 .

[6]  Masakazu Kojima,et al.  A Predictor-corrector Interior-point Algorithm for the Semidenite Linear Complementarity Problem Using the Alizadeh-haeberly-overton Search Direction , 1996 .

[7]  Song Xu,et al.  A non–interior predictor–corrector path following algorithm for the monotone linear complementarity problem , 2000, Math. Program..

[8]  R. Bhatia.  Matrix Analysis , 1996 .

[9]  Paul Tseng,et al.  Merit functions for semi-definite complemetarity problems , 1998, Math. Program..

[10]  P. Tseng.  Analysis Of A Non-Interior Continuation Method Based On Chen-Mangasarian Smoothing Functions For Com , 1998 .

[11]  Defeng Sun,et al.  Improving the convergence of non-interior point algorithms for nonlinear complementarity problems , 2000, Math. Comput..

[12]  Defeng Sun,et al.  Semismooth Matrix-Valued Functions , 2002, Math. Oper. Res..

[13]  Xiaojun Chen,et al.  A Global Linear and Local Quadratic Continuation Smoothing Method for Variational Inequalities with Box Constraints , 2000, Comput. Optim. Appl..

[14]  M. Fukushima,et al.  A New Merit Function and a Descent Method for Semidefinite Complementarity Problems , 1998 .

[15]  Song Xu,et al.  The global linear convergence of an infeasible non-interior path-following algorithm for complementarity problems with uniform P-functions , 2000, Math. Program..

[16]  Paul Tseng,et al.  Non-Interior continuation methods for solving semidefinite complementarity problems , 2003, Math. Program..