Photo from wikipedia
In this paper, a new hybrid conjugate gradient algorithm is proposed for solving unconstrained optimization problems, the conjugate gradient parameter [Formula: see text] is computed as a convex combination of… Click to show full abstract
In this paper, a new hybrid conjugate gradient algorithm is proposed for solving unconstrained optimization problems, the conjugate gradient parameter [Formula: see text] is computed as a convex combination of [Formula: see text] and [Formula: see text]. Under the wolfe line search, we prove the sufficient descent and the global convergence. Numerical results are reported to show the effectiveness of our procedure.
Keywords:
convex combination;
conjugate gradient;
formula see
Journal Title: Asian-european Journal of Mathematics
Year Published: 2021
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Asian-european Journal of Mathematics
Year Published: 2021
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!