GLOBAL CONVERGENCE OF A SPECIAL CASE OF THE DAI–YUAN FAMILY WITHOUT LINE SEARCH
From MaRDI portal
Publication:3526527
DOI10.1142/S0217595908001663zbMATH Open1163.90799OpenAlexW2044891299MaRDI QIDQ3526527FDOQ3526527
Authors: Hui Zhu, Xiongda Chen
Publication date: 25 September 2008
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595908001663
Recommendations
- Global convergence of a two-parameter family of conjugate gradient methods without line search
- A family of nonlinear conjugate gradient methods with a global convergence property
- Global convergence of conjugate gradient methods without line search
- scientific article; zbMATH DE number 7071347
- scientific article; zbMATH DE number 1349196
Cites Work
- Testing Unconstrained Optimization Software
- Title not available (Why is that?)
- Function minimization by conjugate gradients
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- Convergence Conditions for Ascent Methods
- Methods of conjugate gradients for solving linear systems
- Efficient generalized conjugate gradient algorithms. I: Theory
- Global convergence result for conjugate gradient methods
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- A three-parameter family of nonlinear conjugate gradient methods
- Convergence Properties of Nonlinear Conjugate Gradient Methods
- Convergence properties of the Fletcher-Reeves method
- Global convergence of conjugate gradient methods without line search
- Global convergence of a two-parameter family of conjugate gradient methods without line search
Cited In (3)
Uses Software
This page was built for publication: GLOBAL CONVERGENCE OF A SPECIAL CASE OF THE DAI–YUAN FAMILY WITHOUT LINE SEARCH
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3526527)