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

Approximate greatest descent method and quasi-Newton matrices in optimization

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

zbMATH Open1211.90232MaRDI QIDQ5390331FDOQ5390331


Authors: Zheng Peng, C. S. Lee, Junfeng Yang, Min Kong, B. S. Goh Edit this on Wikidata


Publication date: 1 April 2011





Recommendations

  • Greatest descent algorithms in unconstrained optimization
  • scientific article; zbMATH DE number 4025179
  • Matrix algebras in quasi-Newton methods for unconstrained minimization
  • Statistical Quasi-Newton: A New Look at Least Change
  • On the conditioning of the Hessian approximation in quasi-Newton methods


zbMATH Keywords

convergenceunconstrained optimizationNewton methodquasi-Newton methodgreatest descent direction


Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Mathematical programming (educational aspects) (97N60)



Cited In (3)

  • Approximate greatest descent methods for optimization with equality constraints
  • Title not available (Why is that?)
  • Approximate greatest descent in neural network optimization

Uses Software

  • AGD





This page was built for publication: Approximate greatest descent method and quasi-Newton matrices in optimization

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

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