.png){kind=icon}
Return
Parallel solving of multiple information-coordinated global optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jpdc.2021.04.009.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper proposes an efficient approach for the parallel solution of computationally time consuming problems of multiple global optimization, in which minimized functions can be multiextremal and calculating function values may require huge amounts of computations. The proposed approach is based on the information-statistical theory of global optimization, within which a general computational scheme of global optimization methods is proposed. In the paper, this general scheme is expanded by the possible reuse of search information obtained in the process of computations when solving multiple global optimization problems. Within the framework of the proposed generalized scheme, parallel algorithms are proposed for computational systems with shared and distributed memory. Results of computational experiments demonstrated that the proposed approach can significantly reduce the computational complexity of solving multiple global optimization problems. (C) 2021 Elsevier Inc. All rights reserved.
Keywords:
Global optimization
Dimensionality reduction
Search information
Parallel methods of global search
Computational complexity
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4
Papers:
3.8K
Citations:
4.8K
Organization
Cited Papers
ShareSaveShareSaveShareSaveEndemic Burkitt lymphoma is associated with strength and diversity of Plasmodium falciparum malaria stage-specific antigen antibody response.png)
Blood
OAAI
BloodIF0
OAAIShareSaveSOMS: SurrOgate MultiStart algorithm for use with nonlinear programming for global optimization
PREAI
ShareSave
ShareSave
View more