Convergence of the Steepest Descent Method for Minimizing Convex Functions

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

[img] PDF
1551Kb

Abstract

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.

Item Type:Article
Keyword:Convergence, steepest descent method, convex functions, minimization
Publisher:Universiti Putra Malaysia Press
ID Code:3718
Deposited By: Nur Izzati Mohd Zaki
Deposited On:01 Dec 2009 03:18
Last Modified:27 May 2013 07:10

Repository Staff Only: Edit item detail

Document Download Statistics

This item has been downloaded for since 01 Dec 2009 03:18.

View statistics for "Convergence of the Steepest Descent Method for Minimizing Convex Functions"


Universiti Putra Malaysia Institutional Repository

Universiti Putra Malaysia Institutional Repository is an on-line digital archive that serves as a central collection and storage of scientific information and research at the Universiti Putra Malaysia.

Currently, the collections deposited in the IR consists of Master and PhD theses, Master and PhD Project Report, Journal Articles, Journal Bulletins, Conference Papers, UPM News, Newspaper Cuttings, Patents and Inaugural Lectures.

As the policy of the university does not permit users to view thesis in full text, access is only given to the first 24 pages only.