Multiple Alternate Steps Gradient Methods For Unconstrained Optimization
The focus of this thesis is on finding the unconstrained minimizer of a function by using the alternate steps gradient methods. Specifically, we will focus on the well-known classes of gradient methods called the steepest descent (SD) method and Barzilai-Borwein (BB) method. First we briefly give...
Saved in:
Main Author: | Lee, Sui Fong |
---|---|
Format: | Thesis |
Language: | English English |
Published: |
2009
|
Subjects: | |
Online Access: | http://psasir.upm.edu.my/id/eprint/12367/1/IPM_2009_11A.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization
by: Ling, Mei Mei
Published: (2015) -
Modified quasi-Newton type methods using gradient flow system for solving unconstrained optimization
by: Yap, Chui Ying
Published: (2016) -
Scaled three-term conjugate gradient method via Davidon-Fletcher-Powell update for unconstrained optimization
by: Ibrahim, Arzuka
Published: (2015) -
Pengubahsuaian ke Atas Kaedah Kecerunan Konjugat untuk Peminimuman Tak Berkekangan
by: Bachok @ Lati, Norfifah
Published: (2003) -
New conjugate gradient methods for solving large-scale unconstrained optimization problems
by: Mohd Rivaie Mohd Ali