Applying powell's symmetrical technique to conjugate gradient methods
From MaRDI portal
Publication:540656
DOI10.1007/s10589-009-9302-1zbMath1242.90237OpenAlexW2000868976WikidataQ53225525 ScholiaQ53225525MaRDI QIDQ540656
Publication date: 3 June 2011
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-009-9302-1
Related Items
Spectral method and its application to the conjugate gradient method ⋮ Symmetric Perry conjugate gradient method ⋮ A New Dai-Liao Conjugate Gradient Method with Optimal Parameter Choice
Uses Software
Cites Work
- Unnamed Item
- New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems
- A descent nonlinear conjugate gradient method for large-scale unconstrained optimization
- Scaled conjugate gradient algorithms for unconstrained optimization
- Another hybrid conjugate gradient algorithm for unconstrained optimization
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Two-Point Step Size Gradient Methods
- Technical Note—A Modified Conjugate Gradient Algorithm
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Algorithm 500: Minimization of Unconstrained Multivariate Functions [E4]
- Extending the relationship between the conjugate gradient and BFGS algorithms
- Conjugate Gradient Methods with Inexact Searches
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- A New Algorithm for Unconstrained Optimization
- Methods of conjugate gradients for solving linear systems
- A spectral conjugate gradient method for unconstrained optimization
- Benchmarking optimization software with performance profiles.
