Pages that link to "Item:Q2720792"
From MaRDI portal
The following pages link to A supermemory gradient method for unconstrained optimization (Q2720792):
Displaying 13 items.
- A gradient-related algorithm with inexact line searches (Q596214) (← links)
- A nonmonotone supermemory gradient algorithm for unconstrained optimization (Q741395) (← links)
- A new class of supermemory gradient methods (Q865511) (← links)
- A supermemory gradient projection algorithm for optimization problems with nonlinear constraints (Q1210265) (← links)
- A new supermemory gradient method for unconstrained optimization problems (Q1758038) (← links)
- A new descent algorithm with curve search rule (Q1764727) (← links)
- A new variant of the memory gradient method for unconstrained optimization (Q1926613) (← 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)
- A new supermemory gradient method with a multi-step curve search rule (Q2885676) (← links)
- (Q3016832) (← links)
- (Q4663258) (← links)
- A Family of Supermemory Gradient Projection Methods for Constrained Optimization (Q4805781) (← links)