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

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 m...

Full description

Bibliographic Details
Main Authors: M. Achache, N. Boudiaf, A. Keraghel
Format: Article
Language:English
Published: Publishing House of the Romanian Academy 2008-02-01
Series:Journal of Numerical Analysis and Approximation Theory
Subjects:
Online Access:https://ictp.acad.ro/jnaat/journal/article/view/870
_version_ 1818474925331054592
author M. Achache
N. Boudiaf
A. Keraghel
author_facet M. Achache
N. Boudiaf
A. Keraghel
author_sort M. Achache
collection DOAJ
description 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.
first_indexed 2024-04-14T04:43:20Z
format Article
id doaj.art-1bb366266a3148aabe26b0b53d499a1a
institution Directory Open Access Journal
issn 2457-6794
2501-059X
language English
last_indexed 2024-04-14T04:43:20Z
publishDate 2008-02-01
publisher Publishing House of the Romanian Academy
record_format Article
series Journal of Numerical Analysis and Approximation Theory
spelling doaj.art-1bb366266a3148aabe26b0b53d499a1a2022-12-22T02:11:33ZengPublishing House of the Romanian AcademyJournal of Numerical Analysis and Approximation Theory2457-67942501-059X2008-02-01371Numerical experiments with two smoothing type-algorithms for nonlinear complementarity problemsM. Achache0N. Boudiaf1A. Keraghel2Université Ferhat Abbas de SétifUniversité El Hadj Lakhdar, BatnaUniversité Ferhat Abbas de SétifIn 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.https://ictp.acad.ro/jnaat/journal/article/view/870nonlinear complementarity problemssmoothing descent-type optimization methodsmerit functions(NCP)-functions
spellingShingle M. Achache
N. Boudiaf
A. Keraghel
Numerical experiments with two smoothing type-algorithms for nonlinear complementarity problems
Journal of Numerical Analysis and Approximation Theory
nonlinear complementarity problems
smoothing descent-type optimization methods
merit functions
(NCP)-functions
title Numerical experiments with two smoothing type-algorithms for nonlinear complementarity problems
title_full Numerical experiments with two smoothing type-algorithms for nonlinear complementarity problems
title_fullStr Numerical experiments with two smoothing type-algorithms for nonlinear complementarity problems
title_full_unstemmed Numerical experiments with two smoothing type-algorithms for nonlinear complementarity problems
title_short Numerical experiments with two smoothing type-algorithms for nonlinear complementarity problems
title_sort numerical experiments with two smoothing type algorithms for nonlinear complementarity problems
topic nonlinear complementarity problems
smoothing descent-type optimization methods
merit functions
(NCP)-functions
url https://ictp.acad.ro/jnaat/journal/article/view/870
work_keys_str_mv AT machache numericalexperimentswithtwosmoothingtypealgorithmsfornonlinearcomplementarityproblems
AT nboudiaf numericalexperimentswithtwosmoothingtypealgorithmsfornonlinearcomplementarityproblems
AT akeraghel numericalexperimentswithtwosmoothingtypealgorithmsfornonlinearcomplementarityproblems