.png){kind=icon}
返回
A primal-dual proximal point algorithm for constrained convex programs
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2003.12.137.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We present a primal-dual application of the proximal point algorithm to solve convex constrained minimization problems. Motivated by the work of Eckstein [Math. Oper. Res. 18 (1993) 203] about the generalized proximal point method, we propose here a mixed proximal multipliers method where we improve the result of Eckstein [Math. Oper. Res. 18 (1993) 203] Theorem 1. (C) 2004 Elsevier Inc. All rights reserved.
Keyword:
proximal point method
Bregman functions
multipliers method
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
暂无机构信息
引用论文
Medical instrument data exchange.png)
2008 30th Annual International Conference of the IEEE Engineering in Medicine and Biology Society
2008 30th Annual International Conference of the IEEE Engineering in Medicine and Biology SocietyIF0
PREAI
分享收藏
没有更多内容
没有更多内容