| Abstract: | ![]()
We introduce a new method for solving a class of non-smooth unconstrained optimization problems. The method constructs a sequence<texlscub>x k texlscub>in ? n , and at the kth iteration, a search direction h k is considered, where h k is a solution to a variational inequality problem. A convergence theorem for our algorithm model and its discrete version can be easily proved. Furthermore, preliminary computational results show that the new method performs quite well and can compete with other methods. |
