Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4633273 | Applied Mathematics and Computation | 2009 | 6 Pages |
Abstract
In this paper, a new descent algorithm for solving unconstrained optimization problem is presented. Its search direction is descent and line search procedure can be avoided except for the first iteration. It is globally convergent under mild conditions. The search direction of the new algorithm is generalized and convergence of corresponding algorithm is also proved. Numerical results show that the algorithm is efficient for given test problems.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Guangming Zhou,