Some equation-based methods for the nonlinear complementarity problem
- 1 January 1994
- journal article
- research article
- Published by Taylor & Francis in Optimization Methods and Software
- Vol. 3 (4), 327-340
- https://doi.org/10.1080/10556789408805573
Abstract
We present some methods for solving the nonlinear complementarity problem (NCP). These methods are based on a characterization of NCP consisting of a (usually differentiable) system of nonlinear equations. In particular, we present a decomposition of the linear system which arises at each iteration of Newton's method. Finally, some preliminary numerical results are given.Keywords
This publication has 10 references indexed in Scilit:
- Gauss-Newton methods for the complementarity problemJournal of Optimization Theory and Applications, 1993
- A special newton-type optimization methodOptimization, 1992
- A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problemsMathematical Programming, 1991
- Newton's method for the nonlinear complementarity problem: A B-differentiable equation approachMathematical Programming, 1990
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applicationsMathematical Programming, 1990
- An algorithm based on a sequence of linear complementarity problems applied to a walrasian equilibrium model: An exampleMathematical Programming, 1987
- A Quasi-Newton method with modification of one column per iterationComputing, 1984
- Note on the equivalence of Kuhn-Tucker complementarity conditions to an equationJournal of Optimization Theory and Applications, 1982
- Solving the Nonlinear Complementarity Problem by a Homotopy MethodSIAM Journal on Control and Optimization, 1979
- Equivalence of the Complementarity Problem to a System of Nonlinear EquationsSIAM Journal on Applied Mathematics, 1976