✦ LIBER ✦

Stepsize analysis for descent methods

✍ Scribed by A. I. Cohen

Publisher: Springer
Year: 1981
Tongue: English
Weight: 768 KB
Volume: 33
Category: Article
ISSN: 0022-3239
DOI: 10.1007/bf00935546

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Descent methods for inverse problems

✍ Ian Knowles 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 459 KB

Of fundamental importance in modelling is the problem of recovering coefficient functions in a differential equation from appropriate measurements on the solution; this is investigated by means of steepest descent techniques using certain new Banach space gradients.

Descent methods for quasidifferentiable

Descent methods for quasidifferentiable minimization

✍ Krzysztof C. Kiwiel 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 930 KB

Approximate Greatest Descent Methods for

✍ B. S. Goh 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 727 KB

Choosing a stepsize for Taylor series me

Choosing a stepsize for Taylor series methods for solving ODE'S

✍ George Corliss; David Lowery 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 506 KB

Problem-dependent upper and lower bounds are given for the stepsize taken by long Taylor series methods for solving initial value problems in ordinary differential equations. Taylor series methods recursively generate the terms of the Taylor series and estimate the radius of convergence as well as t

Supermemory descent methods for unconstr

Supermemory descent methods for unconstrained minimization

✍ M. A. Wolfe; C. Viazminsky 📂 Article 📅 1976 🏛 Springer 🌐 English ⚖ 644 KB

Steepest descent methods for multicriter

Steepest descent methods for multicriteria optimization

✍ Jörg Fliege; Benar Fux Svaiter 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 122 KB