New search direction of steepest descent method for large-scaled unconstrained optimization problem
The steepest descent (SD) method is well-known as the simplest method in optimization. In this paper, we propose a new SD search direction for solving unconstrained optimization problems. We also prove that the method is globally convergent with exact line search for general objectives functions. Th...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
2018
|
| Subjects: | |
| Online Access: | View Fulltext in Publisher |