A new class of supermemory gradient methods
An unconstrained optimization problem consisting in minimizing a continuously differentiable function \(f:\mathbb R^n\to \mathbb R^1\) is considered. A new class of supermemory gradient methods for the unconstrained minimization problem is proposed. Conditions, which guarantee global convergence are presented. In a sufficiently small neighborhood of the optimal solution the algorithms can be reduced to quasi-Newton methods. Unlike to many line search methods, the proposed algorithms use not only the current iterative information, but also some information, which can be obtained from preceding iterations. Numerical results reported in the concluding part of the paper show the effectiveness of the proposed algorithms in practical computation.
- A class on nonmonotone stabilization methods in unconstrained optimization
- A globally convergent version of the Polak-Ribière conjugate gradient method
- A limited-memory multipoint symmetric secant method for bound constrained optimization
- A new descent algorithm with curve search rule
- A new super-memory gradient method with curve search rule
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A Numerical Study of the Limited Memory BFGS Method and the Truncated-Newton Method for Large Scale Optimization
- A subspace limited memory quasi-Newton algorithm for large-scale nonlinear bound constrained optimization
- Automatic Preconditioning by Limited Memory Quasi-Newton Updating
- Conjugate Directions without Linear Searches
- Convergence of multi-step curve search method for unconstrained optimization
- Convergence of Newton's method for convex best interpolation
- Convergence of quasi-Newton method with new inexact line search
- Function minimization by conjugate gradients
- Global convergence of the method of shortest residuals
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Global convergence result for conjugate gradient methods
- scientific article; zbMATH DE number 1004164 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 977904 (Why is no real title available?)
- scientific article; zbMATH DE number 6173889 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- scientific article; zbMATH DE number 7590304 (Why is no real title available?)
- Improved Hessian approximations for the limited memory BFGS method
- Limited memory quasi-Newton method for large-scale linearly equality-constrained minimization
- Limited-Memory Reduced-Hessian Methods for Large-Scale Unconstrained Optimization
- Line search termination criteria for collinear scaling algorithms for minimizing a class of convex functions
- Matrix algebras in quasi-Newton methods for unconstrained minimization
- Memory gradient method for the minimization of functions
- New inexact line search method for unconstrained optimization
- New properties of a nonlinear conjugate gradient method
- On the limited memory BFGS method for large scale optimization
- Quadratically convergent algorithms and one-dimensional search schemes
- Relation between the memory gradient method and the Fletcher-Reeves method
- Shifted limited-memory variable metric methods for large-scale unconstrained optimization
- Study on a supermemory gradient method for the minimization of functions
- Supermemory descent methods for unconstrained minimization
- Testing Unconstrained Optimization Software
- Updating the self-scaling symmetric rank one algorithm with limited memory for large-scale unconstrained optimization
- A new supermemory gradient method for unconstrained optimization problems
- Convergence of supermemory gradient method
- A supermemory gradient method for unconstrained optimization
- A new supermemory gradient method with a multi-step curve search rule
- scientific article; zbMATH DE number 6001451 (Why is no real title available?)
- scientific article; zbMATH DE number 2150661 (Why is no real title available?)
- A Family of Supermemory Gradient Projection Methods for Constrained Optimization
- A non-monotone super-memory gradient method based on trust region technique
- A globally convergent Riemannian memory gradient method
This page was built for publication: A new class of supermemory gradient methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q865511)
