Pages that link to "Item:Q1286637"

The following pages link to Convergence properties of the Beale-Powell restart algorithm (Q1286637):

Displaying 14 items.

• The convergence rate of a restart MFR conjugate gradient method with inexact line search (Q387662) (← links)
• \(n\)-step quadratic convergence of the MPRP method with a restart strategy (Q633952) (← links)
• New version of the three-term conjugate gradient method based on spectral scaling conjugacy condition that generates descent search direction (Q668710) (← links)
• On the convergence of \(s\)-dependent GFR conjugate gradient method for unconstrained optimization (Q1652787) (← links)
• Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization (Q2267641) (← links)
• Convergence of descent method without line search (Q2570691) (← links)
• A new super-memory gradient method with curve search rule (Q2571993) (← links)
• Rate of Convergence of a Restarted CG-DESCENT Method (Q2841919) (← links)
• A scaled nonlinear conjugate gradient algorithm for unconstrained optimization (Q3514834) (← links)
• An Efficient Mixed Conjugate Gradient Method for Solving Unconstrained Optimisation Problems (Q5014270) (← links)
• Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization (Q5436920) (← links)
• The convergence rate of a three-term HS method with restart strategy for unconstrained optimization problems (Q5495597) (← links)
• A family of hybrid conjugate gradient method with restart procedure for unconstrained optimizations and image restorations (Q6047884) (← links)
• Adaptive trust-region method on Riemannian manifold (Q6111659) (← links)