Complexity Bounds for Smooth Multiobjective Optimization

arXiv:2509.13550v2 Announce Type: replace-cross Abstract: We study the oracle complexity of finding $\varepsilon$-Pareto stationary points in smooth multiobjective optimization with $m$ objectives. Progress is measured by the Pareto stationarity gap $\mathcal{G}(x)$, the norm ...

🔗 Read more: https://arxiv.org/abs/2509.13550

#News #Software #Policy #Biology #Academic