首页> 外文期刊>Pacific Journal of Optimization >A DCA FOR MPCCS CONVERGING TO A S-STATIONARY POINT
【24h】

A DCA FOR MPCCS CONVERGING TO A S-STATIONARY POINT

机译:A DCA FOR MPCCS CONVERGING TO A S-STATIONARY POINT

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

摘要

In this article we propose an Algorithm based on a DC decomposition (Difference of Convex functions) which solves MPCCs and we prove that it converges to a strongly stationary point under MPCCLICQ.

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号