Numerical experiments with two smoothing type-algorithms for nonlinear complementarity problems

Authors

  • M. Achache Université Ferhat Abbas de Sétif, Algeria
  • N. Boudiaf Université El Hadj Lakhdar, Batna, Algeria
  • A. Keraghel Université Ferhat Abbas de Sétif, Algeria

DOI:

https://doi.org/10.33993/jnaat371-870

Keywords:

nonlinear complementarity problems, smoothing descent-type optimization methods, merit functions, (NCP)-functions
Abstract views: 226

Abstract

In this paper we deal with the numerical experiments of two smoothing descent-type algorithms for solving nonlinear complementarity problems (NCP). The first algorithm is due to Kanzow and the second one is due to Peng. These algorithms are both based on the reformulation of (NCP) as unconstrained minimization problems by using some smoothing merit functions including the so-called (NCP)-functions. Under suitable conditions they both showed that any stationary point of these problems are solutions of (NCP). For their numerical performances many strategies are used. Finally, these algorithms are applied to some problems of (NCP) found in the literature.

Downloads

Download data is not yet available.

References

Cottle, R.W., Pang, J.S. and Stone, R.E., The linear complementarity problem, Academic press, New York, 1992, https://doi.org/10.1137/1.9780898719000 DOI: https://doi.org/10.1137/1.9780898719000

Harker, P.T. and Pang, J.S., Finite dimensional variational inequality and nonlinear complementarity problems. A survey of theory, algorithms and applications, Mathematical Programming, 48, 1990, https://doi.org/10.1007/bf01582255 DOI: https://doi.org/10.1007/BF01582255

Facchini, F. and Kanzow, C., A nonsmooth inexact Newton method for the solution of a large-scale nonlinear complementarity problems, Mathematical Programming, 76, pp. 493-512, 1997, https://doi.org/10.1007/bf02614395 DOI: https://doi.org/10.1007/BF02614395

Ferris, M.C. and Kanzow, C., Complementarity problem and related problems. A survey., Mathematical Programming Technical Report, pp. 98-17, 1998.

Fukushima, M., Merit functions for variational inequality and complementarity problems., Non-linear Optimization and Applications, G. Di Pillo and F. Giannessi (eds.), Plenum Press, New York, pp. 155-170, 1996, https://doi.org/10.1007/978-1-4899-0289-4_11 DOI: https://doi.org/10.1007/978-1-4899-0289-4_11

Jardin, J.L., Analyse numérique, algorithmes et programmes en Pascal, Dunod, Paris, 1989.

Kanzow, C., Nonlinear complementarity problem as unconstrained optimization, Journal of Optimization theory and applications, 1, 1996, https://doi.org/10.1007/bf02192026 DOI: https://doi.org/10.1007/BF02192026

Karamardian, S., The complementarity problem, Mathematical Programming, 2, 1972, https://doi.org/10.1007/bf01584538 DOI: https://doi.org/10.1007/BF01584538

Mangasarian, O.L. and Solodov, M.V., Nonlinear complementarity as unconstrained and constrained minimization, Mathematical Programming, 62, 1993, https://doi.org/10.1007/bf01585171 DOI: https://doi.org/10.1007/BF01585171

Peng, Ji, Equivalence of variational inequality problems to unconstrained minimization, Mathematical Programming, 78, 1997, https://doi.org/10.1007/bf02614360 DOI: https://doi.org/10.1007/BF02614360

Downloads

Published

2008-02-01

How to Cite

Achache, M., Boudiaf, N., & Keraghel, A. (2008). Numerical experiments with two smoothing type-algorithms for nonlinear complementarity problems. Rev. Anal. Numér. Théor. Approx., 37(1), 3–16. https://doi.org/10.33993/jnaat371-870

Issue

Vol. 37 No. 1 (2008)

Section

Articles

License

Copyright (c) 2015 Journal of Numerical Analysis and Approximation Theory

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Open Access. This article is distributed under the terms of the Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.