首页> 外文期刊>Computational Optimization and Applications >Active-set Newton methods for mathematical programs with vanishing constraints
【24h】

Active-set Newton methods for mathematical programs with vanishing constraints

机译:约束消失的数学程序的主动集牛顿法

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

摘要

Mathematical programs with vanishing constraints constitute a new class of difficult optimization problems with important applications in optimal topology design of mechanical structures. Vanishing constraints usually violate standard constraint qualifications, which gives rise to serious difficulties in theoretical and numerical treatment of these problems. In this work, we suggest several globalization strategies for the active-set Newton-type methods developed earlier by the authors for this problem class, preserving superlinear convergence rate of these methods under weak assumptions. Preliminary numerical results demonstrate that our approach is rather promising and competitive with respect to the existing alternatives.
机译:具有消失的约束的数学程序构成了一类新的困难的优化问题,在机械结构的最佳拓扑设计中具有重要的应用。消失的约束通常违反标准约束条件,这给这些问题的理论和数值处理带来了严重的困难。在这项工作中,我们为作者早些时候针对此问题类别开发的活动集牛顿型方法提出了几种全球化策略,并在弱假设下保持了这些方法的超线性收敛速度。初步的数值结果表明,相对于现有的替代方案,我们的方法具有很大的发展前景和竞争力。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号