Pages that link to "Item:Q2530377"
From MaRDI portal
The following pages link to Relation between the memory gradient method and the Fletcher-Reeves method (Q2530377):
Displayed 15 items.
- Generalized memory gradient projection method for non-linear programming with non-linear equality and in-equality constraints (Q545595) (← links)
- A gradient-related algorithm with inexact line searches (Q596214) (← links)
- A new class of supermemory gradient methods (Q865511) (← links)
- Generalized conjugate directions (Q1102706) (← links)
- Multi-search optimization techniques (Q1224952) (← links)
- Approximation methods for the unconstrained optimization (Q1234630) (← 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)
- Memory gradient method with Goldstein line search (Q2469911) (← links)
- On memory gradient method with trust region for unconstrained optimization (Q2492798) (← links)
- Memory gradient method for the minimization of functions (Q2529760) (← links)
- Relation between the memory gradient method and the Fletcher-Reeves method (Q2530377) (← links)
- Unified approach to quadratically convergent algorithms for function minimization (Q2535817) (← links)
- Recent advances in unconstrained optimization (Q5636700) (← links)