首页> 外文会议>The 8th international conference on optimization: Techniques and Applications >A Modified Aggregate Constraint Homotopy Method for Nonconvex Programming
【24h】

A Modified Aggregate Constraint Homotopy Method for Nonconvex Programming

机译:非凸规划的改进的总约束同伦方法

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

摘要

A modified aggregate constraint homotopy method is proposed for nonconvex programming, in which an active set strategy is adopted implicitly and hence can save much computation of the gradients and the Hessians of constraints. Similar convergence as previous homotopy methods is proven and, preliminary numerical tests show that it is more efficient than old ones when the number of constraints is large.
机译:针对非凸规划提出了一种改进的集合约束同伦方法,该方法隐含地采用主动集策略,可以节省梯度的计算和约束的Hessian。证明了与以前的同伦方法相似的收敛性,并且初步的数值测试表明,当约束数量很大时,它比旧的方法更有效。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号