In this article, we first propose an unconstrained optimization reformulation of the generalized nonlinear complementarity problem (GNCP) over a polyhedral cone, and then discuss the con-ditions under which its any stationary point is a solution of the GNCP. The conditions which guarantee the nonsingularity and positive definiteness of the Hessian matrix of the objective function are also given. In the end, we design a Newton-type method to solve the GNCP and show the global and local quadratic convergence of the proposed method under certain assumptions
International audiencehe Josephy--Newton method for solving a nonlinear complementarity problem cons...
AbstractIn this paper, we suggest and analyze a new modified proximal-point method for solving nonli...
AbstractIn the paper [J.-S. Chen, S. Pan, A family of NCP-functions and a descent method for the non...
Minimization of a differentiable function subject to box constraints is proposed as a strategy to so...
Making use of a smoothing NCP-function, we formulate the generalized complementarity problem (GCP) o...
Neste trabalho reformulamos o problema de complementaridade não linear generalizado (GNCP) em cones ...
NE/SQP is a recent algorithm that has proven quite effective for solving the pure and mixed forms of...
Global methods for nonlinear complementarity problems formulate the problem as a system of nonsmooth...
The nonlinear complementarity problem is cast as an unconstrained minimization problem that is obtai...
Recent improvements in the capabilities of complementarity solvers have led to an increased interest...
. Recently, much eort has been made in solving and analyzing the nonlinear complementarity problem (...
Abstract. A reformulation of the nonlinear complementarity problem (NCP) as an unconstrained minimiz...
Reformulations of a generalization of a second-order cone complementarity problem (GSOCCP) as optimi...
Based on the smoothing function of penalized Fischer-Burmeister NCP-function, we propose a new smoot...
In this thesis, we study two generalizations of the classical linear complementarity problem (LCP) -...
International audiencehe Josephy--Newton method for solving a nonlinear complementarity problem cons...
AbstractIn this paper, we suggest and analyze a new modified proximal-point method for solving nonli...
AbstractIn the paper [J.-S. Chen, S. Pan, A family of NCP-functions and a descent method for the non...
Minimization of a differentiable function subject to box constraints is proposed as a strategy to so...
Making use of a smoothing NCP-function, we formulate the generalized complementarity problem (GCP) o...
Neste trabalho reformulamos o problema de complementaridade não linear generalizado (GNCP) em cones ...
NE/SQP is a recent algorithm that has proven quite effective for solving the pure and mixed forms of...
Global methods for nonlinear complementarity problems formulate the problem as a system of nonsmooth...
The nonlinear complementarity problem is cast as an unconstrained minimization problem that is obtai...
Recent improvements in the capabilities of complementarity solvers have led to an increased interest...
. Recently, much eort has been made in solving and analyzing the nonlinear complementarity problem (...
Abstract. A reformulation of the nonlinear complementarity problem (NCP) as an unconstrained minimiz...
Reformulations of a generalization of a second-order cone complementarity problem (GSOCCP) as optimi...
Based on the smoothing function of penalized Fischer-Burmeister NCP-function, we propose a new smoot...
In this thesis, we study two generalizations of the classical linear complementarity problem (LCP) -...
International audiencehe Josephy--Newton method for solving a nonlinear complementarity problem cons...
AbstractIn this paper, we suggest and analyze a new modified proximal-point method for solving nonli...
AbstractIn the paper [J.-S. Chen, S. Pan, A family of NCP-functions and a descent method for the non...