A new memory gradient method under exact line search
From MaRDI portal
Recommendations
Cited in
(19)- Convergence of line search methods for unconstrained optimization
- A new variant of the memory gradient method for unconstrained optimization
- A new descent memory gradient method and its global convergence
- Memory gradient method with Goldstein line search
- A new memoryless method based on weak quasi-Newton equations
- A memory gradient method with a closed-form stepsize formula
- scientific article; zbMATH DE number 6001285 (Why is no real title available?)
- scientific article; zbMATH DE number 5951924 (Why is no real title available?)
- A new parameter of memory gradient method
- Dai-Yuan memory gradient method for unconstrained optimization problem
- A new three-term precondiditioned gradient memory algorithm for nonlinear optimization problems
- scientific article; zbMATH DE number 1960973 (Why is no real title available?)
- Exact gradient methods with memory
- A new memory gradient method with errors
- Generalized memory gradient projection method for non-linear programming with non-linear equality and in-equality constraints
- scientific article; zbMATH DE number 2219406 (Why is no real title available?)
- A gradient-related algorithm with inexact line searches
- Strong global convergence of an adaptive nonmonotone memory gradient method
- Global convergence of a memory gradient method without line search
This page was built for publication: A new memory gradient method under exact line search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3626416)
