New worst-case iteration and function-evaluation bounds for high-order set-generating multiobjective optimization algorithms, with exponents depending on the number of objectives and the model order.
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 of High-Order Algorithms for Pareto-Front Reconstruction
New worst-case iteration and function-evaluation bounds for high-order set-generating multiobjective optimization algorithms, with exponents depending on the number of objectives and the model order.