✦ LIBER ✦

Derivative-Free Filter Simulated Annealing Method for Constrained Continuous Global Optimization

✍ Scribed by Abdel-Rahman Hedar; Masao Fukushima

Publisher: Springer US
Year: 2006
Tongue: English
Weight: 287 KB
Volume: 35
Category: Article
ISSN: 0925-5001
DOI: 10.1007/s10898-005-3693-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Objective-derivative-free methods for co

Objective-derivative-free methods for constrained optimization

✍ S. Lucidi; M. Sciandrone; P. Tseng 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 216 KB

Convergence and first hitting time of si

Convergence and first hitting time of simulated annealing algorithms for continuous global optimization

✍ M. Locatelli 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 283 KB

Simulated annealing and neural networks

Simulated annealing and neural networks as alternative methods for nonlinear constrained optimization

✍ P. Carlson; M. Danielsson; M. Dejardin; K. Jon-And; J. Sjölin 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 490 KB

Continuous GRASP with a local active-set

Continuous GRASP with a local active-set method for bound-constrained global optimization

✍ Ernesto G. Birgin; Erico M. Gozzi; Mauricio G. C. Resende; Ricardo M. A. Silva 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 534 KB

Global optimization using bad derivative

Global optimization using bad derivatives: Derivative-free method for molecular energy minimization

✍ Andricioaei, Ioan; Straub, John E. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 247 KB 👁 2 views

A general method designed to isolate the global minimum of a multidimensional objective function with multiple minima is presented. The algorithm exploits an integral ''coarse-graining'' transformation of the objective function, U, into a smoothed function with few minima. When the coarsegraining is

A combined global and local search metho

A combined global and local search method to deal with constrained optimization for continuous tabu search

✍ Xi Chen; Jing Yang; Zhaohua Li; Daqing Tian; Zhijiang Shao 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 269 KB

## Abstract Heuristic methods, such as tabu search, are efficient for global optimizations. Most studies, however, have focused on constraint‐free optimizations. Penalty functions are commonly used to deal with constraints for global optimization algorithms in dealing with constraints. This is some