IIASA RepositoryAnalogues of Dixon’s and Powell’s Theorems for Unconstrained Minimization with Inexact Line SearchesJ.NazarethauthorDixon’s theorem (Math. Programming, 2 (1972), PP. 383–387) states that all variable metric methods in the Broyden class develop identical iterates when line searches are exact. Powell’s theorem (Rep. TP 495, AERE, Harwell, England, 1972) is a variant on this, which states that under similar conditions, the Hessian approximation developed by a BFGS update at any step is independent of the updates used at earlier steps. By modifying the way in which search directions are defined, we show how to remove the restrictive assumption on line searches in these two theorems. We show also that the BFGS algorithm, modified in this way, is equivalent to the three-term-recurrence (TTR) method on quadratic functions. Algorithmic implications are discussed and the results of some numerical experimentation are reported.1986-02Society for Industrial and Applied MathematicsArticle

For work being deposited by its own author: In self-archiving this collection of files and associated bibliographic metadata, I grant IIASA Repository the right to store them and to make them permanently available publicly for free on-line. I declare that this material is my own intellectual property and I understand that IIASA Repository does not assume any responsibility if there is any breach of copyright in distributing these files or metadata. (All authors are urged to prominently assert their copyright on the title page of their work.)

For work being deposited by someone other than its author: I hereby declare that the collection of files and associated bibliographic metadata that I am archiving at IIASA Repository) is in the public domain. If this is not the case, I accept full responsibility for any breach of copyright that distributing these files or metadata may entail.

Clicking on the deposit button indicates your agreement to these terms.