The authors study the convergence properties of the damped Gauss-Newton algorithm which was originally proposed by Subramamian for the complementarity problem. In this paper, a new stepsize is presented and a new glob...The authors study the convergence properties of the damped Gauss-Newton algorithm which was originally proposed by Subramamian for the complementarity problem. In this paper, a new stepsize is presented and a new global convergence result is given. This result here have improved and generalized those in the literature.展开更多
基金This project is supported by National Natural Science Foundation of China(No.10 1710 55)
文摘The authors study the convergence properties of the damped Gauss-Newton algorithm which was originally proposed by Subramamian for the complementarity problem. In this paper, a new stepsize is presented and a new global convergence result is given. This result here have improved and generalized those in the literature.