Modified limited-memory Broyden-Fletcher-Goldfarb-Shanno algorithm for unconstrained optimization problem

The use of the self-scaling Broyden-Fletcher-Goldfarb-Shanno (BFGS) method is very efficient for the resolution of large-scale optimization problems, in this paper, we present a new algorithm and modified the self-scaling BFGS algorithm. Also, based on noticeable non-monotone line search properties,...

Full description

Saved in:
Bibliographic Details
Main Author: Ali, Muna M. M. (Author)
Format: EJournal Article
Published: Institute of Advanced Engineering and Science, 2021-11-01.
Subjects:
Online Access:Get fulltext
Tags: Add Tag
No Tags, Be the first to tag this record!
LEADER 02015 am a22002893u 4500
001 ijeecs24877_15723
042 |a dc 
100 1 0 |a Ali, Muna M. M.  |e author 
100 1 0 |e contributor 
245 0 0 |a Modified limited-memory Broyden-Fletcher-Goldfarb-Shanno algorithm for unconstrained optimization problem 
260 |b Institute of Advanced Engineering and Science,   |c 2021-11-01. 
500 |a https://ijeecs.iaescore.com/index.php/IJEECS/article/view/24877 
520 |a The use of the self-scaling Broyden-Fletcher-Goldfarb-Shanno (BFGS) method is very efficient for the resolution of large-scale optimization problems, in this paper, we present a new algorithm and modified the self-scaling BFGS algorithm. Also, based on noticeable non-monotone line search properties, we discovered and employed a new non-monotone idea. Thereafter first, an updated formula is exhorted to the convergent Hessian matrix and we have achieved the secant condition, second, we established the global convergence properties of the algorithm under some mild conditions and the objective function is not convexity hypothesis. A promising behavior is achieved and the numerical results are also reported of the new algorithm. 
540 |a Copyright (c) 2021 Institute of Advanced Engineering and Science 
540 |a http://creativecommons.org/licenses/by-nc/4.0 
546 |a eng 
690
690 |a BFGS algorithm global convergence property; Nonmonotone line search; Self-scaling; Unconstrained optimization; 
655 7 |a info:eu-repo/semantics/article  |2 local 
655 7 |a info:eu-repo/semantics/publishedVersion  |2 local 
655 7 |2 local 
786 0 |n Indonesian Journal of Electrical Engineering and Computer Science; Vol 24, No 2: November 2021; 1027-1035 
786 0 |n 2502-4760 
786 0 |n 2502-4752 
786 0 |n 10.11591/ijeecs.v24.i2 
787 0 |n https://ijeecs.iaescore.com/index.php/IJEECS/article/view/24877/15723 
856 4 1 |u https://ijeecs.iaescore.com/index.php/IJEECS/article/view/24877/15723  |z Get fulltext