Affiliation:
1. Argonne National Lab, Argonne, IL
Abstract
The development of software for minimization problems is often based on a line search method. We consider line search methods that satisfy sufficient decrease and curvature conditions, and formulate the problem of determining a point that satisfies these two conditions in terms of finding a point in a set
T(μ)
. We describe a search algorithm for this problem that produces a sequence of iterates that converge to a point in
T(μ)
and that, except for pathological cases, terminates in a finite number of steps. Numerical results for an implementation of the search algorithm on a set of test functions show that the algorithm terminates within a small number of iterations.
Publisher
Association for Computing Machinery (ACM)
Subject
Applied Mathematics,Software
Reference20 articles.
1. Descent property and global convergence of the Fletcher-Reeves method with inexact line searches;AL-BAALI M.;IMA J. Namer. Anal.,1985
2. An efficient line search for nonlinear least squares
3. Global convergence of a class of quasi-Newton methods on convex problems;BYRD R. H.;SIAM J. Numer. Anal.,1987
4. DE~ J. E. A~D SCm~AB~L R. E. 1983. N~rner~cal Method~ for Unconstrained Optimization and Nonhnear Equations. Prentice-Hall Englewood Cliffs N.J. DE~ J. E. A~D SCm~AB~L R. E. 1983. N~rner~cal Method~ for Unconstrained Optimization and Nonhnear Equations. Prentice-Hall Englewood Cliffs N.J.
5. FLETCHER R. 1980. ractzcal Methods of Optzmizat~on. Vol. 1. Unconstrained Optlmization. Wiley New York FLETCHER R. 1980. ractzcal Methods of Optzmizat~on. Vol. 1. Unconstrained Optlmization. Wiley New York
Cited by
364 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献