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 multiobjectiveoptimization problem (MOP) ...
详细信息
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 multiobjectiveoptimization 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.
暂无评论