A nonmonotone line-search variant of the Front Descent method is proposed for bound-constrained multi-objective optimization, with subsequence-convergence guarantees and favorable numerical results on high-dimensional benchmarks.
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
-
A Nonmonotone Front Descent Method for Bound-Constrained Multi-Objective Optimization
A nonmonotone line-search variant of the Front Descent method is proposed for bound-constrained multi-objective optimization, with subsequence-convergence guarantees and favorable numerical results on high-dimensional benchmarks.