A fast dual gradient method for separable convex optimization via smoothing
MetadataShow full item record
This paper considers a class of separable convex optimization problems with linear coupled constraints arising in many applications. Based on a novel smoothing technique, a simple fast dual gradient method is presented to solve the class of problems. Then the convergence of the proposed method is proved and the computational complexity bound of the method for achieving an approximately optimal solution is given explicitly. An improved iteration complexity bound is obtained when the objective function of the problem is strongly convex. Our algorithm is simple and fast, which can be implemented in a parallel fashion. Numerical experiments on a network utility maximization problem to illustrate the effectiveness of the proposed algorithm.
Showing items related by title, author, creator and subject.
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 ...
Chong, Yen N. (2001)General routing problems deal with transporting some commodities and/or travelling along the axes of a given network in some optimal manner. In the modern world such problems arise in several contexts such as distribution ...