. In this paper we reformulate several NCP-functions for the nonlinear complementarity problem (NCP) from their merit function forms and study some important properties of these NCP-functions. We point out that some of these NCP-functions have all the nice properties investigated by Chen, Chen and Kanzow [2] for a modified Fischer-Burmeister function, while some other NCP-functions may lose one or several of these properties. We also provide a modified normal map and a smoothing technique to overcome the limitation of these NCP-functions. A numerical comparison for the behaviour of various NCP-functions is provided. Keywords: nonlinear complementarity problem, NCP-function, normal map, smoothing A tribute to Olvi from Liqun Qi Olvi was on...
A bounded-level-set result for a reformulation of the box-constrained variational inequality problem...
We present a new algorithm for the solution of general (not necessarily monotone) complementarity pr...
Based on NCP functions, we present a Lagrangian globalization (LG) algorithm model for solving the n...
Abstract In last decades, there has been much effort on the solution and the analysis of the nonline...
In this paper we deal with the numerical experiments of two smoothing descent-type algorithms for so...
Abstract In this paper, we propose a new family of NCP-functions and the corresponding merit functio...
AbstractIn this paper, we propose a new family of NCP-functions and the corresponding merit function...
Abstract: We introduce a new, one-parametric class of NCP-functions. This class subsumes the Fischer...
It is known that a nonlinear complementarity problem (NCP) can be reformulated as a semismooth syste...
AbstractIn the paper [J.-S. Chen, S. Pan, A family of NCP-functions and a descent method for the non...
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)Conselho Nacional de Desenvolvimento Ci...
Cataloged from PDF version of article.In a recent paper by Chen and Mangasarian (C. Chen, O.L. Manga...
In this paper we take a new look at smoothing Newton methods for solving the nonlinear complementari...
AbstractIn this article, we propose a new smoothing inexact Newton algorithm for solving nonlinear c...
. Recently, much eort has been made in solving and analyzing the nonlinear complementarity problem (...
A bounded-level-set result for a reformulation of the box-constrained variational inequality problem...
We present a new algorithm for the solution of general (not necessarily monotone) complementarity pr...
Based on NCP functions, we present a Lagrangian globalization (LG) algorithm model for solving the n...
Abstract In last decades, there has been much effort on the solution and the analysis of the nonline...
In this paper we deal with the numerical experiments of two smoothing descent-type algorithms for so...
Abstract In this paper, we propose a new family of NCP-functions and the corresponding merit functio...
AbstractIn this paper, we propose a new family of NCP-functions and the corresponding merit function...
Abstract: We introduce a new, one-parametric class of NCP-functions. This class subsumes the Fischer...
It is known that a nonlinear complementarity problem (NCP) can be reformulated as a semismooth syste...
AbstractIn the paper [J.-S. Chen, S. Pan, A family of NCP-functions and a descent method for the non...
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)Conselho Nacional de Desenvolvimento Ci...
Cataloged from PDF version of article.In a recent paper by Chen and Mangasarian (C. Chen, O.L. Manga...
In this paper we take a new look at smoothing Newton methods for solving the nonlinear complementari...
AbstractIn this article, we propose a new smoothing inexact Newton algorithm for solving nonlinear c...
. Recently, much eort has been made in solving and analyzing the nonlinear complementarity problem (...
A bounded-level-set result for a reformulation of the box-constrained variational inequality problem...
We present a new algorithm for the solution of general (not necessarily monotone) complementarity pr...
Based on NCP functions, we present a Lagrangian globalization (LG) algorithm model for solving the n...