Add to ORKGIn this paper we introduce a general line search scheme which easily allows us to define and analyze known and new semismooth algorithms for the solution of nonlinear complementarity problems. We enucleate the basic assumptions that a reach direction to be used in the general scheme has to enjoy in order to guarantee global convergence, local superlinear/quadratic convergence or finite convergence. We examine in detail several different semismooth algorithms and compare their theoretical features and their practical behavior on a set of large-scale problems
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...
Abstract. In this paper we study a special kind of optimization problems with linear comple-mentarit...
International audienceIn this paper we introduce a general line search scheme which easily allows us...
: In this paper we introduce a general line search scheme which easily allows us to define and analy...
In this paper, we propose a Newton-type method for solving a semismooth reformulation of monotone co...
Complementarity solvers are continually being challenged by modelers demanding improved reliability ...
Recent improvements in the capabilities of complementarity solvers have led to an increased interest...
A family of Least-Change Secant-Update methods for solving nonlinear complementarity problems based ...
We investigates the theoretical and numerical properties of two global optimization techniques for t...
As a complement of our recent article [O. Stein and A. Tezel, J. Global Optim., 41 (2008), pp. 245-2...
A new algorithm for the solution of large-scale nonlinear complementarity problems is introduced. Th...
Semismooth Newton methods constitute a major research area for solving mixed complementarity problem...
Global methods for nonlinear complementarity problems formulate the problem as a system of nonsmooth...
Abstract. Recently, based upon the Chen-Harker-Kanzow-Smale smoothing function and the trajectory an...
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...
Abstract. In this paper we study a special kind of optimization problems with linear comple-mentarit...
International audienceIn this paper we introduce a general line search scheme which easily allows us...
: In this paper we introduce a general line search scheme which easily allows us to define and analy...
In this paper, we propose a Newton-type method for solving a semismooth reformulation of monotone co...
Complementarity solvers are continually being challenged by modelers demanding improved reliability ...
Recent improvements in the capabilities of complementarity solvers have led to an increased interest...
A family of Least-Change Secant-Update methods for solving nonlinear complementarity problems based ...
We investigates the theoretical and numerical properties of two global optimization techniques for t...
As a complement of our recent article [O. Stein and A. Tezel, J. Global Optim., 41 (2008), pp. 245-2...
A new algorithm for the solution of large-scale nonlinear complementarity problems is introduced. Th...
Semismooth Newton methods constitute a major research area for solving mixed complementarity problem...
Global methods for nonlinear complementarity problems formulate the problem as a system of nonsmooth...
Abstract. Recently, based upon the Chen-Harker-Kanzow-Smale smoothing function and the trajectory an...
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...
Abstract. In this paper we study a special kind of optimization problems with linear comple-mentarit...