Convergence of DFP algorithms without convexity and exact line search assumptions

DOI10.3969/J.ISSN.0253-374X.2013.02.023zbMATH Open1289.90204MaRDI QIDQ2860081

Meiling Liu, Dingguo Pu

Publication date: 19 November 2013

Published in: Journal of Tongji University. Natural Science (Search for Journal in Brave)

zbMATH Keywords

convergenceconvexityinexact line searchBroyden algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (4)

Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ Convergence of the DFP algorithm without exact line search ⋮ The revised DFP algorithm without exact line search

This page was built for publication: Convergence of DFP algorithms without convexity and exact line search assumptions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2860081)