Characterization of the robust isolated calmness for a class of conic programming problems
Characterization of the robust isolated calmness for a class of conic programming problems
复制标题
一类二次曲线规划问题的稳健孤立平静的表征
DOI:
10.1137/16m1058753
复制
发表时间:
2017
影响因子:
3.1
通讯作者:
Zhang Liwei
中科院分区:
文献类型:
--
作者:
Ding Chao;Sun Defeng;Zhang Liwei
This paper is devoted to studying the robust isolated calmness of the Karush--Kuhn--Tucker (KKT) solution mapping for a large class of interesting conic programming problems (including most commonly known ones arising from applications) at a locally optimal solution. Under the Robinson constraint qualification, we show that the KKT solution mapping is robustly isolated calm if and only if both the strict Robinson constraint qualification and the second order sufficient condition hold. This implies, among others, that at a locally optimal solution the second order sufficient condition is needed for the KKT solution mapping to have the Aubin property.