About this Journal Submit a Manuscript Table of Contents
Abstract and Applied Analysis
Volume 2013 (2013), Article ID 912846, 6 pages
http://dx.doi.org/10.1155/2013/912846
Research Article

Convergence Analysis of the Relaxed Proximal Point Algorithm

1School of Economics and Management, Southeast University, Nanjing 210096, China
2Department of Mathematics, Nanjing University, Nanjing 210093, China

Received 3 May 2013; Accepted 9 June 2013

Academic Editor: Abdellah Bnouhachem

Copyright © 2013 Min Li and Yanfei You. 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. S. Dafermos and A. Nagurney, “Supply and demand equilibration algorithms for a class of market equilibrium problems,” Transportation Science, vol. 23, no. 2, pp. 118–124, 1989. View at Publisher · View at Google Scholar
  2. M. C. Ferris and J. S. Pang, “Engineering and economic applications of complementarity problems,” SIAM Review, vol. 39, no. 4, pp. 669–713, 1997. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  3. D. Kinderlehrer and G. Stampacchia, An Introduction to Variational Inequalities and their Applications, vol. 88, Academic Press, New York, NY, USA, 1980. View at MathSciNet
  4. A. Nagurney, Network Economics: A Variational Inequality Approach, vol. 1, Kluwer Academic, Dordrecht, The Netherlands, 1993. View at Publisher · View at Google Scholar · View at MathSciNet
  5. B. Martinet, “Régularisation D'inéquations Variationnelles par Approximations Successives,” Revue Française dInformatique et de Recherche Opérationelle, vol. 4, pp. 154–158, 1970. View at Zentralblatt MATH · View at MathSciNet
  6. 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 · View at MathSciNet
  7. R. T. Rockafellar, “Augmented Lagrangians and applications of the proximal point algorithm in convex programming,” Mathematics of Operations Research, vol. 1, no. 2, pp. 97–116, 1976. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  8. E. G. Gol'shtein and N. V. Tret'yakov, “Modified Lagrangians in convex programming and their generalizations,” Mathematical Programming Study, no. 10, pp. 86–97, 1979. View at MathSciNet
  9. R. Glowinski and A. Marrocco, “Sur l'approximation, par éléments finis d'ordre un, et la résolution, par pénalisation-dualité, d'une classe de problèmes de Dirichlet non linéaires,” RAIRO, vol. 9, no. R-2, pp. 41–76, 1975. View at Zentralblatt MATH · View at MathSciNet
  10. D. Gabay and B. Mercier, “A dual algorithm for the solution of nonlinear variational problems via finite-element approximations,” Computers & Mathematics with Applications, vol. 2, no. 1, pp. 17–40, 1976. View at Publisher · View at Google Scholar
  11. X. J. Cai, G. Y. Gu, B. S. He, and X. M. Yuan, A Proximal Point Algorithm Revisit on the Alternating Direction Method of Multipliers, Science China Mathematics.
  12. B. He and X. Yuan, “On the O(1/n) convergence rate of the Douglas-Rachford alternating direction method,” SIAM Journal on Numerical Analysis, vol. 50, no. 2, pp. 700–709, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  13. Y. F. You, X. L. Fu, and B. S. He, Lagrangian PPA-Based Contraction Methods for Linearly Constrained Convex Optimization, manuscript, 2013.
  14. F. Facchinei and J. S. Pang, Finite-Dimensional Variational Inequalities and Complementarity Problems, Springer Series in Operations Research, Springer, New York, NY, USA, 2003.
  15. Yu. Nesterov, “Gradient methods for minimizing composite functions,” Mathematical Programming, 2012. View at Publisher · View at Google Scholar