A simple sufficient descent method for unconstrained optimization
Summary: We develop a sufficient descent method for solving large-scale unconstrained optimization problems. At each iteration, the search direction is a linear combination of the gradient at the current and the previous steps. An attractive property of this method is that the generated directions are always descent. Under some appropriate conditions, we show that the proposed method converges globally. Numerical experiments on some unconstrained minimization problems from CUTEr library are reported, which illustrate that the proposed method is promising.
- A new method with sufficient descent property for unconstrained optimization
- scientific article; zbMATH DE number 7109378
- An efficient conjugate gradient method with sufficient descent property
- Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization
- Descent property and global convergence of a new search direction method for unconstrained optimization
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- A globally convergent version of the Polak-Ribière conjugate gradient method
- A limited memory BFGS-type method for large-scale unconstrained optimization
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- A Two-Term PRP-Based Descent Method
- Algorithm 851
- CUTE
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
- Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization
- Numerical Optimization
- Subspace techniques for nonlinear optimization
- Sufficient descent directions in unconstrained optimization
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Two-Point Step Size Gradient Methods
- Greatest descent algorithms in unconstrained optimization
- A new method with sufficient descent property for unconstrained optimization
- A reduced-space line-search method for unconstrained optimization via random descent directions
- On the method of shortest residuals for unconstrained optimization
- A descent method for unconstrained optimization problems
- Sufficient descent directions in unconstrained optimization
This page was built for publication: A simple sufficient descent method for unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q613840)
