𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Convergence proof of minimization algorithms for nonconvex functions

✍ Scribed by C. Sutti

Publisher
Springer
Year
1977
Tongue
English
Weight
384 KB
Volume
23
Category
Article
ISSN
0022-3239

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Low complexity secant quasi-Newton minim
Low complexity secant quasi-Newton minimization algorithms for nonconvex functions
✍ Carmine Di Fiore; Stefano Fanelli; Paolo Zellini πŸ“‚ Article πŸ“… 2007 πŸ› Elsevier Science 🌐 English βš– 205 KB

In this work some interesting relations between results on basic optimization and algorithms for nonconvex functions (such as BFGS and secant methods) are pointed out. In particular, some innovative tools for improving our recent secant BFGS-type and LQN algorithms are described in detail.