Asymptotic analysis in convex composite multiobjective optimization problems

In this paper, we present a unified approach for studying convex composite multiobjective optimization problems via asymptotic analysis. We characterize the nonemptiness and compactness of the weak Pareto optimal solution sets for a convex composite multiobjective optimization problem. Then, we employ the obtained results to propose a class of proximal‐type methods for solving the convex composite multiobjective optimization problem, and carry out their convergence analysis under some mild conditions.