首页> 外文期刊>Mathematical Programming >A bundle-filter method for nonsmooth convex constrained optimization
【24h】

A bundle-filter method for nonsmooth convex constrained optimization

机译:非光滑凸约束优化的束滤波器方法

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

摘要

For solving nonsmooth convex constrained optimization problems, we propose an algorithm which combines the ideas of the proximal bundle methods with the filter strategy for evaluating candidate points. The resulting algorithm inherits some attractive features from both approaches. On the one hand, it allows effective control of the size of quadratic programming subproblems via the compression and aggregation techniques of proximal bundle methods. On the other hand, the filter criterion for accepting a candidate point as the new iterate is sometimes easier to satisfy than the usual descent condition in bundle methods. Some encouraging preliminary computational results are also reported. Keywords Constrained optimization - Nonsmooth convex optimization - Bundle methods - Filter methods Mathematics Subject Classification (2000) 90C30 - 65K05 - 49D27 Dedicated to Alfred Auslender on the occasion of his 65th birthday.
机译:为了解决非光滑凸约束优化问题,我们提出了一种算法,该算法将近端束方法的思想与用于评估候选点的滤波策略相结合。结果算法从这两种方法继承了一些吸引人的特征。一方面,它允许通过近端束方法的压缩和聚合技术有效控制二次编程子问题的大小。另一方面,用于接受候选点作为新迭代的过滤条件有时比捆绑方法中通常的下降条件更容易满足。还报告了一些令人鼓舞的初步计算结果。关键词约束优化-非光滑凸优化-捆绑方法-滤波方法数学主题分类(2000)90C30-65K05-49D27献给Alfred Auslender 65岁生日。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号