Nazareth, J.L. (1982). Analogues of Dixon's and Powell's Theorems for Unconstrained Minimization with Inexact Line Searches. IIASA Working Paper. IIASA, Laxenburg, Austria: WP-82-100
Preview |
Text
WP-82-100.pdf Download (212kB) | Preview |
Abstract
By modifying the way in which search directions are defined, we show how to relax the restrictive assumption that line searches must be exact in the theorems of Dixon and Powell. We show also that the BFGS algorithm modified in this way is equivalent to the three-term-recurrence (TTR) method for quadratic functions.
Item Type: | Monograph (IIASA Working Paper) |
---|---|
Research Programs: | System and Decision Sciences - Core (SDS) |
Depositing User: | IIASA Import |
Date Deposited: | 15 Jan 2016 01:51 |
Last Modified: | 27 Aug 2021 17:10 |
URI: | https://pure.iiasa.ac.at/1916 |
Actions (login required)
View Item |