首页> 外文期刊>Journal of Global Optimization >On the convergence of the entropy-exponential penalty trajectories and generalized proximal point methods in semidefinite optimization
【24h】

On the convergence of the entropy-exponential penalty trajectories and generalized proximal point methods in semidefinite optimization

机译:半定优化问题中熵指数罚轨迹与广义近点法的收敛性

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

摘要

The convergence of primal and dual central paths associated to entropy and exponential functions, respectively, for semidefinite programming problem are studied in this paper. It is proved that the primal path converges to the analytic center of the primal optimal set with respect to the entropy function, the dual path converges to a point in the dual optimal set and the primal-dual path associated to this paths converges to a point in the primal-dual optimal set. As an application, the generalized proximal point method with the Kullback-Leibler distance applied to semidefinite programming problems is considered. The convergence of the primal proximal sequence to the analytic center of the primal optimal set with respect to the entropy function is established and the convergence of a particular weighted dual proximal sequence to a point in the dual optimal set is obtained.
机译:研究了半定规划问题分别与熵函数和指数函数有关的原始和对偶中心路径的收敛性。证明原始路径关于熵函数收敛到原始最优集合的解析中心,对偶路径收敛到对偶最优集合中的一个点,并且与该路径关联的原始对偶路径收敛到一个点在原始对偶最优集合中。作为一种应用,考虑了将近距离点法与Kullback-Leibler距离应用于半定规划问题。建立相对于熵函数的原始近邻序列到原始最优集的分析中心的收敛性,并且获得特定加权对偶近端序列到对偶最优集中某个点的收敛性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号