Convergence of the Steepest Descent Method for Minimizing Convex Functions

Kiwiel and Murty (1996) discuss the convergence properties of a class of steepest descent algorithm for minimizing a continuously differentiable quasiconvex function f on mo. Under mild conditions, we prove that the limit infimum of IIVflXo)1I is zero and that false convergence does not occur even w...

Full description

Bibliographic Details
Main Authors: Abu Hassan, Malik, Monsi, Mansor, Leong, Wah June
Format: Article
Language:English
English
Published: Universiti Putra Malaysia Press 2002
Online Access:http://psasir.upm.edu.my/id/eprint/3718/1/Convergence_of_the_Steepest_Descent_Method_for_Minimizing.pdf
_version_ 1825943541214347264
author Abu Hassan, Malik
Monsi, Mansor
Leong, Wah June
author_facet Abu Hassan, Malik
Monsi, Mansor
Leong, Wah June
author_sort Abu Hassan, Malik
collection UPM
description Kiwiel and Murty (1996) discuss the convergence properties of a class of steepest descent algorithm for minimizing a continuously differentiable quasiconvex function f on mo. Under mild conditions, we prove that the limit infimum of IIVflXo)1I is zero and that false convergence does not occur even when f is convex.
first_indexed 2024-03-06T07:01:56Z
format Article
id upm.eprints-3718
institution Universiti Putra Malaysia
language English
English
last_indexed 2024-03-06T07:01:56Z
publishDate 2002
publisher Universiti Putra Malaysia Press
record_format dspace
spelling upm.eprints-37182013-05-27T07:10:41Z http://psasir.upm.edu.my/id/eprint/3718/ Convergence of the Steepest Descent Method for Minimizing Convex Functions Abu Hassan, Malik Monsi, Mansor Leong, Wah June Kiwiel and Murty (1996) discuss the convergence properties of a class of steepest descent algorithm for minimizing a continuously differentiable quasiconvex function f on mo. Under mild conditions, we prove that the limit infimum of IIVflXo)1I is zero and that false convergence does not occur even when f is convex. Universiti Putra Malaysia Press 2002 Article PeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/3718/1/Convergence_of_the_Steepest_Descent_Method_for_Minimizing.pdf Abu Hassan, Malik and Monsi, Mansor and Leong, Wah June (2002) Convergence of the Steepest Descent Method for Minimizing Convex Functions. Pertanika Journal of Science & Technology, 10 (2). pp. 145-152. ISSN 0128-7680 English
spellingShingle Abu Hassan, Malik
Monsi, Mansor
Leong, Wah June
Convergence of the Steepest Descent Method for Minimizing Convex Functions
title Convergence of the Steepest Descent Method for Minimizing Convex Functions
title_full Convergence of the Steepest Descent Method for Minimizing Convex Functions
title_fullStr Convergence of the Steepest Descent Method for Minimizing Convex Functions
title_full_unstemmed Convergence of the Steepest Descent Method for Minimizing Convex Functions
title_short Convergence of the Steepest Descent Method for Minimizing Convex Functions
title_sort convergence of the steepest descent method for minimizing convex functions
url http://psasir.upm.edu.my/id/eprint/3718/1/Convergence_of_the_Steepest_Descent_Method_for_Minimizing.pdf
work_keys_str_mv AT abuhassanmalik convergenceofthesteepestdescentmethodforminimizingconvexfunctions
AT monsimansor convergenceofthesteepestdescentmethodforminimizingconvexfunctions
AT leongwahjune convergenceofthesteepestdescentmethodforminimizingconvexfunctions