Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

An improved line search technique

An improved line search technique A current version of the Davies, Swann and Campey algorithm is stated. An estimate of the error at each iteration is then derived. This estimate is used to show that the current version is inefficient in a certain sense. A modified algorithm is then defined, implemented, and tested. The results show that the error estimate is accurate and the new algorithm is faster. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM SIGMAP Bulletin Association for Computing Machinery

An improved line search technique

ACM SIGMAP Bulletin , Volume (25) – Dec 1, 1978

Loading next page...
 
/lp/association-for-computing-machinery/an-improved-line-search-technique-Xvyk5Ofk4r
Publisher
Association for Computing Machinery
Copyright
Copyright © 1978 by ACM Inc.
ISSN
0163-5786
DOI
10.1145/1111237.1111240
Publisher site
See Article on Publisher Site

Abstract

A current version of the Davies, Swann and Campey algorithm is stated. An estimate of the error at each iteration is then derived. This estimate is used to show that the current version is inefficient in a certain sense. A modified algorithm is then defined, implemented, and tested. The results show that the error estimate is accurate and the new algorithm is faster.

Journal

ACM SIGMAP BulletinAssociation for Computing Machinery

Published: Dec 1, 1978

There are no references for this article.