...
首页> 外文期刊>Mathematical methods of operations research >Robust canonical duality theory for solving nonconvex programming problems under data uncertainty
【24h】

Robust canonical duality theory for solving nonconvex programming problems under data uncertainty

机译:数据不确定性下非凸规划问题的鲁棒规范对偶理论

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

获取外文期刊封面封底 >>

       

摘要

This paper presents a robust canonical duality-triality theory for solving nonconvex programming problems under data uncertainty. This theory includes a robust canonical saddle-point theorem and robust canonical optimality conditions, which can be used to identify both robust global and local extrema of the primal problem. Two numerical examples are presented to illustrate that the robust Triality theory is particularly powerful for solving nonconvex optimization problems with data uncertainty.
机译:本文提出了一种鲁棒的规范对偶三元性理论,用于解决数据不确定性下的非凸规划问题。该理论包括鲁棒的规范鞍点定理和鲁棒的规范最优性条件,这些条件可用于识别原始问题的鲁棒全局和局部极值。给出了两个数值示例,说明了稳健的Triality理论对于解决具有数据不确定性的非凸优化问题特别有效。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号