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):
Displaying 27 items.
- A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations (Q255074) (← links)
- A limited memory BFGS algorithm for non-convex minimization with applications in matrix largest eigenvalue problem (Q283997) (← links)
- A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems (Q295480) (← links)
- Convergence properties of a class of nonlinear conjugate gradient methods (Q336596) (← links)
- 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)
- A modified three-term PRP conjugate gradient algorithm for optimization models (Q527794) (← 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 Wei-Yao-Liu conjugate gradient method for unconstrained optimization (Q1644524) (← links)
- A new conjugate gradient algorithm with sufficient descent property for unconstrained optimization (Q1665439) (← links)
- A modified conjugacy condition and related nonlinear conjugate gradient method (Q1718989) (← links)
- A hybrid of DL and WYL nonlinear conjugate gradient methods (Q1723746) (← links)
- A scaled three-term conjugate gradient method for large-scale unconstrained optimization problem (Q2009756) (← links)
- Modified three-term Liu-Storey conjugate gradient method for solving unconstrained optimization problems and image restoration problems (Q2209686) (← links)
- A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs (Q2252688) (← links)
- A hybrid conjugate gradient method with descent property for unconstrained optimization (Q2337555) (← links)
- Three modified Polak-Ribière-Polyak conjugate gradient methods with sufficient descent property (Q2340983) (← 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)
