On the convergence of \(s\)-dependent GFR conjugate gradient method for unconstrained optimization
From MaRDI portal
Publication:1652787
DOI10.1007/s11075-017-0397-7zbMath1398.65148OpenAlexW2748382761MaRDI QIDQ1652787
Yajing Gu, Chang-Yu Wang, Wen-Ling Zhao
Publication date: 16 July 2018
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-017-0397-7
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
- A modified Fletcher-Reeves-type derivative-free method for symmetric nonlinear equations
- A PRP type method for systems of monotone equations
- Convergence properties of the Beale-Powell restart algorithm
- Global convergence result for conjugate gradient methods
- Global convergence of the Fletcher-Reeves algorithm with inexact linesearch
- A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs
- A conjugate gradient method to solve convex constrained monotone equations with applications in compressive sensing
- A three-terms Polak-Ribière-Polyak conjugate gradient algorithm for large-scale nonlinear equations
- A descent extension of the Polak-Ribière-Polyak conjugate gradient method
- A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Testing Unconstrained Optimization Software
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Convergence properties of the Fletcher-Reeves method
- A Nonlinear Conjugate Gradient Algorithm with an Optimal Property and an Improved Wolfe Line Search
- An Inexact PRP Conjugate Gradient Method for Symmetric Nonlinear Equations
This page was built for publication: On the convergence of \(s\)-dependent GFR conjugate gradient method for unconstrained optimization
