Global convergence of a new spectral conjugate gradient by using strong wolfe line search

Unconstrained optimization problems can be solved by using few popular methods such as Conjugate Gradient (CG) method, Steepest Descent (SD) Method and Broyden-Fletcher-Goldfarb-Shanno (BFGS) method. The simplest solving method is by using SD method but nowadays CG method is used worldwide due to it...

詳細記述

保存先:
書誌詳細
主要な著者: Zahrahtul Amani, Zakaria, Mustafa, Mamat, Mohd, Rivaie
フォーマット: 論文
言語:English
出版事項: HIKARI Ltd. 2015
主題:
オンライン・アクセス:http://eprints.unisza.edu.my/6330/1/FH02-FIK-15-03433.jpg
http://eprints.unisza.edu.my/6330/
タグ: タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
id my-unisza-ir.6330
record_format eprints
spelling my-unisza-ir.63302022-09-13T04:57:33Z http://eprints.unisza.edu.my/6330/ Global convergence of a new spectral conjugate gradient by using strong wolfe line search Zahrahtul Amani, Zakaria Mustafa, Mamat Mohd, Rivaie QA75 Electronic computers. Computer science Unconstrained optimization problems can be solved by using few popular methods such as Conjugate Gradient (CG) method, Steepest Descent (SD) Method and Broyden-Fletcher-Goldfarb-Shanno (BFGS) method. The simplest solving method is by using SD method but nowadays CG method is used worldwide due to its convergence analysis. A few of unconstrained optimization problems with several different variables are used to prove the global convergence result of new spectral conjugate gradient to be compared with five most common  k proposed by the early researches by using inexact line search. HIKARI Ltd. 2015 Article PeerReviewed image en http://eprints.unisza.edu.my/6330/1/FH02-FIK-15-03433.jpg Zahrahtul Amani, Zakaria and Mustafa, Mamat and Mohd, Rivaie (2015) Global convergence of a new spectral conjugate gradient by using strong wolfe line search. Applied Mathematical Sciences, 9 (61). pp. 3105-3117. ISSN 1312885X [P]
institution Universiti Sultan Zainal Abidin
building UNISZA Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Sultan Zainal Abidin
content_source UNISZA Institutional Repository
url_provider https://eprints.unisza.edu.my/
language English
topic QA75 Electronic computers. Computer science
spellingShingle QA75 Electronic computers. Computer science
Zahrahtul Amani, Zakaria
Mustafa, Mamat
Mohd, Rivaie
Global convergence of a new spectral conjugate gradient by using strong wolfe line search
description Unconstrained optimization problems can be solved by using few popular methods such as Conjugate Gradient (CG) method, Steepest Descent (SD) Method and Broyden-Fletcher-Goldfarb-Shanno (BFGS) method. The simplest solving method is by using SD method but nowadays CG method is used worldwide due to its convergence analysis. A few of unconstrained optimization problems with several different variables are used to prove the global convergence result of new spectral conjugate gradient to be compared with five most common  k proposed by the early researches by using inexact line search.
format Article
author Zahrahtul Amani, Zakaria
Mustafa, Mamat
Mohd, Rivaie
author_facet Zahrahtul Amani, Zakaria
Mustafa, Mamat
Mohd, Rivaie
author_sort Zahrahtul Amani, Zakaria
title Global convergence of a new spectral conjugate gradient by using strong wolfe line search
title_short Global convergence of a new spectral conjugate gradient by using strong wolfe line search
title_full Global convergence of a new spectral conjugate gradient by using strong wolfe line search
title_fullStr Global convergence of a new spectral conjugate gradient by using strong wolfe line search
title_full_unstemmed Global convergence of a new spectral conjugate gradient by using strong wolfe line search
title_sort global convergence of a new spectral conjugate gradient by using strong wolfe line search
publisher HIKARI Ltd.
publishDate 2015
url http://eprints.unisza.edu.my/6330/1/FH02-FIK-15-03433.jpg
http://eprints.unisza.edu.my/6330/
_version_ 1744358550485860352
score 13.251813