A New Sufficient Descent Conjugate Gradient Method for Unconstrained Optimization
Cited by
Export citation
- BibTex
- RIS
- TXT
@Article{JICS-7-212,
author = {Sun Min and Liu Jing},
title = {A New Sufficient Descent Conjugate Gradient Method for Unconstrained Optimization},
journal = {Journal of Information and Computing Science},
year = {2024},
volume = {7},
number = {3},
pages = {212--217},
abstract = { In this paper, a new conjugate conjugate method with sufficient descent property is proposed for
the unconstrained optimization problem. An attractive property of the new method is that the descent
direction generated by the method always possess the sufficient descent property, and this property is
ki . Under mild conditions, the global convergence of
independent of the line search used and the choice of
the new method is proved.
},
issn = {1746-7659},
doi = {https://doi.org/},
url = {http://global-sci.org/intro/article_detail/jics/22644.html}
}
TY - JOUR
T1 - A New Sufficient Descent Conjugate Gradient Method for Unconstrained Optimization
AU - Sun Min and Liu Jing
JO - Journal of Information and Computing Science
VL - 3
SP - 212
EP - 217
PY - 2024
DA - 2024/01
SN - 7
DO - http://doi.org/
UR - https://global-sci.org/intro/article_detail/jics/22644.html
KW - conjugate gradient method, sufficient descent property, global convergence
AB - In this paper, a new conjugate conjugate method with sufficient descent property is proposed for
the unconstrained optimization problem. An attractive property of the new method is that the descent
direction generated by the method always possess the sufficient descent property, and this property is
ki . Under mild conditions, the global convergence of
independent of the line search used and the choice of
the new method is proved.
Sun Min and Liu Jing. (2024). A New Sufficient Descent Conjugate Gradient Method for Unconstrained Optimization.
Journal of Information and Computing Science. 7 (3).
212-217.
doi:
Copy to clipboard