full
search.png

Search

close.png

Cancel

arrow
Volume 15, Issue 1
QP-Free, Truncated Hybrid Methods for Large-Scale Nonlinear Constrained Optimization

Q. Ni

J. Comp. Math., 15 (1997), pp. 36-54.

Published online: 1997-02

Preview Full PDF 2887 25061

Cited by

google scholar semantic scholar
Export citation
  • 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.

  • Keywords

  • AMS Subject Headings

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{JCM-15-36, author = {Q. Ni}, title = {QP-Free, Truncated Hybrid Methods for Large-Scale Nonlinear Constrained Optimization}, journal = {Journal of Computational Mathematics}, year = {1997}, volume = {15}, number = {1}, pages = {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.

}, issn = {1991-7139}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/jcm/9188.html} }
TY - JOUR T1 - QP-Free, Truncated Hybrid Methods for Large-Scale Nonlinear Constrained Optimization AU - Q. Ni JO - Journal of Computational Mathematics VL - 1 SP - 36 EP - 54 PY - 1997 DA - 1997/02 SN - 15 DO - http://doi.org/ UR - https://global-sci.org/intro/article_detail/jcm/9188.html KW - AB -

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.

Q. Ni. (1997). QP-Free, Truncated Hybrid Methods for Large-Scale Nonlinear Constrained Optimization. Journal of Computational Mathematics. 15 (1). 36-54. doi:
Copy to clipboard
BibteX RIS TXT
The citation has been copied to your clipboard