.png){kind=icon}
返回
A partitioned PSB method for partially separable unconstrained optimization problems
.png){kind=icon}
OA
AI
DOI：10.1016/j.amc.2016.06.009.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we propose a partitioned PSB method for solving partially separable unconstrained optimization problems. By using a projection technique, we construct a sufficient descent direction. Under appropriate conditions, we show that the partitioned PSB method with projected direction is globally and superlinearly convergent for uniformly convex problems. In particular, the unit step length is accepted after finitely many iterations. Finally, some numerical results are presented, which show that the partitioned PSB method is effective and competitive. (C) 2016 Elsevier Inc. All rights reserved.
Keyword:
Partially separable optimization problems
Partitioned PSB method
Projected PSB method
Global convergence
Superlinear convergence
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
引用论文
.png){kind=icon}
查看更多内容