
Summary: This paper explores the global convergence of the least-change secant method proposed by \textit{J. E. Dennis} and \textit{H. Wolkowicz} [SIAM J. Numer. Anal. 30, No. 5, 1291-1314 (1993; Zbl 0802.65081)]. This method is a member of the Broyden family, but it doesn't necessarily belong to the Broyden convex family. Furthermore, it can be very close to the DFP method. We will prove that this method, with the Wolfe line search on uniformly convex objective functions, is globally convergent.
global convergence, DW algorithm, Numerical mathematical programming methods, Broyden family, Nonlinear programming, Wolfe line search
global convergence, DW algorithm, Numerical mathematical programming methods, Broyden family, Nonlinear programming, Wolfe line search
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
