Abstract
To solve nonlinear complementarity problems (NCP), at each iteration, the classical proximal point algorithm solves a well-conditioned sub-NCP while the Logarithmic-Quadratic Proximal (LQP) method solves a system of nonlinear equations (LQP system). This paper presents a practical LQP method-based prediction-correction method for NCP. The predictor is obtained via solving the LQP system approximately under significantly relaxed restriction, and the new iterate (the corrector) is computed directly by an explicit formula derived from the original LQP method. The implementations are very easy to be carried out. Global convergence of the method is proved under the same mild assumptions as the original LQP method. Finally, numerical results for traffic equilibrium problems are provided to verify that the method is effective for some practical problems.
Original language | English |
---|---|
Pages (from-to) | 33-44 |
Number of pages | 12 |
Journal | Journal of Computational Mathematics |
Volume | 24 |
Issue number | 1 |
Publication status | Published - Jan 2006 |
Scopus Subject Areas
- Computational Mathematics
User-Defined Keywords
- Logarithmic-Quadratic proximal method
- Nonlinear complementarity problems
- Prediction-correction
- Inexact criterion