.png){kind=icon}
返回
A log-exponential smoothing method for mathematical programs with complementarity constraints
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2011.11.046.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper a log-exponential smoothing method for mathematical programs with complementarity constraints (MPCC) is analyzed, with some new interesting properties and convergence results provided. It is shown that the stationary points of the resulting smoothed problem converge to the strongly stationary point of MPCC, under the linear independence constraint qualification (LICQ), the weak second-order necessary condition (WSONC), and some reasonable assumption. Moreover, the limit point satisfies the weak second-order necessary condition for MPCC. A notable fact is that the proposed convergence results do not restrict the complementarity constraint functions approach to zero at the same order of magnitude. (C) 2011 Elsevier Inc. All rights reserved.
Keyword:
Mathematical programs with complementarity constraints
Optimality condition
Asymptotically weak nondegenerate
Upper level strict complementarity
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
引用论文
Comparing methods of measurement: why plotting difference against standard method is misleading.png)
The Lancet
OAAI
The LancetIF0
OAAI分享收藏分享收藏分享收藏 没有更多内容
没有更多内容