EconPapers    
Economics at your fingertips  
 

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

Jiawei Chen (), Qamrul Hasan Ansari (), Yeong-Cheng Liou () and Jen-Chih Yao ()
Additional contact information
Jiawei Chen: Southwest University
Qamrul Hasan Ansari: Aligarh Muslim University
Yeong-Cheng Liou: Cheng Shiu University
Jen-Chih Yao: China Medical University

Computational Optimization and Applications, 2016, vol. 65, issue 1, No 10, 289-308

Abstract: 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.

Keywords: Multiobjective optimization with cone constraints; Mixed variational inequalities; Split feasibility problems; Proximal point algorithm; Auxiliary principle; Decomposition method (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10589-016-9840-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:65:y:2016:i:1:d:10.1007_s10589-016-9840-2

Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589

DOI: 10.1007/s10589-016-9840-2

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

 
Page updated 2025-03-20
Handle: RePEc:spr:coopap:v:65:y:2016:i:1:d:10.1007_s10589-016-9840-2