Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
