A family of derivative-free multi-objective line-search methods is proved to attain a Pareto-stationarity tolerance ε within O(n^q ε^{-2q}) iterations in the strong version and O(|L(ε)| ε^{-2q}) iterations in the light version.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Worst-case complexity analysis of derivative-free methods for multi-objective optimization
A family of derivative-free multi-objective line-search methods is proved to attain a Pareto-stationarity tolerance ε within O(n^q ε^{-2q}) iterations in the strong version and O(|L(ε)| ε^{-2q}) iterations in the light version.