Pages that link to "Item:Q2571993"

The following pages link to A new super-memory gradient method with curve search rule (Q2571993):

Displaying 10 items.

• Supermemory gradient methods for monotone nonlinear equations with convex constraints (Q520272) (← links)
• A nonmonotone supermemory gradient algorithm for unconstrained optimization (Q741395) (← links)
• A new class of supermemory gradient methods (Q865511) (← links)
• A new supermemory gradient method for unconstrained optimization problems (Q1758038) (← links)
• Convergence of supermemory gradient method (Q2454990) (← links)
• A generalized super-memory gradient projection method of strongly sub-feasible directions with strong convergence for nonlinear inequality constrained optimization (Q2460608) (← links)
• Memory gradient method with Goldstein line search (Q2469911) (← links)
• A memory gradient method based on the nonmonotone technique (Q2628189) (← links)
• Memory gradient method for multiobjective optimization (Q2700431) (← links)
• A memory gradient method for non-smooth convex optimization (Q5266154) (← links)