Answers are grounded in this paper and cite their sources.
. Trust-region methods provide a reliable framework for solving unconstrained multiobjective optimization problems, but classical monotone acceptance rules may lead to conservative steps and slow progress on challenging problems. This paper presents a trust-region algorithm based on a -type nonmonotone strategy that introduces greater flexibility into the acceptance mechanism while preserving the convergence properties of the method. Under standard assumptions, we prove that every accumulation point generated by the algorithm satisfies the first-order Pareto criticality conditions. The proposed method is tested on a diverse set of benchmark problems and compared with three existing trust-region algorithms. The numerical results demonstrate competitive performance in terms of iterations, objective function evaluations, gradient evaluations, and CPU time, while maintaining high-quality Pareto approximations measured by Hypervolume (HV), Inverted Generational Distance Plus (IGD+), and Purity. Performance profile analysis further confirms the efficiency and robustness of the proposed approach.
No takes yet. Share an insight, caveat, or question.
A 2026 study studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: