Pages that link to "Item:Q1216859"
From MaRDI portal
The following pages link to Supermemory descent methods for unconstrained minimization (Q1216859):
Displaying 13 items.
- A gradient-related algorithm with inexact line searches (Q596214) (← links)
- A quasi-Newton based pattern search algorithm for unconstrained optimization (Q864827) (← links)
- A new class of supermemory gradient methods (Q865511) (← links)
- A new quasi-Newton pattern search method based on symmetric rank-one update for unconstrained optimization (Q931755) (← links)
- A heuristic iterated-subspace minimization method with pattern search for unconstrained optimization (Q979825) (← 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)
- On memory gradient method with trust region for unconstrained optimization (Q2492798) (← links)
- Solving unconstrained optimization problem with a filter-based nonmonotone pattern search algorithm (Q2518730) (← links)
- Memory gradient method for multiobjective optimization (Q2700431) (← links)
- Convergence of memory gradient methods (Q3518551) (← links)
