(Enter summary)
Abstract: The problem of finding a point that satisfies the sufficient decrease and curvature condition
is formulated in terms of finding a point in a set T (). We describe a search algorithms 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... (Update)
Context of citations to this paper: More
...this information, with ALTERNATE, which does not. The three methods use the same line search. It is performed by the routine of Mor e and Thuente [8] with parameters c 1 =10 ;4 and c 2 =0:9 in (1.4) 1.5) Wechose the following quartic objective function in n = 100 variables...
...iterate to this approximate minimizer. Finally a line search is performed along the search direction using the subroutine described in [17]. A novel feature of the algorithm is that the limited memory BFGS matrices are represented in a compact form [7] that is efficient...
Cited by: More
Towards a Discrete Newton Method with Memory for.. - Byrd, Nocedal, Zhu (1996)
(Correct)
Acoustic Modeling With Mixtures of Subspace Constrained .. - Karthik Visweswariah.. (2003)
(Correct)
A Limited Memory Algorithm for Bound Constrained Optimization - Byrd, Lu, Nocedal, Zhu (1994)
(Correct)
Active bibliography (related documents): More All
0.5: Least Squares Approximation By Splines With Free Knots - Hubert Schwetlick, Torsten .. (1995)
(Correct)
0.5: Efficient Training of Feed-Forward Neural Networks - Møller (1997)
(Correct)
0.4: Preconditioning Newton's Method - Bouaricha, Moré, Wu (1998)
(Correct)
Similar documents based on text: More All
0.1: NEOS and CONDOR: Solving Optimization Problems Over the.. - Ferris, Mesnier.. (1998)
(Correct)
0.1: Impact of Partial Separability on Large-Scale.. - Bouaricha, Moré (1995)
(Correct)
0.1: The Network-Enabled Optimization System (NEOS) Server - Czyzyk, Mesnier, More (1996)
(Correct)
Related documents from co-citation: More All
5: the limited memory BFGS method for large scale optimization
- Liu, Nocedal - 1989
4: Some numerical experiments with variable storage quasi-newton algorithms (context) - Gilbert, Lemarechal - 1989
4: Numerical Methods for Unconstrained Optimization and Nonlinear Equations (context) - Dennis, Schnabel - 1983
BibTeX entry: (Update)
J. J. Mor'e and D.J. Thuente, "Line search algorithms with guaranteed sufficient decrease," ACM Transactions on Mathematical Software 20 (1994), no. 3, pp. 286-307. http://citeseer.ist.psu.edu/more92line.html More
@misc{ mor'e94line,
author = "J. Mor'e and D. Thuente",
title = "Line search algorithms with guaranteed sufficient decrease",
text = "J. J. Mor'e and D.J. Thuente, Line search algorithms with guaranteed sufficient
decrease, ACM Transactions on Mathematical Software 20 (1994), no. 3, pp.
286-307.",
year = "1994",
url = "citeseer.ist.psu.edu/more92line.html" }
Citations (may not include all citations):
650
Numerical Methods for Unconstrained Optimization and Nonline.. (context) - Dennis, Schnabel - 1983
78
the limited memory BFGS method for large scale optimization
- Liu, Nocedal - 1989
31
Global convergence properties of conjugate gradient methods .. (context) - Gilbert, Nocedal - 1992
28
Some global convergence properties of a variable metric meth.. (context) - Powell - 1976
21
Global convergence of a class of quasiNewton methods on conv.. (context) - Byrd, Nocedal et al. - 1987
19
TNPACK -- A truncated Newton minimization package for large-.. (context) - Schlick, Fogelson - 1992
12
Descent property and global convergence of the Fletcher-Reev.. (context) - Al-Baali - 1985
11
Robust regression computation using iteratively reweighted l.. (context) - O'Leary - 1990
9
Minimization of unconstrained multivariate functions (context) - Shanno, Phua - 1976
7
Newton's method (context) - Mor'e, Sorensen - 1984
4
ACM Trans (context) - Algorithm - 1980
3
Implementations examples (context) - --, Newton et al. - 1992
3
Two steplength algorithms for numerical optimization (context) - Gill, Murray et al. - 1979
2
An efficient line search for nonlinear least squares (context) - Al-Baali, Fletcher - 1984
2
Safeguarded steplength algorithms for optimization using des.. (context) - Gill, Murray - 1974
1
Practical Methods of Optimization Volume 1: Unconstrained Op.. (context) - Fletcher - 1980
1
Interpolation methods in one dimensional optimization (context) - Yanai, Ozawa et al. - 1981
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www-fp.mcs.anl.gov/division/publications/abstracts/abstracts93.htm): More
p4-Linda: A Portable Implementation of Linda - Butler, Leveton, Lusk
(Correct)
Glassy Motion of an Elastic String - Kaper, Leaf, Levine, Vinokur (1993)
(Correct)
Parallel Language Constructs for Paradigm Integration and.. - Chandy, Foster (1994)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC