In this paper, we propose a new LQP method for solving nonlinear complementarity problems. The method uses a new descent direction which differs from the other existing LQP methods and another optimal step length is employed to reach substantial progress in each iteration.We prove the global convergence of the proposed method under the same assumptions as in [A. Bnouhachem al., A note on LQP method for nonlinear complimentarity problems. Adv. Model. Optim. 14(1), 269-283 (2012)]. Some preliminary computational results are given to illustrate the efficiency of the proposed method
A P*-Nonlinear Complementarity Problem as a generalization of the P*Linear Complementarity Problem i...
AbstractIn the paper [J.-S. Chen, S. Pan, A family of NCP-functions and a descent method for the non...
In this article, we first propose an unconstrained optimization reformulation of the generalized non...
In this paper, we propose a new LQP method for solving nonlinear complementarity problems. The metho...
To solve nonlinear complementarity problems (NCP), the logarithmic- quadratic proximal (LQP) method ...
To solve nonlinear complementarity problems (NCP), at each iteration, the classical proximal point a...
The well-known logarithmic-quadratic proximal (LQP)method has motivated a number of efficient numeri...
Global methods for nonlinear complementarity problems formulate the problem as a system of nonsmooth...
NE/SQP is a recent algorithm that has proven quite effective for solving the pure and mixed forms of...
AbstractIn this paper, we suggest and analyze a new modified proximal-point method for solving nonli...
. Recently, much eort has been made in solving and analyzing the nonlinear complementarity problem (...
Abstract In last decades, there has been much effort on the solution and the analysis of the nonline...
Based on NCP functions, we present a Lagrangian globalization (LG) algorithm model for solving the n...
A family of Least-Change Secant-Update methods for solving nonlinear complementarity problems based ...
Abstract. This paper discusses a special class of mathematical programs with nonlinear complementari...
A P*-Nonlinear Complementarity Problem as a generalization of the P*Linear Complementarity Problem i...
AbstractIn the paper [J.-S. Chen, S. Pan, A family of NCP-functions and a descent method for the non...
In this article, we first propose an unconstrained optimization reformulation of the generalized non...
In this paper, we propose a new LQP method for solving nonlinear complementarity problems. The metho...
To solve nonlinear complementarity problems (NCP), the logarithmic- quadratic proximal (LQP) method ...
To solve nonlinear complementarity problems (NCP), at each iteration, the classical proximal point a...
The well-known logarithmic-quadratic proximal (LQP)method has motivated a number of efficient numeri...
Global methods for nonlinear complementarity problems formulate the problem as a system of nonsmooth...
NE/SQP is a recent algorithm that has proven quite effective for solving the pure and mixed forms of...
AbstractIn this paper, we suggest and analyze a new modified proximal-point method for solving nonli...
. Recently, much eort has been made in solving and analyzing the nonlinear complementarity problem (...
Abstract In last decades, there has been much effort on the solution and the analysis of the nonline...
Based on NCP functions, we present a Lagrangian globalization (LG) algorithm model for solving the n...
A family of Least-Change Secant-Update methods for solving nonlinear complementarity problems based ...
Abstract. This paper discusses a special class of mathematical programs with nonlinear complementari...
A P*-Nonlinear Complementarity Problem as a generalization of the P*Linear Complementarity Problem i...
AbstractIn the paper [J.-S. Chen, S. Pan, A family of NCP-functions and a descent method for the non...
In this article, we first propose an unconstrained optimization reformulation of the generalized non...