𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Low-complexity minimization algorithms

✍ Scribed by Carmine Di Fiore; Stefano Fanelli; Paolo Zellini

Publisher
John Wiley and Sons
Year
2005
Tongue
English
Weight
139 KB
Volume
12
Category
Article
ISSN
1070-5325

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.

Low Complexity Algorithms for Electronic
Low Complexity Algorithms for Electronic Structure Calculations
✍ S. Goedecker πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 382 KB

Electronic structure calculations which are based on Wannier, like localized orbitals or the related density matrix, are an alternative to conventional calculations based on extended orbitals. For large systems this approach is potentially faster since it offers \(O(N)\) scaling with respect to the

Noncommutative minimization algorithms
Noncommutative minimization algorithms
✍ M. Flouret; E. Laugerotte πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 317 KB

We give effective algorithms for the minimization of rational series over any field (commutative or not). Explicit constructions of minimization and intertwining of minimal models are given in full details. @