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

A Decomposition Algorithm for Convex Nondifferentiable Minimization with Errors

1School of Sciences, Shenyang University, Shenyang 110044, China
2School of Mathematical Sciences, Dalian University of Technology, Dalian 116024, China
3School of Mathematics, Liaoning Normal University, Dalian 116029, China

Received 29 July 2011; Accepted 25 October 2011

Academic Editor: Chein-Shan Liu

Copyright © 2012 Yuan Lu 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. J. J. Moreau, “Proximitéet dualité dans un espace hilbertien,” Bulletin de la Société Mathématique de France, vol. 93, pp. 273–299, 1965. View at Google Scholar
  2. R. T. Rockafellar, “Monotone operators and the proximal point algorithm,” SIAM Journal on Control and Optimization, vol. 14, no. 5, pp. 877–898, 1976. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  3. A. Auslender, “Numerical methods for nondifferentiable convex optimization,” Mathematical Programming Study, no. 30, pp. 102–126, 1987. View at Google Scholar · View at Zentralblatt MATH
  4. J.-B. Hiriart-Urruty and C. Lemaréchal, Convex Analysis and Minimization Algo-Rithms, vol. 2, Springer, 1993.
  5. C. Lemaréchal, F. Oustry, and C. Sagastizábal, “The 𝒰-lagrangian of a convex function,” Transactions of the American Mathematical Society, vol. 352, no. 2, pp. 711–729, 2000. View at Publisher · View at Google Scholar
  6. R. Mifflin and C. Sagastizábal, “𝒱𝒰-decomposition derivatives for convex max-functions,” in Ill-Posed Variational Problems and Regularization Techniques, vol. 477 of Lecture Notes in Economics and Mathematical Systems, pp. 167–186, Springer, Berlin, Germany, 1999. View at Google Scholar · View at Zentralblatt MATH
  7. R. Mifflin and C. Sagastizábal, “On 𝒱𝒰-theory for functions with primal-dual gradient structure,” SIAM Journal on Optimization, vol. 11, no. 2, pp. 547–571, 2000. View at Publisher · View at Google Scholar
  8. R. Mifflin and C. Sagastizábal, “A 𝒱𝒰-algorithm for convex minimization,” Mathematical Programming B, vol. 104, no. 2-3, pp. 583–608, 2005. View at Publisher · View at Google Scholar
  9. Y. Lu, L.-P. Pang, X.-J. Liang, and Z.-Q. Xia, “An approximate decomposition algorithm for convex minimization,” Journal of Computational and Applied Mathematics, vol. 234, no. 3, pp. 658–666, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  10. R. Mifflin and C. Sagastizábal, “Proximal points are on the fast track,” Journal of Convex Analysis, vol. 9, no. 2, pp. 563–579, 2002. View at Google Scholar · View at Zentralblatt MATH
  11. M. V. Solodov, “On approximations with finite precision in bundle methods for nonsmooth optimization,” Journal of Optimization Theory and Applications, vol. 119, no. 1, pp. 151–165, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  12. R. Correa and C. Lemaréchal, “Convergence of some algorithms for convex minimization,” Mathematical Programming B, vol. 62, no. 2, pp. 261–275, 1993. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  13. M. Hintermüller, “A proximal bundle method based on approximate subgradients,” Computational Optimization and Applications, vol. 20, no. 3, pp. 245–266, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH