Pages that link to "Item:Q1758038"
From MaRDI portal
The following pages link to A new supermemory gradient method for unconstrained optimization problems (Q1758038):
Displaying 13 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 variant of the memory gradient method for unconstrained optimization (Q1926613) (← links)
- Convergence of supermemory gradient method (Q2454990) (← links)
- A new super-memory gradient method with curve search rule (Q2571993) (← links)
- A memory gradient method based on the nonmonotone technique (Q2628189) (← links)
- A supermemory gradient method for unconstrained optimization (Q2720792) (← links)
- A new supermemory gradient method with a multi-step curve search rule (Q2885676) (← links)
- (Q3110681) (← links)
- (Q4381221) (← links)
- (Q4663258) (← links)
- A Family of Supermemory Gradient Projection Methods for Constrained Optimization (Q4805781) (← links)