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

On the convergence of descent algorithms

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

DOI10.1023/A:1020570126636zbMath1028.90085OpenAlexW1516190874MaRDI QIDQ1856361

Jean-Paul Penot

Publication date: 19 January 2004

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1020570126636


zbMATH Keywords

gradient methoddescent methodCauchy methodCurry step


Mathematics Subject Classification ID

Methods of successive quadratic programming type (90C55)


Related Items (6)

Subdifferentials of distance functions, approximations and enlargements ⋮ Numerical optimization for the calculus of variations by gradients on non-Hilbert Sobolev spaces using conjugate gradients and normalized differential equations of steepest descent ⋮ Convergence of memory gradient methods ⋮ A convergence analysis of the method of codifferential descent ⋮ Conjugate gradient methods in Banach spaces ⋮ A numerical method for finding the optimal solution of a differential inclusion




This page was built for publication: On the convergence of descent algorithms

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1856361&oldid=14242833"
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 12:18.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki