首页> 外文会议>2012 Fifth International Joint Conference on Computational Sciences and Optimization >A Smoothing Active-Set Newton Method for Constrained Optimization
【24h】

A Smoothing Active-Set Newton Method for Constrained Optimization

机译:约束优化的平滑活动集牛顿法

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

摘要

In this paper, a smoothing Newton-type method for solving constrained optimization is presented. This method uses smoothing Newton method to solve the KKT system of the original problems. A kind of active-set technology is introduced to identify the inequality constraints which does not satisfies the strict complementarity conditions. The proposed method has the global convergence to the KKT point. Under some regularity assumption, the degenerate indices can be identified correctly near the solution, and local super linear convergence is obtained without strict complementarity.
机译:本文提出了一种求解约束优化的平滑牛顿型方法。该方法采用平滑牛顿法来解决KKT系统的原始问题。引入了一种主动集技术来识别不满足严格互补条件的不等式约束。所提出的方法具有到KKT点的全局收敛性。在某些规律性假设下,退化指数可以在解附近正确识别,并且在没有严格互补性的情况下获得了局部超线性收敛。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号