Algorithms for solving unconstrained optimization problems

The computational method of unconstrained optimization problem is an important research topic in the field of numerical computation. It is of great significance to solve the problem of unconstrained optimization. There are many ways that are applied to settle these questions, so we need to choose a method which owns much faster and less complex trait. Furthermore, in order to solve this rubs, this paper presents a comparative study of the common algorithms and our approach which are used to handle some concrete unconstrained optimization problems.