点击次数：
论文类型：期刊论文
发表时间：2012-01-01
发表刊物：NONLINEAR ANALYSIS-THEORY METHODS & APPLICATIONS
收录刊物：Scopus、SCIE、EI
卷号：75
期号：2
页面范围：526-542
ISSN号：0362-546X
关键字：Constrained Lipschitz optimization; Constraint qualifications; Calmness; Mathematical program with complementarity constraints
摘要：Three constraint qualifications (the weak generalized Robinson constraint qualification, the bounded constraint qualification, and the generalized Abadie constraint qualification), which are weaker than the generalized Robinson constraint qualification (GRCQ) given by Yen (1997) [1], are introduced for constrained Lipschitz optimization problems. Relationships between those constraint qualifications and the calmness of the solution mapping are investigated. It is demonstrated that the weak generalized Robinson constraint qualification and the bounded constraint qualification are easily verifiable sufficient conditions for the calmness of the solution mapping, whereas the proposed generalized Abadie constraint qualification, described in terms of graphical derivatives in variational analysis, is weaker than the calmness of the solution mapping. Finally, those constraint qualifications are written for a mathematical program with complementarity constraints (MPCC), and new constraint qualifications ensuring the C-stationary point condition of a MPCC are obtained. (C) 2011 Elsevier Ltd. All rights reserved.