For solving constrained multiobjective problems with a vector-valued DC (difference of convex) objective function, we consider a vectorial Bregman regularized proximal point method which extends both the scalar proximal point method for DC functions and the vectorial proximal point method for vector-valued convex functions. By using a vectorial regularization function, our method does not use auxiliary vectorial sequences to make the method a vectorial one but providing an extra flexibility to the method. Some encouraging numerical experiments are presented.

中文翻译：

---

多目标 DC 规划中具有矢量 Bregman 正则化的近点法

为了解决具有向量值 DC（凸差）目标函数的约束多目标问题，我们考虑了一种向量 Bregman 正则化近点方法，该方法扩展了 DC 函数的标量近点方法和向量值凸的向量近点方法职能。通过使用向量正则化函数，我们的方法不使用辅助向量序列使该方法成为向量方法，但为该方法提供了额外的灵活性。提出了一些令人鼓舞的数值实验。