Table of Contents Author Guidelines Submit a Manuscript
Advances in Operations Research
Volume 2012, Article ID 281396, 20 pages
Research Article

An Asymmetric Proximal Decomposition Method for Convex Programming with Linearly Coupling Constraints

1Institute of System Engineering, Southeast University, Nanjing 210096, China
2Department of Mathematics, Nanjing University, Nanjing 210093, China
3Department of Mathematics, Guangxi Normal University, Guilin 541004, China

Received 17 November 2011; Accepted 10 January 2012

Academic Editor: Abdellah Bnouhachem

Copyright © 2012 Xiaoling Fu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Order Reprints

  • Quantity0
  • Order Charges0
  • Total$0
Billing Address
Shipping Address

We will contact you on the email provided to confirm your request and arrange payment.