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

The convergence of Broyden algorithm without convexity and exact line search

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

zbMATH Open1274.90391MaRDI QIDQ4927862FDOQ4927862


Authors: Dingguo Pu, Aifen Feng, Zhenyang Sun, Youlin Shang Edit this on Wikidata


Publication date: 20 June 2013





Recommendations

  • scientific article; zbMATH DE number 1208852
  • Convergence of DFP algorithms without convexity and exact line search assumptions
  • scientific article; zbMATH DE number 857603
  • The convergence of Broyden algorithms for LC gradient function
  • Global convergence of the Broyden's class of quasi-Newton methods with nonmonotone linesearch


zbMATH Keywords

convergenceconvexityexact line searchBroyden algorithm


Mathematics Subject Classification ID

Nonlinear programming (90C30)



Cited In (5)

  • Title not available (Why is that?)
  • Title not available (Why is that?)
  • A convergence result for the \(B\)-algorithm
  • The convergence of Broyden algorithms for LC gradient function
  • Convergence of DFP algorithms without convexity and exact line search assumptions





This page was built for publication: The convergence of Broyden algorithm without convexity and exact line search

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

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