Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Convergence of DFP algorithm

From MaRDI portal
Publication:1908612
Jump to:navigation, search

zbMATH Open0840.65051MaRDI QIDQ1908612FDOQ1908612

Yaxiang Yuan

Publication date: 4 March 1996

Published in: Science in China. Series A (Search for Journal in Brave)




zbMATH Keywords

algorithmsconvergenceglobal convergenceunconstrained optimizationquasi-Newton methodDavidon-Fletcher-Powell methodDFP method


Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)



Cited In (6)

  • Title not available (Why is that?)
  • Title not available (Why is that?)
  • Convergence of the DFP algorithm without exact line search
  • An overview of nonlinear optimization
  • The projection technique for two open problems of unconstrained optimization problems
  • Title not available (Why is that?)






This page was built for publication: Convergence of DFP algorithm

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1908612&oldid=14322546"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 1 February 2024, at 14:11. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki