Optimality Conditions for Disjunctive Optimization in Reflexive Banach Spaces

被引:3
作者
Song, Wen [1 ]
Wang, Qianqian [1 ]
机构
[1] Harbin Normal Univ, Sch Math Sci, Harbin 150025, Peoples R China
关键词
Reflexive Banach space; Disjunctive optimization; Convex generalized polyhedron; Mordukhovich normal cone; Optimality condition; FINITE UNION; CALMNESS; DUALITY; MINIMUM; THEOREM;
D O I
10.1007/s10957-014-0571-1
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
We study optimization problems with the constraints having disjunctive structures in reflexive Banach spaces. By the representations of contingent cones and Fr,chet normal cones to finite unions of sets in general Banach spaces and using the special structures of convex generalized polyhedral sets, we calculate the Mordukhovich normal cones to finite unions of closed and convex sets that particularly include convex generalized polyhedral sets in reflexive Banach spaces. Furthermore, based on these calculations and the Guignard-type constraint qualifications, we derive new optimality conditions for disjunctive optimization problems. We also present specializations of these results to optimization problems with variational inequality constraints.
引用
收藏
页码:436 / 454
页数:19
相关论文
共 26 条
[1]   Quasiconvex minimization on a locally finite union of convex sets [J].
Aussel, D. ;
Ye, J. J. .
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2008, 139 (01) :1-16
[2]   NOTE ON DUALITY IN DISJUNCTIVE PROGRAMMING [J].
BALAS, E .
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1977, 21 (04) :523-528
[3]  
Balas E, 1975, Nonlinear programming, V2, P279
[4]   Lipschitzian stability of parametric variational inequalities over generalized polyhedra in Banach spaces [J].
Ban, Liqun ;
Mordukhovich, Boris S. ;
Song, Wen .
NONLINEAR ANALYSIS-THEORY METHODS & APPLICATIONS, 2011, 74 (02) :441-461
[5]  
Bonnans J Frederic, 2013, Perturbation analysis of optimization problems, P10
[6]  
Borwein J, 2000, J CONVEX ANAL, V7, P375
[7]   A STRONG DUALITY THEOREM FOR THE MINIMUM OF A FAMILY OF CONVEX-PROGRAMS [J].
BORWEIN, JM .
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1980, 31 (04) :453-472
[8]   Convex programming for disjunctive convex optimization [J].
Ceria, S ;
Soares, J .
MATHEMATICAL PROGRAMMING, 1999, 86 (03) :595-614
[9]  
Clarke F. H., 1983, OPTIMIZATION NONSMOO
[10]   Optimality conditions for disjunctive programs with application to mathematical programs with equilibrium constraints [J].
Flegel, Michael L. ;
Kanzow, Christian ;
Outrata, Jiri V. .
SET-VALUED ANALYSIS, 2007, 15 (02) :139-162