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

A new three-term precondiditioned gradient memory algorithm for nonlinear optimization problems

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

zbMATH Open1180.90303MaRDI QIDQ3598514FDOQ3598514


Authors: Ivan S. Latif, Abbas Y. Al-Bayati Edit this on Wikidata


Publication date: 3 February 2009





Recommendations

  • A memory gradient method based on the nonmonotone technique
  • A new memory gradient method and its convergence
  • A new memory gradient method under exact line search
  • A family of three-term nonlinear conjugate gradient methods close to the memoryless BFGS method
  • Global convergence results of a three term memory gradient method with a non-monotone line search technique


zbMATH Keywords

unconstrained optimizationinexact line searchesself-scaling vm-updates


Mathematics Subject Classification ID

Nonlinear programming (90C30) Methods of reduced gradient type (90C52)



Cited In (1)

  • GLOBAL CONVERGENCE RESULTS OF A NEW THREE-TERM MEMORY GRADIENT METHOD





This page was built for publication: A new three-term precondiditioned gradient memory algorithm for nonlinear optimization problems

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

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