首页> 外文会议>IEEE Conference on Decision and Control >A Sufficient Condition for Local Optima to be Globally Optimal
【24h】

A Sufficient Condition for Local Optima to be Globally Optimal

机译:当地最佳的充分条件是全球最佳的

获取原文

摘要

Consider an optimization problem with a convex cost function but a non-convex compact feasible set $mathcal{X}$, and its relaxation with a compact and convex feasible set $hat {mathcal{X}} supset mathcal{X}$. We prove that if from any point $x in hat {mathcal{X}}ackslash mathcal{X}$ there is a path connecting x to $mathcal{X}$ along which both the cost function and a Lyapunov-like function are improvable, then any local optimum in $mathcal{X}$ for the original non-convex problem is a global optimum. We use this result to show that, for AC optimal power flow problems, a wellknown sufficient condition for exact relaxation also guarantees that all its local optima are globally optimal. This helps explain the widespread empirical experience that local algorithms for optimal power flow problems often work extremely well.
机译:考虑具有凸起成本函数的优化问题,而是一种非凸起紧凑可行设置$ Mathcal {x} $,以及具有紧凑且凸的可行设置$ hat { mathcal {x}} supset mathcal { x} $。我们证明,如果从任何点$ x in hat { mathcal {x}} backslash mathcal {x} $ wally x到$ mathcal {x} $ vita path,它均为成本函数和a Lyapunov样功能是可可易于的,然后在$ mathcal {x} $ for for原始的非凸面问题中的任何局部最佳最佳函数是全局最佳的。我们使用此结果表明,对于AC最佳功率流出问题,确切放松的众所周知的充分条件也保证了其所有本地Optima是全球最佳的。这有助于解释广泛的经验经验,即最佳功率流动问题的本地算法通常非常好。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号