Affiliation:
1. Department of Mathematics, Faculty of Technology and Metallurgy, Belgrade
Abstract
In this paper a multi-step algorithm for LC1 unconstrained optimization problems is presented. This method uses previous multi-step iterative information and curve search to generate new iterative points. A convergence proof is given, as well as an estimate of the rate of convergence.
Publisher
National Library of Serbia
Subject
Management Science and Operations Research
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献