Pages that link to "Item:Q5317554"

The following pages link to A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search (Q5317554):

Displaying 11 items.

• Using approximate secant equations in limited memory methods for multilevel unconstrained optimization (Q429494) (← links)
• Applying powell's symmetrical technique to conjugate gradient methods (Q540656) (← links)
• On a conjugate directions method for solving strictly convex QP problem (Q684136) (← links)
• A linear hybridization of the Hestenes-Stiefel method and the memoryless BFGS technique (Q723782) (← links)
• A conjugate gradient method for unconstrained optimization problems (Q963493) (← links)
• A derivative-free conjugate gradient method and its global convergence for solving symmetric nonlinear equations (Q1751397) (← links)
• The effects of control domain position on optimal control of cardiac arrhythmia (Q1952857) (← links)
• A hybridization of the Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods (Q2017614) (← links)
• An efficient conjugate gradient trust-region approach for systems of nonlinear equation (Q2313481) (← links)
• The Dai-Liao nonlinear conjugate gradient method with optimal parameter choices (Q2514763) (← links)
• A hybridization of the Hestenes–Stiefel and Dai–Yuan conjugate gradient methods based on a least-squares approach (Q3458811) (← links)