Year: 2003
Journal of Computational Mathematics, Vol. 21 (2003), Iss. 1 : pp. 71–84
Abstract
Linear systems associated with numerical methods for constrained optimization are discussed in this paper. It is shown that the corresponding subproblems arise in most well-known methods, no matter line search methods or trust region methods for constrained optimization can be expressed as similar systems of linear equations. All these linear systems can be viewed as some kinds of approximation to the linear system derived by the Lagrange-Newton method. Some properties of these linear systems are analyzed.
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/2003-JCM-10284
Journal of Computational Mathematics, Vol. 21 (2003), Iss. 1 : pp. 71–84
Published online: 2003-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 14
Keywords: Constrained optimization Linear equations Lagrange-Newton method Trust region Line search.