2016
DOI: 10.1016/b978-0-444-63428-3.50057-6
|View full text |Cite
|
Sign up to set email alerts
|

Use of predictor corrector methods for multi-objective optimization of dynamic systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 10 publications
0
4
0
Order By: Relevance
“…In the case of complex scalarized optimization problems, the homogeneity often depends on the ability to find a Pareto front's non-convex regions. This is because step-wise solution of an optimization problem using the weighted sum method can only specify the convex hull of the Pareto front [22]. In addition, the convex hull obtained will not be sufficiently homogeneous if the value ranges of the optimization objectives differ significantly from each other.…”
Section: Optimization Processmentioning
confidence: 99%
“…In the case of complex scalarized optimization problems, the homogeneity often depends on the ability to find a Pareto front's non-convex regions. This is because step-wise solution of an optimization problem using the weighted sum method can only specify the convex hull of the Pareto front [22]. In addition, the convex hull obtained will not be sufficiently homogeneous if the value ranges of the optimization objectives differ significantly from each other.…”
Section: Optimization Processmentioning
confidence: 99%
“…DOMP achieves the fastest pruning, reaching its best linearization performance in just the first iterations. Regarding the NMSE tolerance, the Pareto front-defined here as the values with lowest tolerance for each number of coefficients [32]-is conformed by the DOMP for μ < −1 and by PCA for a number of coefficients greater than 50.…”
Section: A Dpd Of a Commercial Pamentioning
confidence: 99%
“…The region in the space of the values of all objectives defined by all Pareto Set points is called Pareto Front (Keßler et al, 2016). To obtain the Pareto Set, or the discrete approximation of Pareto Front, the objective functions are normally sampled using different values of the independent optimisation variables.…”
Section: Introductionmentioning
confidence: 99%