An Inexact Dual Fast Gradient-Projection Method for Separable Convex Optimization with Linear Coupled Constraints
MetadataShow full item record
© 2015 Springer Science+Business Media New York In this paper, a class of separable convex optimization problems with linear coupled constraints is studied. According to the Lagrangian duality, the linear coupled constraints are appended to the objective function. Then, a fast gradient-projection method is introduced to update the Lagrangian multiplier, and an inexact solution method is proposed to solve the inner problems. The advantage of our proposed method is that the inner problems can be solved in an inexact and parallel manner. The established convergence results show that our proposed algorithm still achieves optimal convergence rate even though the inner problems are solved inexactly. Finally, several numerical experiments are presented to illustrate the efficiency and effectiveness of our proposed algorithm.
Showing items related by title, author, creator and subject.
A modified alternating direction method for convex quadratically constrained quadratic semidefinite programsSun, Jie; Zhang, S. (2010)We propose a modified alternating direction method for solving convex quadratically constrained quadratic semidefinite optimization problems. The method is a first-order method, therefore requires much less computational ...
Li, Bin (2011)In this thesis, we consider several types of optimal control problems with constraints on the state and control variables. These problems have many engineering applications. Our aim is to develop efficient numerical methods ...
Ruan, Ning (2012)Duality is one of the most successful ideas in modern science  . It is essential in natural phenomena, particularly, in physics and mathematics   . In this thesis, we consider the canonical duality ...