...
首页> 外文期刊>Journal of industrial and management optimization >CONVERGENCE ANALYSIS OF A SMOOTHING SAA METHOD FOR A STOCHASTIC MATHEMATICAL PROGRAM WITH SECOND-ORDER CONE COMPLEMENTARITY CONSTRAINTS
【24h】

CONVERGENCE ANALYSIS OF A SMOOTHING SAA METHOD FOR A STOCHASTIC MATHEMATICAL PROGRAM WITH SECOND-ORDER CONE COMPLEMENTARITY CONSTRAINTS

机译:二阶锥互补约束的随机数学计划平滑SAA方法的收敛性分析

获取原文
获取原文并翻译 | 示例

摘要

A stochastic mathematical program model with second-order cone complementarity constraints (SSOCMPCC) is introduced in this paper. It can be considered as a non-trivial extension of stochastic mathematical program with complementarity constraints, and could arise from a hard-to-handle class of bilivel second-order cone programming and inverse stochastic second-order cone programming. By introducing the Chen-Harker-Kanzow-Smale (CHKS) type function to replace the projection operator onto the second-order cone, a smoothing sample average approximation (SAA) method is proposed for solving the SSOCMPCC problem. It can be shown that with proper assumptions, as the sample size goes to infinity, any cluster point of global solutions of the smoothing SAA problem is a global solution of SSOCMPCC almost surely, and any cluster point of stationary points of the former problem is a C-stationary point of the latter problem almost surely. C-stationarity can be strengthened to M-stationarity with additional assumptions. Finally, we report a simple illustrative numerical test to demonstrate our theoretical results.
机译:本文介绍了具有二阶锥互补约束(SSOCMPCC)的随机数学计划模型。它可以被认为是具有互补限制的随机数学程序的非琐碎延伸,并且可以从难以处理的Bilivel二阶锥编程和反随机二阶二阶锥编程中出现。通过介绍陈无莹 - kanzow - 气味(块)型功能来将投影操作员更换到二阶锥上,提出了平滑样本平均近似(SAA)方法来解决SSOCMPCC问题。可以表明,通过适当的假设,随着样本大小进入无限,全球解决方案的全局解决方案的全球解决方案是SSOCMPCC的全球解决方案几乎肯定,并且前一个问题的任何簇状点的栖息地点的全球解决方案都是一个后者问题的静态点几乎肯定。通过额外的假设,C-Suitcharity可以加强到M-Suitcharity。最后,我们报告了一个简单的说明性数字测试,以证明我们的理论结果。

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号