2017
DOI: 10.1007/978-3-319-61007-8
|View full text |Cite
|
Sign up to set email alerts
|

Non-Convex Multi-Objective Optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
32
0
1

Year Published

2018
2018
2020
2020

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 81 publications
(47 citation statements)
references
References 0 publications
0
32
0
1
Order By: Relevance
“…However, the objective functions of the considered problem are computationally expensive, and the solution of this problem by a meta-heuristic method would take prohibitive long computing time. For such, so called expensive, objective functions, Bayesian methods proved to be efficient [25]. On the other hand, the inherent complexity of standard implementations of Bayesian methods limits the number of values of the objective functions which can be processed.…”
Section: 2 Optimization Algorithmmentioning
confidence: 99%
See 4 more Smart Citations
“…However, the objective functions of the considered problem are computationally expensive, and the solution of this problem by a meta-heuristic method would take prohibitive long computing time. For such, so called expensive, objective functions, Bayesian methods proved to be efficient [25]. On the other hand, the inherent complexity of standard implementations of Bayesian methods limits the number of values of the objective functions which can be processed.…”
Section: 2 Optimization Algorithmmentioning
confidence: 99%
“…2, the rectangular partition of the feasible region is shown at the vertices of which are computed the values of the objective functions. The performance metrics of the proposed algorithm are presented in Table 2, where the performance of metrics of several other algorithms are also presented for comparison [25]. The following notation is used in Table 2: NFE-number of evaluations of the objective functions, ε -tolerance of the termination condition, NGEN-number of generation in the termination criterion of the genetic algorithm, HV-hypervolume computed with respect to the reference point (1, 1) T , NP-number of found non-dominated solutions, UDuniformity of distribution of points approximating the Pareto front.…”
Section: Numerical Examplementioning
confidence: 99%
See 3 more Smart Citations