Category Archives: Global Continuous Unconstrained Optimization
Improving Global Numerical Optimization using a Search-space Reduction Algorithm
We have developed an algorithm for reduction of search-space, called Domain Optimization Algorithm (DOA), applied to global optimization. This approach can efficiently eliminate search-space regions with low probability of containing a global optimum. DOA basically works using simple models for search-space regions to identify and eliminate non-promising regions. The proposed approach has shown relevant results
Discovering promising regions to help global numerical optimization algorithms
We have developed an algorithm using a Design of Experiments technique for reduction of search-space in global optimization problems. Our approach is called Domain Optimization Algorithm. This approach can efficiently eliminate search-space regions with low probability of containing a global optimum. The Domain Optimization Algorithm approach is based on eliminating non-promising search-space regions, which are
Vinícius Veloso de Melo is an Assistant Professor of Computer Science at