An Asymmetric Proximal Decomposition Method for Convex Programming with Linearly Coupling Constraints
The problems studied are the separable variational inequalities with linearly coupling constraints. Some existing decomposition methods are very problem specific, and the computation load is quite costly. Combining the ideas of proximal point algorithm (PPA) and augmented Lagrangian method (ALM), we...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
2012-01-01
|
| Series: | Advances in Operations Research |
| Online Access: | http://dx.doi.org/10.1155/2012/281396 |