Pages that link to "Item:Q741395"
From MaRDI portal
The following pages link to A nonmonotone supermemory gradient algorithm for unconstrained optimization (Q741395):
Displaying 11 items.
- Supermemory gradient methods for monotone nonlinear equations with convex constraints (Q520272) (← links)
- A supermemory gradient projection algorithm for optimization problems with nonlinear constraints (Q1210265) (← links)
- Memory gradient method for multiobjective optimization (Q2700431) (← links)
- A new nonmonotone gradient-path algorithm for unconstrained optimization (Q2916267) (← links)
- (Q4381221) (← links)
- (Q4663258) (← links)
- A Family of Supermemory Gradient Projection Methods for Constrained Optimization (Q4805781) (← links)
- A memory gradient method for non-smooth convex optimization (Q5266154) (← links)
- The higher-order Levenberg–Marquardt method with Armijo type line search for nonlinear equations (Q5268935) (← links)
- A CLASS OF NONMONOTONE SPECTRAL MEMORY GRADIENT METHOD (Q5850815) (← links)
- Convergence of a new nonmonotone memory gradient method for unconstrained multiobjective optimization via robust approach (Q6561498) (← links)