Two descent hybrid conjugate gradient methods for optimization
From MaRDI portal
Publication:2483351
DOI10.1016/j.cam.2007.04.028zbMath1142.65050OpenAlexW1964845142MaRDI QIDQ2483351
Publication date: 28 April 2008
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2007.04.028
global optimizationglobal convergencenumerical resultsnonlinear optimizationconjugate gradient methoddescent direction
Related Items (11)
A descent hybrid conjugate gradient method based on the memoryless BFGS update ⋮ Nonlinear conjugate gradient methods with Wolfe type line search ⋮ Two families of self-adjusting spectral hybrid DL conjugate gradient methods and applications in image denoising ⋮ A descent Dai-Liao conjugate gradient method based on a modified secant equation and its global convergence ⋮ A spectral conjugate gradient method for solving large-scale unconstrained optimization ⋮ Globally convergent modified Perry's conjugate gradient method ⋮ New hybrid conjugate gradient and Broyden-Fletcher-Goldfarb-Shanno conjugate gradient methods ⋮ A new class of nonmonotone conjugate gradient training algorithms ⋮ A limited memory descent Perry conjugate gradient method ⋮ Two modified spectral conjugate gradient methods and their global convergence for unconstrained optimization ⋮ A modified Perry conjugate gradient method and its global convergence
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient generalized conjugate gradient algorithms. I: Theory
- Efficient hybrid conjugate gradient techniques
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
- Scaled conjugate gradient algorithms for unconstrained optimization
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- CUTE
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- Function minimization by conjugate gradients
- Convergence Conditions for Ascent Methods
- The conjugate gradient method in extremal problems
- Methods of conjugate gradients for solving linear systems
- A spectral conjugate gradient method for unconstrained optimization
- Benchmarking optimization software with performance profiles.
- An efficient hybrid conjugate gradient method for unconstrained optimization
This page was built for publication: Two descent hybrid conjugate gradient methods for optimization