Publication Cover
Optimization
A Journal of Mathematical Programming and Operations Research
Volume 51, 2002 - Issue 2
44
Views
0
CrossRef citations to date
0
Altmetric
Original Articles

A NOTE ON THE CONVERGENCE OF THE DFP ALGORITHM ON QUADRATIC UNIFORMLY CONVEX FUNCTIONS

, &
Pages 339-352 | Received 12 Oct 1999, Published online: 10 Jan 2008
 

Abstract

This paper analyzes the open question of the convergence of the DFP algorithm with inexact line searches. We prove that the DFP algorithm is convergent for quadratic uniformly convex function with commonly used inexact line searches.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.