Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Global convergence results of a three term memory gradient method with a non-monotone line search technique

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

DOI10.1016/S0252-9602(17)30274-6zbMath1214.90115OpenAlexW2783968151MaRDI QIDQ1774252

Qingying Sun

Publication date: 29 April 2005

Published in: Acta Mathematica Scientia. Series B. (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0252-9602(17)30274-6


zbMATH Keywords

convergencenonlinear programmingnumerical experimentnon-monotone line search techniquethree term memory gradient method


Mathematics Subject Classification ID

Nonlinear programming (90C30)


Related Items (1)

Generalized memory gradient projection method for non-linear programming with non-linear equality and in-equality constraints







This page was built for publication: Global convergence results of a three term memory gradient method with a non-monotone line search technique

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1774252&oldid=14121472"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 07:45.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki