An improved Polak-Ribiere-Polyak method using strong wolfe-powell line search for unconstrained optimization problems
The unconstrained optimization problem has been dealing with different methods to be solved recently. The most common solution is the conjugate gradient (CG) method due to its convergence speed, simplicity, low memory requirements, and its capability to solve large-scale problems. There are many mod...
Saved in:
Main Author: | Mahmoud Irsheid Dawahdeh (Author) |
---|---|
Other Authors: | x |
Format: | Thesis Book |
Language: | English |
Subjects: | |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Hybrid methods of Polak-Ribiere-Polyak, Wei-Yao-Liu and Polak-Ribiere-Polyak, Dai-Wen methods for unconstrained optimization problems
by: Yasir Salih Mohammednour Mhmoud -
Modified spectral conjugate gradient methods for unconstrained optimization and system of linear equations
by: Wan Khadijah binti Wan Sulaiman -
Performance analysis of SRM family for unconstrained optimization problems
by: Syazni Shoid -
Modified Quasi-Newton Methods For Large-Scale Unconstrained Optimization
by: Leong, Wah June
Published: (2003) -
Interval estimates based on local linearization in a nonlinear model /
by: Khoo, Kim Chiew
Published: (1990)