Some Noninterior Continuation Methods for Linear Complementarity Problems
- 1 October 1996
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 17 (4) , 851-868
- https://doi.org/10.1137/s0895479894273134
Abstract
We introduce some new path-following methods for the solution of the linear complementarity problem. We call these methods noninterior continuation methods since, in contrast to interior-point methods, not all iterates have to stay in the positive orthant. This is possible since we reformulate certain perturbed complementarity problems as a nonlinear system of equations. However, similar to interior-point methods, we also try to follow the central path. We present some conditions which guarantee the existence of this central path, prove a global convergence result for some implementable noninterior continuation methods, and report some numerical results obtained with these methods. We also prove global error bound results for the perturbed linear complernentarity problems.Keywords
This publication has 28 references indexed in Scilit:
- A New Merit Function For Nonlinear Complementarity Problems And A Related AlgorithmSIAM Journal on Optimization, 1997
- An NCP–Function and its Use for the Solution of Complementarity ProblemsPublished by World Scientific Pub Co Pte Ltd ,1995
- A Newton-type method for positive-semidefinite linear complementarity problemsJournal of Optimization Theory and Applications, 1995
- Testing a New Class of Algorithms for Nonlinear Complementarity ProblemsPublished by Springer Nature ,1995
- On the local superlinear convergence of a Newton-type method for LCP under weak conditionsOptimization Methods and Software, 1995
- A Non-Interior-Point Continuation Method for Linear Complementarity ProblemsSIAM Journal on Matrix Analysis and Applications, 1993
- A special newton-type optimization methodOptimization, 1992
- Theoretical efficiency of a shifted-barrier-function algorithm for linear programmingLinear Algebra and its Applications, 1991
- A note onQ-matricesMathematical Programming, 1979
- Computational complexity of LCPs associated with positive definite symmetric matricesMathematical Programming, 1979