Higher-order Karush-Kuhn-Tucker optimality conditions for set-valued optimization with nonsolid ordering cones

被引:2
作者
Nguyen Le Hoang Anh [1 ]
Phan Quoc Khanh [2 ]
机构
[1] Vietnam Natl Univ Hochiminh City, Univ Sci, Dept Optimizat & Syst Theory, 227 Nguyen Van Cu,Dist 5, Hochiminh City, Vietnam
[2] Vietnam Natl Univ Hochiminh City, Int Univ, Dept Math, Hochiminh City, Vietnam
关键词
Set-valued optimization; Higher-order Karush-Kuhn-Tucker conditions; Quasi-relative efficient solutions; Pareto solutions; Nonsolid ordering cones; Radial derivatives; Generalized subconvexlikeness; PROPER EFFICIENT SOLUTIONS; VARIATIONAL SETS; RADIAL SETS; NONSMOOTH; CALCULUS; DUALITY; DERIVATIVES; INTERIORS; HENIG;
D O I
10.1007/s11117-016-0444-y
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
In this paper, we consider higher-order Karush-Kuhn-Tucker optimality conditions in terms of radial derivatives for set-valued optimization with nonsolid ordering cones. First, we develop sum rules and chain rules in the form of equality for radial derivatives. Then, we investigate set-valued optimization including mixed constraints with both ordering cones in the objective and constraint spaces having possibly empty interior. We obtain necessary conditions for quasi-relative efficient solutions and sufficient conditions for Pareto efficient solutions. For the special case of weak efficient solutions, we receive even necessary and sufficient conditions. Our results are new or improve recent existing ones in the literature.
引用
收藏
页码:931 / 953
页数:23
相关论文
共 41 条
[1]  
Aubin JP., 1990, SET VALUED ANAL
[2]   Relative Pareto minimizers for multiobjective problems: existence and optimality conditions [J].
Bao, Truong Q. ;
Mordukhovich, Boris S. .
MATHEMATICAL PROGRAMMING, 2010, 122 (02) :301-347
[3]   PARTIALLY FINITE CONVEX-PROGRAMMING .2. EXPLICIT LATTICE MODELS [J].
BORWEIN, JM ;
LEWIS, AS .
MATHEMATICAL PROGRAMMING, 1992, 57 (01) :49-83
[4]   PARTIALLY FINITE CONVEX-PROGRAMMING .1. QUASI RELATIVE INTERIORS AND DUALITY-THEORY [J].
BORWEIN, JM ;
LEWIS, AS .
MATHEMATICAL PROGRAMMING, 1992, 57 (01) :15-48
[5]   Revisiting some duality theorems via the quasirelative interior in convex optimization [J].
Bot, R. I. ;
Csetnek, E. R. ;
Moldovan, A. .
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2008, 139 (01) :67-84
[6]   Regularity conditions via quasi-relative interior in convex programming [J].
Bot, Radu Ioan ;
Csetnek, Ernoe Robert ;
Wanka, Gert .
SIAM JOURNAL ON OPTIMIZATION, 2008, 19 (01) :217-233
[7]   Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements [J].
Bot, Radu Ioan ;
Csetnek, Ernoe Robert .
OPTIMIZATION, 2012, 61 (01) :35-65
[8]   Higher order weak epiderivatives and applications to duality and optimality conditions [J].
Chen, C. R. ;
Li, S. J. ;
Teo, K. L. .
COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2009, 57 (08) :1389-1399
[9]   First-order optimality conditions in set-valued optimization [J].
Crespi, GP ;
Ginchev, I ;
Rocca, M .
MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 2006, 63 (01) :87-106
[10]   ON PROGRAMMING WHEN THE POSITIVE CONE HAS AN EMPTY INTERIOR [J].
DEARAUJO, AP ;
MONTEIRO, PK .
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1990, 67 (02) :395-410