A new class of memory gradient methods and its global convergence
From MaRDI portal
Recommendations
Cited in
(22)- A new variant of the memory gradient method for unconstrained optimization
- A new descent memory gradient method and its global convergence
- A memory efficient incremental gradient method for regularized minimization
- A new memory gradient method and its convergence
- Derivation and global convergence for memoryless non-quasi-Newton method
- A new method for unconstrained optimization problem
- scientific article; zbMATH DE number 6001451 (Why is no real title available?)
- scientific article; zbMATH DE number 6001261 (Why is no real title available?)
- GLOBAL CONVERGENCE RESULTS OF A NEW THREE-TERM MEMORY GRADIENT METHOD
- scientific article; zbMATH DE number 5951924 (Why is no real title available?)
- scientific article; zbMATH DE number 5007451 (Why is no real title available?)
- The memory gradient methods for unconstrained optimization
- A new parameter of memory gradient method
- Convergence of memory gradient methods
- A new class of memory gradient methods with Wolfe line search
- A new memory gradient method under exact line search
- A new class of memory gradient methods with inexact line searches
- scientific article; zbMATH DE number 7313238 (Why is no real title available?)
- Global convergence of a class of memory gradient method with the Wolfe line search
- scientific article; zbMATH DE number 2219406 (Why is no real title available?)
- Global convergence of a memory gradient method for unconstrained optimization
- Global convergence of a memory gradient method without line search
This page was built for publication: A new class of memory gradient methods and its global convergence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3072256)
