Local Optimization Method with Global Multidimensional Search
β Scribed by Adil M. Bagirov; Alexander M. Rubinov; Jiapu Zhang
- Publisher
- Springer US
- Year
- 2005
- Tongue
- English
- Weight
- 352 KB
- Volume
- 32
- Category
- Article
- ISSN
- 0925-5001
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## 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
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