Smoothing Methods for Nonlinear Complementarity Problems
- 527 Downloads
In this paper, we present some new smoothing techniques to solve general nonlinear complementarity problems. Under a weaker condition than monotonicity as on the original problems, we prove convergence of our methods. We also present an error estimate under a general monotonicity condition. Some numerical tests confirm the efficiency of the proposed methods.
KeywordsComplementarity problem Smoothing function Error estimate Trajectory
The authors would like to thank anonymous referees and editors for their kind and helpful remarks and comments. The first author is partially supported by the ANR (Agence Nationale de la Recherche) through HJnet project ANR-12-BS01-0008-01.
- 1.Ferris, M.C., Mangasarian, O.L., Pang, J.-S. (eds.): Complementarity: Applications, Algorithms and Extensions. Papers from the International Conference on Complementarity (ICCP99). Applied Optimization, vol. 50. Kluwer Academic, Dordrecht (2001) Google Scholar
- 8.Ben-Tal, A., Teboulle, M.: A smoothing technique for nondifferentiable optimization problems. In: Dolecki (ed.) Optimization, Lectures Notes in Mathematics, vol. 1405, pp. 1–11. Springer, New York (1989) Google Scholar
- 14.Harker, P.T.: Accelerating the convergence of the diagonalization and projection algorithms for finite-dimensional variational inequalities. Math. Program. 48, 29–59 (1990) Google Scholar
- 15.Facchinei, F., Pang, J.S.: Finite-Dimensional Variational Inequalities and Complementarity Problems, vols. I, II. Springer Series in Operations Research. Springer, New York (2003) Google Scholar