AbstractIn this article, we propose a new smoothing inexact Newton algorithm for solving nonlinear complementarity problems (NCP) base on the smoothed Fischer–Burmeister function. In each iteration, the corresponding linear system is solved only approximately. The global convergence and local superlinear convergence are established without strict complementarity assumption at the NCP solution. Preliminary numerical results indicate that the method is effective for large-scale NCP
Abstract. The mixed complementarity problem can be reformulated as a nonsmooth equation by using the...
It is known that a nonlinear complementarity problem (NCP) can be reformulated as a semismooth syste...
In this paper, by using the smoothing Fischer-Burmeister function, we present a new smoothing conjug...
Based on the smoothing function of penalized Fischer-Burmeister NCP-function, we propose a new smoot...
AbstractIn this article, we propose a new smoothing inexact Newton algorithm for solving nonlinear c...
In this paper, a new improved smoothing Newton algorithm for the nonlinear complementarity problem w...
Abstract. In this paper, we propose a smoothing function to the nonlinear complementarity problem. T...
AbstractWe present a new smoothing Newton method for nonlinear complementarity problems (NCP(F)) by ...
In this paper we take a new look at smoothing Newton methods for solving the nonlinear complementari...
AbstractA new smoothing quasi-Newton method for nonlinear complementarity problems is presented. The...
We present a new algorithm for the solution of general (not necessarily monotone) complementarity pr...
A new algorithm for the solution of large-scale nonlinear complementarity problems is introduced. Th...
AbstractThe nonlinear complementarity problem (denoted by NCP(F)) can be reformulated as the solutio...
AbstractIn this paper, we present a new one-step smoothing Newton method proposed for solving the no...
In this paper, we discuss smoothing approximations of nonsmooth functions arising from complementari...
Abstract. The mixed complementarity problem can be reformulated as a nonsmooth equation by using the...
It is known that a nonlinear complementarity problem (NCP) can be reformulated as a semismooth syste...
In this paper, by using the smoothing Fischer-Burmeister function, we present a new smoothing conjug...
Based on the smoothing function of penalized Fischer-Burmeister NCP-function, we propose a new smoot...
AbstractIn this article, we propose a new smoothing inexact Newton algorithm for solving nonlinear c...
In this paper, a new improved smoothing Newton algorithm for the nonlinear complementarity problem w...
Abstract. In this paper, we propose a smoothing function to the nonlinear complementarity problem. T...
AbstractWe present a new smoothing Newton method for nonlinear complementarity problems (NCP(F)) by ...
In this paper we take a new look at smoothing Newton methods for solving the nonlinear complementari...
AbstractA new smoothing quasi-Newton method for nonlinear complementarity problems is presented. The...
We present a new algorithm for the solution of general (not necessarily monotone) complementarity pr...
A new algorithm for the solution of large-scale nonlinear complementarity problems is introduced. Th...
AbstractThe nonlinear complementarity problem (denoted by NCP(F)) can be reformulated as the solutio...
AbstractIn this paper, we present a new one-step smoothing Newton method proposed for solving the no...
In this paper, we discuss smoothing approximations of nonsmooth functions arising from complementari...
Abstract. The mixed complementarity problem can be reformulated as a nonsmooth equation by using the...
It is known that a nonlinear complementarity problem (NCP) can be reformulated as a semismooth syste...
In this paper, by using the smoothing Fischer-Burmeister function, we present a new smoothing conjug...