Behavior of the combination of PRP and HZ methods for unconstrained optimization
From MaRDI portal
Publication:2061360
DOI10.3934/naco.2020032zbMath1482.90167OpenAlexW3027770025MaRDI QIDQ2061360
Badreddine Sellami, Mohammed Belloufi, Sarra Delladji
Publication date: 13 December 2021
Published in: Numerical Algebra, Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/naco.2020032
unconstrained optimizationglobal convergenceconvex combinationsufficient descenthybrid conjugate gradient
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Numerical computation of solutions to systems of equations (65H10)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New hybrid conjugate gradient method for unconstrained optimization
- New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems
- Hybrid conjugate gradient algorithm for unconstrained optimization
- Another hybrid conjugate gradient algorithm for unconstrained optimization
- A Modified Hestenes-Stiefel Conjugate Gradient Algorithm for Large-Scale Optimization
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- CUTE
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- New hybrid conjugate gradient method as a convex combination of FR and PRP methods
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- The conjugate gradient method in extremal problems
- Benchmarking optimization software with performance profiles.
This page was built for publication: Behavior of the combination of PRP and HZ methods for unconstrained optimization