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...
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 |
Similar Items
-
Numerical experiments with two smoothing type-algorithms for nonlinear complementarity problems
by: M. Achache, et al.
Published: (2008-02-01) -
Novel Global Harmony Search Algorithm for General Linear Complementarity Problem
by: Longquan Yong
Published: (2022-07-01) -
A local Jacobian smoothing method for solving Nonlinear Complementarity Problems
by: Favián Arenas, Héctor Jairo Martínez, Rosana Pérez
Published: (2020-05-01) -
A smoothing Levenberg-Marquardt algorithm for linear weighted complementarity problem
by: Panjie Tian, et al.
Published: (2023-02-01) -
A new smoothing method for solving nonlinear complementarity problems
by: Zhu Jianguang, et al.
Published: (2019-03-01)