This paper generalizes the dynamical system proposed by Wang et al. [Siam. J. Sci. Comput., 2021] to multiobjective optimization by investigating a multiobjective accelerated gradient-like flow with asymptotically vanishing normalized gradient. Using Lyapunov analysis, we obtain convergence rates of and for the trajectory solution under two distinct parameter selections. Under certain assumptions, we further prove that the trajectory solution of this gradient flow converges to a weak Pareto solution for convex multiobjective optimization problems. Through corresponding discretization, we derive a new class of multiobjective gradient methods achieving a convergence rate of . Additionally, numerical experiments validate the theoretical results, demonstrating that this gradient flow outperforms other existing dynamical systems in the literature regarding convergence speed, and our algorithm exhibits corresponding advantages.

生成讲解博客的中文版本

生成AI智能校验的中文版本