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
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Line search by curve fitting in minimization algorithms

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

DOI10.1007/BF01390709zbMath0683.65044OpenAlexW1995063955MaRDI QIDQ1824991

Yanyan Li

Publication date: 1987

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/133157


zbMATH Keywords

algorithmconvex programmingunconstrained minimizationcurve fittingline searchnumber of function evaluations


Mathematics Subject Classification ID

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


Related Items (1)

Line search by curve fitting in minimization algorithms




Cites Work

  • Global convergence rates for descent algorithms: Improved results for strictly convex problems
  • Line search by curve fitting in minimization algorithms
  • Line Search Techniques Based on Interpolating Polynomials using Function Values Only
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item




This page was built for publication: Line search by curve fitting in minimization algorithms

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