Year: 1997
Journal of Computational Mathematics, Vol. 15 (1997), Iss. 1 : pp. 36–54
Abstract
In this paper, a truncated hybrid method is proposed and developed for solving sparse large-scale nonlinear programming problems. In the hybrid method, a symmetric system of linear equations, instead of the usual quadratic programming subproblems, is solved at iterative process. In order to ensure the global convergence, a method of multiplier is inserted in iterative process. A truncated solution is determined for the system of linear equations and the unconstrained subproblems are solved by the limited memory BFGS algorithm such that the hybrid algorithm is suitable to the large-scale problems. The local convergence of the hybrid algorithm is proved and some numerical tests for medium-sized truss problem are given.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/1997-JCM-9188
Journal of Computational Mathematics, Vol. 15 (1997), Iss. 1 : pp. 36–54
Published online: 1997-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 19