An alternating direction-based contraction method for linearly constrained separable convex programming problems
- 1 April 2013
- journal article
- research article
- Published by Taylor & Francis in Optimization
- Vol. 62 (4) , 573-596
Abstract
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.Keywords
This publication has 22 references indexed in Scilit:
- Alternating Direction Algorithms for $\ell_1$-Problems in Compressive SensingSIAM Journal on Scientific Computing, 2011
- A modified alternating direction method for convex quadratically constrained quadratic semidefinite programsEuropean Journal of Operational Research, 2010
- Parallel splitting augmented Lagrangian methods for monotone structured variational inequalitiesComputational Optimization and Applications, 2007
- A descent method for structured monotone variational inequalitiesOptimization Methods and Software, 2007
- A new inexact alternating directions method for monotone variational inequalitiesMathematical Programming, 2002
- Some convergence properties of a method of multipliers for linearly constrained monotone variational inequalitiesOperations Research Letters, 1998
- ReportMaterials and Structures, 1997
- Some Saddle-function splitting methods for convex programmingOptimization Methods and Software, 1994
- A dual algorithm for the solution of nonlinear variational problems via finite element approximationComputers & Mathematics with Applications, 1976
- On the numerical solution of heat conduction problems in two and three space variablesTransactions of the American Mathematical Society, 1956