期刊
OPTIMIZATION
卷 62, 期 4, 页码 573-596出版社
TAYLOR & FRANCIS LTD
DOI: 10.1080/02331934.2011.611885
关键词
alternating direction method; convex programming; linear constraint; separable structure; contraction method; 90C06; 90C22; 90C25
资金
- NSFC [10971095]
- NSF of Province Jiangsu [BK2008255]
- General Research Fund of Hong Kong [HKBU203311]
The classical alternating direction method (ADM) has been well studied in the context of linearly constrained convex programming and variational inequalities where the involved operator is formed as the sum of two individual functions without crossed variables. Recently, ADM has found many novel applications in diversified areas, such as image processing and statistics. However, it is still not clear whether ADM can be extended to the case where the operator is the sum of more than two individual functions. In this article, we extend the spirit of ADM to solve the general case of the linearly constrained separable convex programming problems whose involved operator is separable into finitely many individual functions. As a result, an alternating direction-based contraction-type method is developed. The realization of tackling this class of problems broadens the applicable scope of ADM substantially.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据