Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2013 (2013), Article ID 295147, 7 pages
http://dx.doi.org/10.1155/2013/295147
Research Article

Parallel Variable Distribution Algorithm for Constrained Optimization with Nonmonotone Technique

1School of Mathematical Sciences, University of the Chinese Academy of Sciences, No. 19(A), Yuquan Road, Shijingshan District, Beijing 100049, China
2College of Information Science and Engineering, Shandong University of Science and Technology, Qingdao 266510, China

Received 6 September 2012; Accepted 28 February 2013

Academic Editor: Ching-Jong Liao

Copyright © 2013 Congying Han 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. C. A. Sagastizábal and M. V. Solodov, “Parallel variable distribution for constrained optimization,” Computational Optimization and Applications, vol. 22, no. 1, pp. 111–131, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  2. M. C. Ferris and O. L. Mangasarian, “Parallel constraint distribution,” SIAM Journal on Optimization, vol. 1, no. 1, pp. 487–500, 1994. View at Google Scholar
  3. D. P. Bertsekas and J. N. Tsitsiklis, Parallel and Distributed Computation, Prentice Hall, Englewood Cliffs, NJ, USA, 1989.
  4. P. Tseng, “Dual coordinate ascent methods for non-strictly convex minimization,” Mathematical Programming, vol. 59, no. 2, pp. 231–247, 1993. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  5. M. V. Solodov, “New inexact parallel variable distribution algorithms,” Computational Optimization and Applications, vol. 7, no. 2, pp. 165–182, 1997. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  6. M. V. Solodov, “On the convergence of constrained parallel variable distribution algorithms,” SIAM Journal on Optimization, vol. 8, no. 1, pp. 187–196, 1998. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  7. F. Zheng, C. Han, and Y. Wang, “Parallel SSLE algorithm for large scale constrained optimization,” Applied Mathematics and Computation, vol. 217, no. 12, pp. 5377–5384, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  8. C. Han, Y. Wang, and G. He, “On the convergence of asynchronous parallel algorithm for large-scale linearly constrained minimization problem,” Applied Mathematics and Computation, vol. 211, no. 2, pp. 434–441, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  9. M. Fukushima, “Parallel variable transformation in unconstrained optimization,” SIAM Journal on Optimization, vol. 8, no. 3, pp. 658–672, 1998. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  10. J. Mo, K. Zhang, and Z. Wei, “A variant of SQP method for inequality constrained optimization and its global convergence,” Journal of Computational and Applied Mathematics, vol. 197, no. 1, pp. 270–281, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  11. R. Fletcher and S. Leyffer, “Nonlinear programming without a penalty function,” Mathematical Programming, vol. 91, pp. 239–269, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  12. L. Grippo, F. Lampariello, and S. Lucidi, “A nonmonotone line search technique for Newton's method,” SIAM Journal on Numerical Analysis, vol. 23, no. 4, pp. 707–716, 1986. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  13. L. Grippo, F. Lampariello, and S. Lucidi, “A truncated Newton method with nonmonotone line search for unconstrained optimization,” Journal of Optimization Theory and Applications, vol. 60, no. 3, pp. 401–419, 1989. View at Publisher · View at Google Scholar · View at MathSciNet
  14. G. Liu, J. Han, and D. Sun, “Global convergence of the BFGS algorithm with nonmonotone linesearch,” Optimization, vol. 34, no. 2, pp. 147–159, 1995. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  15. W. Sun, J. Han, and J. Sun, “Global convergence of nonmonotone descent methods for unconstrained optimization problems,” Journal of Computational and Applied Mathematics, vol. 146, no. 1, pp. 89–98, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  16. P. L. Toint, “An assessment of nonmonotone linesearch techniques for unconstrained optimization,” SIAM Journal on Scientific Computing, vol. 17, no. 3, pp. 725–739, 1996. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  17. K. Su and Z. Yu, “A modified SQP method with nonmonotone technique and its global convergence,” Computers & Mathematics with Applications, vol. 57, no. 2, pp. 240–247, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  18. Y.-X. Yuan and W. Sun, Optimization Theory and Methods, Springer, New York, NY, USA, 2006. View at MathSciNet
  19. C. T. Lawrence and A. L. Tits, “A computationally efficient feasible sequential quadratic programming algorithm,” SIAM Journal on Optimization, vol. 11, no. 4, pp. 1092–1118, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  20. I. Buck, Parallel Programming with CUDA, 2008, http://gpgpu.org/sc2008.