A proximal point algorithm based on decomposition method for cone constrained multiobjective optimization problems

作者：Chen, Jiawei; Ansari, Qamrul Hasan; Liou, Yeong-Cheng; Yao, Jen-Chih^*

来源：Computational Optimization and Applications, 2016, 65(1): 289-308.

DOI：10.1007/s10589-016-9840-2

• Multiobjective optimization with cone constraints
• Mixed variational inequalities
• Split feasibility problems
• Proximal point algorithm
• Auxiliary principle
• Decomposition method

By using auxiliary principle technique, a new proximal point algorithm based on decomposition method is suggested for computing a weakly efficient solution of the constrained multiobjective optimization problem (MOP) without assuming the nonemptiness of its solution set. The optimality conditions for (MOP) are derived by the Lagrangian function of its subproblem and corresponding mixed variational inequality. Some basic properties and convergence results of the proposed method are established under some mild assumptions. As an application, we employ the proposed method to solve a split feasibility problem. Finally, numerical results are also presented to illustrate the feasibility of the proposed algorithm.

• 出版日期2016-9
• 单位中国石油大学（北京）; 西南大学; 中国医科大学