Non-Convex Multi-Objective Optimization by Panos M. Pardalos Antanas Žilinskas & Julius Žilinskas

Author:Panos M. Pardalos, Antanas Žilinskas & Julius Žilinskas
Language: eng
Format: epub
Publisher: Springer International Publishing, Cham

7.3 Multi-Objective P-Algorithm

In this section, a single-objective global optimization algorithm, based on a statistical model of multimodal functions, namely the P-algorithm, is generalized for the case of black-box multi-objective optimization. For the axiomatic definition of statistical models of multimodal black-box functions and the single-objective P-algorithm , we refer to [242, 243].

The minimization is considered at the n + 1-st minimization step. The points where the objective functions were computed are denoted by x i , i = 1, …, n, and the corresponding objective vectors are denoted by y i = f(x i ); y i = (y i1, …, y im ). Based on the discussion in the previous section, the vector-valued Gaussian random field

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.