A perfect example for the BFGS method
type: Item
instance of: scholarly article
title: A perfect example for the BFGS method
zbMATH Open document ID: 1262.49040
author: Yuhong Dai
published in: Mathematical Programming. Series A. Series B
publication date: 2013-05-06T00:00:00Z
Mathematics Subject Classification ID: 49M37
Mathematics Subject Classification ID: 49M15
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 6160895
zbMATH Keywords: unconstrained optimization
zbMATH Keywords: quasi-Newton method
zbMATH Keywords: non-convex function
zbMATH Keywords: global convergence
MaRDI profile type: Publication
full work available at URL: s10107-012-0522-2
OpenAlex ID: W2116538711
cites work: Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
cites work: The Convergence of a Class of Double-rank Minimization Algorithms
cites work: Convergence Properties of the BFGS Algoritm
cites work: Variable Metric Method for Minimization
cites work: Quasi-Newton Methods, Motivation and Theory
cites work: A new approach to variable metric algorithms
cites work: Q4840579
cites work: A Rapidly Convergent Descent Method for Minimization
cites work: A Family of Variable-Metric Methods Derived by Variational Means
cites work: Global optimization with polynomials and the problem of moments
cites work: On the global convergence of the BFGS method for nonconvex unconstrained optimization problems
cites work: The BFGS method with exact line searches fails for non-convex objective functions
cites work: Q4016506
cites work: On the Convergence of the Variable Metric Algorithm
cites work: Q4107408
cites work: Q3313210
cites work: On the convergence of the DFP algorithm for unconstrained optimization when there are only two variables
cites work: Conditioning of Quasi-Newton Methods for Function Minimization
cites work: Q3802887
cites work: Optimization theory and methods. Nonlinear programming
DOI: 10.1007/S10107-012-0522-2
description: scientific article; zbMATH DE number 6160895