@Article{JCM-19-4,
author = {},
title = {Global Convergence and Implementation of NGTN Method for Solving Large-Scale Sparse Nonlinear Programming Problems},
journal = {Journal of Computational Mathematics},
year = {2001},
volume = {19},
number = {4},
pages = {337--346},
abstract = {<p style="text-align: justify;">An NGTN method was proposed for solving large-scale sparse nonlinear programming (NLP) problems. This is a hybrid method of a truncated Newton direction and a modified negative gradient direction, which is suitable for handling sparse data structure and possesses Q-quadratic convergence rate. The global convergence of this new method is proved, the convergence rate is further analysed, and the detailed implementation is discussed in this paper. Some numerical tests for solving truss optimization and large sparse problems are reported. The theoretical and numerical results show that the new method is efficient for solving large-scale sparse NLP problems.</p>},
issn = {1991-7139},
doi = {https://doi.org/2001-JCM-8986},
url = {https://global-sci.com/article/85479/global-convergence-and-implementation-of-ngtn-method-for-solving-large-scale-sparse-nonlinear-programming-problems}
}