Conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization
This thesis focuses on solving conjugate gradient methods for large-scale uncon- strained optimization problems. The main objective of this study is to propose some modifications to the standard conjugate gradient methods so that its search direction satisfies the sufficient descent and the bo...
Saved in:
Main Author: | Ling, Mei Mei |
---|---|
Format: | Thesis |
Language: | English |
Published: |
2015
|
Subjects: | |
Online Access: | http://psasir.upm.edu.my/id/eprint/85444/1/FS%202016%2091%20ir.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Scaled three-term conjugate gradient method via Davidon-Fletcher-Powell update for unconstrained optimization
by: Ibrahim, Arzuka
Published: (2015) -
Multiple Alternate Steps Gradient Methods For Unconstrained Optimization
by: Lee, Sui Fong
Published: (2009) -
New conjugate gradient methods for solving large-scale unconstrained optimization problems
by: Mohd Rivaie Mohd Ali -
Modified quasi-Newton type methods using gradient flow system for solving unconstrained optimization
by: Yap, Chui Ying
Published: (2016) -
Some modifications of conjugate gradient coefficient for unconstrained optimization
by: Mohd Rivaie Mohd Ali