Department of Mathematics
An alternating direction-based contraction method for linearly constrained separable convex programming problems
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. © 2013 Copyright Taylor and Francis Group, LLC.
alternating direction method, contraction method, convex programming, linear constraint, separable structure
Source Publication Title
Taylor & Francis
Link to Publisher's Edition
He, B., Tao, M., Xu, M., & Yuan, X. (2013). An alternating direction-based contraction method for linearly constrained separable convex programming problems. Optimization, 62 (4), 573-596. https://doi.org/10.1080/02331934.2011.611885