Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2014, Article ID 540450, 8 pages
http://dx.doi.org/10.1155/2014/540450
Research Article

A Line-Search-Based Partial Proximal Alternating Directions Method for Separable Convex Optimization

1College of Mathematics and Econometrics, Hunan University, Changsha 410082, China
2Department of Mathematics, Hunan First Normal University, Changsha 410205, China
3College of Mathematics and Computer Science, Fuzhou University, Fuzhou 350108, China

Received 26 January 2014; Accepted 25 April 2014; Published 7 May 2014

Academic Editor: Jose L. Gracia

Copyright © 2014 Yu-hua Zeng 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.

Linked References

  1. G. Chen and M. Teboulle, “A proximal-based decomposition method for convex minimization problems,” Mathematical Programming, vol. 64, no. 1, Ser. A, pp. 81–101, 1994. View at Publisher · View at Google Scholar · View at MathSciNet
  2. P. Tseng, “Alternating projection-proximal methods for convex programming and variational inequalities,” SIAM Journal on Optimization, vol. 7, no. 4, pp. 951–965, 1997. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  3. B. He, L.-Z. Liao, D. Han, and H. Yang, “A new inexact alternating directions method for monotone variational inequalities,” Mathematical Programming, vol. 92, no. 1, pp. 103–118, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  4. B.-S. He, L.-Z. Liao, and M.-J. Qian, “Alternating projection based prediction-correction methods for structured variational inequalities,” Journal of Computational Mathematics, vol. 24, no. 6, pp. 693–710, 2006. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  5. B.-S. He, S.-l. Wang, and H. Yang, “A modified variable-penalty alternating directions method for monotone variational inequalities,” Journal of Computational Mathematics, vol. 21, no. 4, pp. 495–504, 2003. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  6. B. He and J. Zhou, “A modified alternating direction method for convex minimization problems,” Applied Mathematics Letters, vol. 13, no. 2, pp. 123–130, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  7. L. A. Parente, P. A. Lotito, and M. V. Solodov, “A class of inexact variable metric proximal point algorithms,” SIAM Journal on Optimization, vol. 19, no. 1, pp. 240–260, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  8. P. Smoczynski and M. A. Tawhid, “Two numerical schemes for general variational inequalities,” Journal of Industrial and Management Optimization, vol. 4, no. 2, pp. 393–406, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  9. B. S. He, H. Yang, and S. L. Wang, “Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities,” Journal of Optimization Theory and Applications, vol. 106, no. 2, pp. 337–356, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  10. W. Yin, S. Osher, D. Goldfarb, and J. Darbon, “Bregman iterative algorithms for l1-minimization with applications to compressed sensing,” SIAM Journal on Imaging Sciences, vol. 1, no. 1, pp. 143–168, 2008. View at Publisher · View at Google Scholar · View at MathSciNet