Pages that link to "Item:Q2529760"
From MaRDI portal
The following pages link to Memory gradient method for the minimization of functions (Q2529760):
Displaying 37 items.
- A mixed-discrete particle swarm optimization algorithm with explicit diversity-preservation (Q381954) (← links)
- 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 nonmonotone supermemory gradient algorithm for unconstrained optimization (Q741395) (← links)
- Global convergence of modified HS conjugate gradient method (Q861482) (← links)
- Global convergence of a memory gradient method for unconstrained optimization (Q861515) (← links)
- A new class of supermemory gradient methods (Q865511) (← links)
- Strong global convergence of an adaptive nonmonotone memory gradient method (Q870222) (← links)
- Lanczos conjugate-gradient method and pseudoinverse computation on indefinite and singular systems (Q933807) (← links)
- Global convergence of a memory gradient method without line search (Q949285) (← links)
- A heuristic iterated-subspace minimization method with pattern search for unconstrained optimization (Q979825) (← links)
- A truncated Newton method with non-monotone line search for unconstrained optimization (Q1095799) (← links)
- Generalized conjugate directions (Q1102706) (← links)
- A supermemory gradient projection algorithm for optimization problems with nonlinear constraints (Q1210265) (← links)
- Supermemory descent methods for unconstrained minimization (Q1216859) (← links)
- Multi-search optimization techniques (Q1224952) (← links)
- Approximation methods for the unconstrained optimization (Q1234630) (← links)
- A generalized conjugate gradient algorithm (Q1265069) (← links)
- Successive element correction algorithms for sparse unconstrained optimization (Q1321350) (← links)
- New imperfect conjugate gradient algorithm (Q1369055) (← links)
- Conjugate gradient methods using value of objective function for unconstrained optimization (Q1758034) (← links)
- A new descent algorithm with curve search rule (Q1764727) (← links)
- SABRINA: a stochastic subspace majorization-minimization algorithm (Q2095568) (← links)
- An optimal subgradient algorithm with subspace search for costly convex optimization problems (Q2415906) (← links)
- Convergence of supermemory gradient method (Q2454990) (← links)
- Iterative computation of negative curvature directions in large scale optimization (Q2457949) (← links)
- Memory gradient method with Goldstein line search (Q2469911) (← links)
- On memory gradient method with trust region for unconstrained optimization (Q2492798) (← links)
- Relation between the memory gradient method and the Fletcher-Reeves method (Q2530377) (← links)
- Study on a supermemory gradient method for the minimization of functions (Q2532077) (← links)
- Unified approach to quadratically convergent algorithms for function minimization (Q2535817) (← links)
- Planar conjugate gradient algorithm for large-scale unconstrained optimization. I: Theory (Q2569193) (← links)
- New conjugate gradient-like methods for unconstrained optimization (Q2926084) (← links)
- Convergence of memory gradient methods (Q3518551) (← links)
- A response surface method-based hybrid optimizer (Q3541213) (← links)
- Recent advances in unconstrained optimization (Q5636700) (← links)
- A local MM subspace method for solving constrained variational problems in image recovery (Q6162148) (← links)