On the Local and Superlinear Convergence of a Parameterized DFP Method

DOI10.1080/01630563.2013.809736zbMath1321.90153OpenAlexW2061283479MaRDI QIDQ5409730

Ping-Qi Pan, Shi-Pei Zhang, Lei-Hong Zhang

Publication date: 14 April 2014

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01630563.2013.809736

zbMATH Keywords

linear convergencesuperlinear convergencequasi-Newton equationDFP updating formulahereditary positive definiteness

Mathematics Subject Classification ID

Nonlinear programming (90C30) Methods of quasi-Newton type (90C53)

Cites Work

• Unnamed Item
• Unnamed Item
• New quasi-Newton equation and related methods for unconstrained optimization
• Modifying the BFGS method
• A classification of quasi-Newton methods
• The superlinear convergence of a modified BFGS-type method for unconstrained optimization
• The revised DFP algorithm without exact line search
• Optimization theory and methods. Nonlinear programming
• Unified approach to quadratically convergent algorithms for function minimization
• Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
• On the Global Convergence of Broyden's Method
• Quasi-Newton Methods, Motivation and Theory
• An assessment of two approaches to variable metric methods
• Numerical Optimization
• On the Local and Superlinear Convergence of Quasi-Newton Methods
• Quasi-Newton Methods for Unconstrained Optimization
• A modified BFGS method and its global convergence in nonconvex minimization
• Properties and numerical performance of quasi-Newton methods with modified quasi-Newton equations
• A survey of quasi-Newton equations and quasi-Newton methods for optimization
• Convergence of the DFP algorithm without exact line search

This page was built for publication: On the Local and Superlinear Convergence of a Parameterized DFP Method