Абстрактный
A Nonmonotone Line Search combination algorithm for unconstrained optimization problems
Ping Hu, Xiaocai Wang
In this paper we propose a nonmonotone line search combination rule for unconstrained optimization problems and show that it possesses the global convergence property. We establish the corresponding algorithm and illustrate its effectiveness by virtue of some numerical tests. Simulation results indicate that the proposed method is very effective
Отказ от ответственности: Этот реферат был переведен с помощью инструментов искусственного интеллекта и еще не прошел проверку или верификацию
