Access the full text.
Sign up today, get DeepDyve free for 14 days.
A. Fischer (1992)
A special newton-type optimization methodOptimization, 24
C. Kanzow (1996)
Some Noninterior Continuation Methods for Linear Complementarity ProblemsSIAM J. Matrix Anal. Appl., 17
R. Horn, Charles Johnson (1991)
Topics in Matrix Analysis
R. Bhatia (1996)
Matrix Analysis
Xin Chen, P. Tseng (2003)
Non-Interior continuation methods for solving semidefinite complementarity problemsMathematical Programming, 95
Song Xu (2000)
The global linear convergence of an infeasible non-interior path-following algorithm for complementarity problems with uniform P-functionsMathematical Programming, 87
P. Tseng (1998)
Analysis Of A Non-Interior Continuation Method Based On Chen-Mangasarian Smoothing Functions For Com
Bintong Chen, N. Xiu (1999)
A Global Linear and Local Quadratic Noninterior Continuation Method for Nonlinear Complementarity Problems Based on Chen-Mangasarian Smoothing FunctionsSIAM J. Optim., 9
L. Qi, Defeng Sun (2000)
Improving the convergence of non-interior point algorithms for nonlinear complementarity problemsMath. Comput., 69
Defeng Sun, Jie Sun (2002)
Semismooth Matrix-Valued FunctionsMath. Oper. Res., 27
N. Yamashita, M. Fukushima (1998)
A New Merit Function and a Descent Method for Semidefinite Complementarity Problems
Xin Chen, H. Qi, P. Tseng (2003)
Analysis of Nonsmooth Symmetric-Matrix-Valued Functions with Applications to Semidefinite Complementarity ProblemsSIAM J. Optim., 13
J. Burke, Song Xu (2000)
A non–interior predictor–corrector path following algorithm for the monotone linear complementarity problemMathematical Programming, 87
M. Kojima, M. Shida, Susumu Shindoh (1999)
A Predictor-Corrector Interior-Point Algorithm for the Semidefinite Linear Complementarity Problem Using the Alizadeh-Haeberly-Overton Search DirectionSIAM J. Optim., 9
Bintong Chen, Xiaojun Chen (2000)
A Global Linear and Local Quadratic Continuation Smoothing Method for Variational Inequalities with Box ConstraintsComputational Optimization and Applications, 17
P. Tseng (1998)
Merit functions for semi-definite complemetarity problemsMathematical Programming, 83
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.
Applied Mathematics and Optimization – Springer Journals
Published: May 21, 2003
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.