Q4254734
type: Item
instance of: scholarly article
zbMATH Open document ID: 0927.65072
publication date: 1999-10-05T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 1310905
zbMATH Keywords: convex quadratic programming
zbMATH Keywords: global convergence
zbMATH Keywords: Dennis-Fletcher-Powell algorithm
zbMATH Keywords: tracing line search
zbMATH Keywords: superlinear convergence
author: Dachuan Xu
MaRDI profile type: Publication
Recommended article: Q5287741
Recommended article: Convergence of the DFP algorithm without exact line search
Recommended article: Q4213851
Recommended article: Q3365124
Recommended article: Q4528283
Recommended article: Convergence of DFP algorithms without convexity and exact line search assumptions
Recommended article: Q3835310
Recommended article: On the convergence property of the DFP algorithm
Recommended article: Convergence of DFP algorithm
Recommended article: Superlinear convergence of the DFP algorithm without exact line search
description: scientific article; zbMATH DE number 1310905