𝔖 Bobbio Scriptorium

✦ LIBER ✦

Superlinear convergence of the DFP algorithm without exact line search

✍ Scribed by Pu Dingguo

Book ID: 110619987
Publisher: Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year: 2001
Tongue: English
Weight: 143 KB
Volume: 17
Category: Article
ISSN: 0168-9673
DOI: 10.1007/bf02677389

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Convergence of the DFP Algorithm Without

Convergence of the DFP Algorithm Without Exact Line Search

✍ D. Pu 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 150 KB

Examples of non-convergence of conjugate

Examples of non-convergence of conjugate descent algorithms with exact line-searches

✍ J. R. Thompson 📂 Article 📅 1977 🏛 Springer-Verlag 🌐 English ⚖ 276 KB

A counterexample of the convergence of R

A counterexample of the convergence of Rosen's algorithm with inexact line search

✍ X.-D. Hu 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 118 KB

On the convergence of multiplicative ite

On the convergence of multiplicative iterative algorithms with inexact line search

✍ Xiaoguang Yang 📂 Article 📅 1997 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 285 KB

The Global Convergence of Self-Scaling B

The Global Convergence of Self-Scaling BFGS Algorithm with Nonmonotone Line Search for Unconstrained Nonconvex Optimization Problems

✍ Hong Xia Yin; Dong Lei Du 📂 Article 📅 2006 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 158 KB

The convergence of a new modified BFGS m

The convergence of a new modified BFGS method without line searches for unconstrained optimization or complexity systems

✍ Liying Liu; Zengxin Wei; Xiaoping Wu 📂 Article 📅 2010 🏛 Academy of Mathematics and Systems Science, Chines 🌐 English ⚖ 188 KB