𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Randomized algorithm for global optimization with bounded memory

✍ Scribed by James M. Calvin

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
167 KB
Volume
80
Category
Article
ISSN
0378-4754

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Modified subspace limited memory BFGS al
Modified subspace limited memory BFGS algorithm for large-scale bound constrained optimization
✍ Yunhai Xiao; Hongchuan Zhang πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 516 KB

In this paper, a subspace limited memory BFGS algorithm for solving large-scale bound constrained optimization problems is developed. It is modifications of the subspace limited memory quasi-Newton method proposed by Ni and Yuan [Q. Ni, Y.X. Yuan, A subspace limited memory quasi-Newton algorithm for

Tabu search method with random moves for
Tabu search method with random moves for globally optimal design
✍ Nanfang Hu πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 601 KB

Optimum engineering design problems are usually formulated as non-convex optimization problems of continuous variables. Because of the absence of convexity structure, they can have multiple minima, and global optimization becomes difficult. Traditional methods of optimization, such as penalty method