Global convergence of new three terms conjugate gradient for unconstrained optimization
In this paper, a new formula of 𝛽𝑘 is suggested for the conjugate gradient method of solving unconstrained optimization problems based on three terms and step size of cubic. Our new proposed CG method has descent condition, sufficient descent condition, conjugacy condition, and global convergence pr...
Guardado en:
Autores principales: | Ahmed Anwer Mustafa, Salah Gazi Shareef |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Refaad
2021
|
Materias: | |
Acceso en línea: | https://doaj.org/article/6191ebe61c8745298d03806b934bc291 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
Double direction three-term spectral conjugate gradient method for solving symmetric nonlinear equations
por: Mohammed Yusuf Waziri, et al.
Publicado: (2022) -
A Sparse Quasi-Newton Method Based on Automatic Differentiation for Solving Unconstrained Optimization Problems
por: Huiping Cao, et al.
Publicado: (2021) -
Gradient-Descent-like Ghost Imaging
por: Wen-Kai Yu, et al.
Publicado: (2021) -
Harbor Aquaculture Area Extraction Aided with an Integration-Enhanced Gradient Descent Algorithm
por: Yafeng Zhong, et al.
Publicado: (2021) -
Pseudo-188D: Phage Protein Prediction Based on a Model of Pseudo-188D
por: Xiaomei Gu, et al.
Publicado: (2021)