New low storage VM-algorithm for constrained optimization

Section: Article
Published
Jun 25, 2025
Pages
11-19

Abstract

In this paper a new low-storage VM-algorithm for constrained optimization is investigated both theoretically and experimentally. The new algorithm is based on both the well-known Fletcher's low storage algorithm which generates columns Z spanned on the gradient vectors g1, g2, ... gn and the idea of both Buckley and LeNir of combined variable storage-conjugate gradient method. The well-known SUMT algorithm is adapted to implement the new idea. The new algorithm is very robust compared with the standard low-storage Fletcher algorithm and the standard SUMT algorithm which was designed for solving constrained problems, of the numerical results of application very promising.

Identifiers

Download this PDF file

Statistics

How to Cite

Y. Al-Bayati, A., عباس, Th. Chilmerane, H., & همسة. (2025). New low storage VM-algorithm for constrained optimization. AL-Rafidain Journal of Computer Sciences and Mathematics, 6(3), 11–19. Retrieved from https://rjps.uomosul.edu.iq/index.php/csmj/article/view/19402