Gradient method with multiple damping for large-scale unconstrained optimization
Gradient methods are popular due to the fact that only gradient of the objective function is required. On the other hand, the methods can be very slow if the objective function is very ill-conditioned. One possible reason for the inefficiency of the gradient methods is that a constant criterion, whi...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Published: |
Springer
2019
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/80005/ https://link.springer.com/article/10.1007/s11590-018-1247-9 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Gradient methods are popular due to the fact that only gradient of the objective function is required. On the other hand, the methods can be very slow if the objective function is very ill-conditioned. One possible reason for the inefficiency of the gradient methods is that a constant criterion, which aims only at reducing the function value, has been used in choosing the steplength, and this leads to a stable dynamic system giving slow convergence. To overcome this, we propose a new gradient method with multiple damping, which works on the objective function and the norm of the gradient vector simultaneously. That is, the proposed method is constructed by combining damping with line search strategies, in which an individual adaptive parameter is proposed to damp the gradient vector while line searches are used to reduce the function value. Global convergence of the proposed method is established under both backtracking and nonmonotone line search. Finally, numerical results show that the proposed algorithm performs better than some well-known CG-based methods. |
|---|