A new gradient method via least change secant update

The Barzilai–Borwein (BB) gradient method is favourable over the classical steepest descent method both in theory and in real computations. This method takes a ‘fixed’ step size rather than following a set of line search rules to ensure convergence. Along this line, we present a new approach for the...

Full description

Saved in:
Bibliographic Details
Main Authors: Leong, Wah June, Abu Hassan, Malik
Format: Article
Language:English
Published: Taylor & Francis 2011
Online Access:http://psasir.upm.edu.my/id/eprint/12746/1/A%20new%20gradient%20method%20via%20least%20change%20secant%20update.pdf
http://psasir.upm.edu.my/id/eprint/12746/
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.upm.eprints.12746
record_format eprints
spelling my.upm.eprints.127462015-10-05T00:45:04Z http://psasir.upm.edu.my/id/eprint/12746/ A new gradient method via least change secant update Leong, Wah June Abu Hassan, Malik The Barzilai–Borwein (BB) gradient method is favourable over the classical steepest descent method both in theory and in real computations. This method takes a ‘fixed’ step size rather than following a set of line search rules to ensure convergence. Along this line, we present a new approach for the two-point approximation to the quasi-Newton equation within the BB framework on the basis of a well-known least change result for the Davidon–Fletcher–Powell update and propose a new gradient method that belongs to the same class of BB gradient method in which the line search procedure is replaced by a fixed step size. Some preliminary numerical results suggest that improvements have been achieved. Taylor & Francis 2011-03 Article PeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/12746/1/A%20new%20gradient%20method%20via%20least%20change%20secant%20update.pdf Leong, Wah June and Abu Hassan, Malik (2011) A new gradient method via least change secant update. International Journal of Computer Mathematics, 88 (4). pp. 816-828. ISSN 0020-7160; ESSN: 1029-0265 10.1080/00207161003770386
institution Universiti Putra Malaysia
building UPM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Putra Malaysia
content_source UPM Institutional Repository
url_provider http://psasir.upm.edu.my/
language English
description The Barzilai–Borwein (BB) gradient method is favourable over the classical steepest descent method both in theory and in real computations. This method takes a ‘fixed’ step size rather than following a set of line search rules to ensure convergence. Along this line, we present a new approach for the two-point approximation to the quasi-Newton equation within the BB framework on the basis of a well-known least change result for the Davidon–Fletcher–Powell update and propose a new gradient method that belongs to the same class of BB gradient method in which the line search procedure is replaced by a fixed step size. Some preliminary numerical results suggest that improvements have been achieved.
format Article
author Leong, Wah June
Abu Hassan, Malik
spellingShingle Leong, Wah June
Abu Hassan, Malik
A new gradient method via least change secant update
author_facet Leong, Wah June
Abu Hassan, Malik
author_sort Leong, Wah June
title A new gradient method via least change secant update
title_short A new gradient method via least change secant update
title_full A new gradient method via least change secant update
title_fullStr A new gradient method via least change secant update
title_full_unstemmed A new gradient method via least change secant update
title_sort new gradient method via least change secant update
publisher Taylor & Francis
publishDate 2011
url http://psasir.upm.edu.my/id/eprint/12746/1/A%20new%20gradient%20method%20via%20least%20change%20secant%20update.pdf
http://psasir.upm.edu.my/id/eprint/12746/
_version_ 1643825122329493504
score 13.160551