Memory gradient method for the minimization of functions
From MaRDI portal
Cites work
Cited in
(39)- A truncated Newton method with non-monotone line search for unconstrained optimization
- Generalized conjugate directions
- A supermemory gradient projection algorithm for optimization problems with nonlinear constraints
- Supermemory descent methods for unconstrained minimization
- Multi-search optimization techniques
- Approximation methods for the unconstrained optimization
- A generalized conjugate gradient algorithm
- Successive element correction algorithms for sparse unconstrained optimization
- New imperfect conjugate gradient algorithm
- Conjugate gradient methods using value of objective function for unconstrained optimization
- A new descent algorithm with curve search rule
- SABRINA: a stochastic subspace majorization-minimization algorithm
- An optimal subgradient algorithm with subspace search for costly convex optimization problems
- Convergence of supermemory gradient method
- Iterative computation of negative curvature directions in large scale optimization
- Memory gradient method with Goldstein line search
- On memory gradient method with trust region for unconstrained optimization
- Relation between the memory gradient method and the Fletcher-Reeves method
- Study on a supermemory gradient method for the minimization of functions
- Unified approach to quadratically convergent algorithms for function minimization
- Planar conjugate gradient algorithm for large-scale unconstrained optimization. I: Theory
- New conjugate gradient-like methods for unconstrained optimization
- Convergence of memory gradient methods
- A response surface method-based hybrid optimizer
- A mixed-discrete particle swarm optimization algorithm with explicit diversity-preservation
- Generalized memory gradient projection method for non-linear programming with non-linear equality and in-equality constraints
- Recent advances in unconstrained optimization
- A gradient-related algorithm with inexact line searches
- A local MM subspace method for solving constrained variational problems in image recovery
- Convergence analysis of block majorize-minimize subspace approach
- A globally convergent Riemannian memory gradient method
- A nonmonotone supermemory gradient algorithm for unconstrained optimization
- Global convergence of modified HS conjugate gradient method
- Global convergence of a memory gradient method for unconstrained optimization
- A new class of supermemory gradient methods
- Strong global convergence of an adaptive nonmonotone memory gradient method
- Lanczos conjugate-gradient method and pseudoinverse computation on indefinite and singular systems
- Global convergence of a memory gradient method without line search
- A heuristic iterated-subspace minimization method with pattern search for unconstrained optimization
This page was built for publication: Memory gradient method for the minimization of functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2529760)
