.png){kind=icon}
返回
A variable metric method for nonsmooth convex constrained optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2006.05.132.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We propose an algorithm for solving nonsmooth convex constrained problems, which is close in spirit and structure to the well-developed unconstrained variable metric method. In the algorithm, time-consuming quadratic programming sub-problems do not need to be solved. Furthermore, neither penalty function nor filter is employed. Global convergence of the method is established. Some encouraging preliminary computational results are reported. (c) 2006 Elsevier Inc. All rights reserved.
Keyword:
constrained optimization
nonsmooth convex optimization
variable metric method
global convergence
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
暂无机构信息
引用论文
Decreased magnitude of heart rate spectral components in coronary artery disease. Its relation to angiographic severity..png)
Circulation
OAAI
CirculationIF0
OAAI分享收藏
查看更多内容