Global convergence of a modified spectral FR conjugate gradient method
From MaRDI portal
Publication:942404
DOI10.1016/j.amc.2008.03.020zbMath1154.65047OpenAlexW1989243384MaRDI QIDQ942404
Publication date: 5 September 2008
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2008.03.020
unconstrained optimizationglobal convergencenumerical examplesconjugate gradient methodline searchFletcher-RevesWolfe type
Related Items
A spectral dai-yuan-type conjugate gradient method for unconstrained optimization ⋮ An improved spectral conjugate gradient algorithm for nonconvex unconstrained optimization problems ⋮ A descent Dai-Liao conjugate gradient method based on a modified secant equation and its global convergence ⋮ Global convergence of a modified spectral conjugate gradient method ⋮ A hybrid conjugate gradient algorithm for nonconvex functions and its applications in image restoration problems ⋮ A spectral conjugate gradient method for solving large-scale unconstrained optimization ⋮ Globally convergent modified Perry's conjugate gradient method ⋮ A mixed spectral CD-DY conjugate gradient method ⋮ The smoothing FR conjugate gradient method for solving a kind of nonsmooth optimization problem with \(l_1\)-norm ⋮ An extension of the Fletcher-Reeves method to linear equality constrained optimization problem ⋮ A modified Perry's conjugate gradient method-based derivative-free method for solving large-scale nonlinear monotone equations ⋮ A sufficient descent nonlinear conjugate gradient method for solving \(\mathcal{M} \)-tensor equations ⋮ A spectral conjugate gradient method for nonlinear inverse problems ⋮ Real-time pricing method for smart grid based on social welfare maximization model ⋮ A modified Perry conjugate gradient method and its global convergence
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Further insight into the Shamanskii modification of Newton method
- Efficient generalized conjugate gradient algorithms. I: Theory
- Global convergence of the Fletcher-Reeves algorithm with inexact linesearch
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
- 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
- Testing Unconstrained Optimization Software
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- Function minimization by conjugate gradients
- A spectral conjugate gradient method for unconstrained optimization
- Global convergence of conjugate gradient methods without line search