.png){kind=icon}
返回
A bundle modification strategy for convex minimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2006.04.005.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We present a new bundle algorithm for minimizing convex not necessarily smooth functions. The novelty of our approach is based on a bundle modification strategy that we apply whenever the stability center is updated and which is aimed at substituting the points of the bundle by new points characterized by possibly better values of the objective function. Convergence of the algorithm is proved and numerical results are presented. (c) 2006 Elsevier B.V. All rights reserved.
Keyword:
non-smooth optimization
cutting planes
bundle methods
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
Water Use Patterns of Sympatric Przewalski’s Horse and Khulan: Interspecific Comparison Reveals Niche Differences.png)
PLOS ONE
OAAI
PLOS ONEIF0
OAAI分享收藏分享收藏Electroencephalographic responses to neck cut and exsanguination in minimally anaesthetized goatsOAAI
OAAI分享收藏
查看更多内容