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:
主要作者: | Mahmoud Irsheid Dawahdeh (Author) |
---|---|
其他作者: | x |
格式: | Thesis 圖書 |
語言: | English |
主題: | |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
Hybrid methods of Polak-Ribiere-Polyak, Wei-Yao-Liu and Polak-Ribiere-Polyak, Dai-Wen methods for unconstrained optimization problems
由: Yasir Salih Mohammednour Mhmoud -
Modified spectral conjugate gradient methods for unconstrained optimization and system of linear equations
由: Wan Khadijah binti Wan Sulaiman -
Performance analysis of SRM family for unconstrained optimization problems
由: Syazni Shoid -
Modified Quasi-Newton Methods For Large-Scale Unconstrained Optimization
由: Leong, Wah June
出版: (2003) -
Interval estimates based on local linearization in a nonlinear model /
由: Khoo, Kim Chiew
出版: (1990)