A fast dual gradient method for separable convex optimization via smoothing
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 pr...
| Main Authors: | , , , , , , |
|---|---|
| Format: | Journal Article |
| Published: |
Yokohama Publishers
2016
|
| Online Access: | http://hdl.handle.net/20.500.11937/40067 |