Pages that link to "Item:Q849150"

The following pages link to Sufficient descent nonlinear conjugate gradient methods with conjugacy condition (Q849150):

Displaying 16 items.

• Two derivative-free projection approaches for systems of large-scale nonlinear monotone equations (Q369446) (← links)
• A descent Dai-Liao conjugate gradient method based on a modified secant equation and its global convergence (Q408488) (← links)
• Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization (Q438775) (← links)
• Globally convergent modified Perry's conjugate gradient method (Q440856) (← links)
• A limited memory descent Perry conjugate gradient method (Q518141) (← links)
• FR type methods for systems of large-scale nonlinear monotone equations (Q668736) (← links)
• A new class of nonmonotone conjugate gradient training algorithms (Q669374) (← links)
• A nonmonotone supermemory gradient algorithm for unconstrained optimization (Q741395) (← links)
• A conjugate gradient method with sufficient descent property (Q747726) (← links)
• Sufficient descent conjugate gradient methods for solving convex constrained nonlinear monotone equations (Q1723812) (← links)
• Some nonlinear conjugate gradient methods based on spectral scaling secant equations (Q2013630) (← links)
• A spectral conjugate gradient method for solving large-scale unconstrained optimization (Q2203770) (← links)
• An improved Polak-Ribière-Polyak conjugate gradient method with an efficient restart direction (Q2244998) (← links)
• A modified Perry conjugate gradient method and its global convergence (Q2355321) (← links)
• A memory gradient method based on the nonmonotone technique (Q2628189) (← links)
• Matrix Structures in Queuing Models (Q2971625) (← links)