Pages that link to "Item:Q3055065"
From MaRDI portal
The following pages link to Global convergence of the Polak-Ribière-Polyak conjugate gradient method with an Armijo-type inexact line search for nonconvex unconstrained optimization problems (Q3055065):
Displayed 14 items.
- An improved spectral conjugate gradient algorithm for nonconvex unconstrained optimization problems (Q364742) (← links)
- A self-adjusting spectral conjugate gradient method for large-scale unconstrained optimization (Q370232) (← links)
- Global convergence of a nonlinear conjugate gradient method (Q410397) (← links)
- Global convergence of a modified spectral conjugate gradient method (Q411054) (← links)
- Some global convergence properties of the Wei-Yao-Liu conjugate gradient method with inexact line search (Q531627) (← links)
- A nonmonotone supermemory gradient algorithm for unconstrained optimization (Q741395) (← links)
- Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization (Q1036299) (← links)
- An improved Wei-Yao-Liu nonlinear conjugate gradient method for optimization computation (Q1039699) (← links)
- Globally convergent Polak-Ribière-Polyak conjugate gradient methods under a modified Wolfe line search (Q1049322) (← links)
- A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs (Q2252688) (← links)
- A new version of the Liu-Storey conjugate gradient method (Q2381321) (← links)
- A Modified Hestenes-Stiefel Conjugate Gradient Algorithm for Large-Scale Optimization (Q2854330) (← links)
- A Modified PRP Conjugate Gradient Algorithm with Trust Region for Optimization Problems (Q3016307) (← links)
- A Trust Region Algorithm with Conjugate Gradient Technique for Optimization Problems (Q3083525) (← links)