Volume 19, Issue 4
Global Convergence and Implementation of NGTN Method for Sowing Large-Scale SMRSE Nonlinear Programming Problems

Qin Ni

DOI:

J. Comp. Math., 19 (2001), pp. 337-346

Published online: 2001-08

Preview Full PDF 165 1717
Export citation
  • Abstract

An NGTN method was proposed for solving large-scale spare 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.

  • Keywords

Nonlinear programming Large-scale problem Sparse

  • AMS Subject Headings

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{JCM-19-337, author = {}, title = {Global Convergence and Implementation of NGTN Method for Sowing Large-Scale SMRSE Nonlinear Programming Problems}, journal = {Journal of Computational Mathematics}, year = {2001}, volume = {19}, number = {4}, pages = {337--346}, abstract = { An NGTN method was proposed for solving large-scale spare 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. }, issn = {1991-7139}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/jcm/8986.html} }
TY - JOUR T1 - Global Convergence and Implementation of NGTN Method for Sowing Large-Scale SMRSE Nonlinear Programming Problems JO - Journal of Computational Mathematics VL - 4 SP - 337 EP - 346 PY - 2001 DA - 2001/08 SN - 19 DO - http://doi.org/ UR - https://global-sci.org/intro/article_detail/jcm/8986.html KW - Nonlinear programming KW - Large-scale problem KW - Sparse AB - An NGTN method was proposed for solving large-scale spare 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.
Qin Ni. (1970). Global Convergence and Implementation of NGTN Method for Sowing Large-Scale SMRSE Nonlinear Programming Problems. Journal of Computational Mathematics. 19 (4). 337-346. doi:
Copy to clipboard
The citation has been copied to your clipboard