Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2013 (2013), Article ID 246596, 6 pages
http://dx.doi.org/10.1155/2013/246596
Research Article

An Accelerated Proximal Gradient Algorithm for Singly Linearly Constrained Quadratic Programs with Box Constraints

1School of Mathematical Sciences, University of Chinese Academy of Sciences, Shijingshan District, Beijing 100049, China
2College of Information Science and Engineering, Shandong University of Science and Technology, Qingdao 266590, China

Received 4 August 2013; Accepted 23 September 2013

Academic Editors: I. Ahmad and P.-y. Nie

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. L. Zanni, “An improved gradient projection-based decomposition technique for support vector machines,” Computational Management Science, vol. 3, no. 2, pp. 131–145, 2006. View at Publisher · View at Google Scholar · View at Scopus
  2. S. Lucidi, L. Palagi, A. Risi, and M. Sciandrone, “A convergent decomposition algorithm for support vector machines,” Computational Optimization and Applications, vol. 38, no. 2, pp. 217–234, 2007. View at Publisher · View at Google Scholar · View at Scopus
  3. T. Serafini and L. Zanni, “On the working set selection in gradient projection-based decomposition techniques for support vector machines,” Optimization Methods and Software, vol. 20, no. 4-5, pp. 583–596, 2005. View at Publisher · View at Google Scholar · View at Scopus
  4. P. Tseng and S. Yun, “A coordinate gradient descent method for nonsmooth separable minimization,” Mathematical Programming B, vol. 117, no. 1-2, pp. 387–423, 2009. View at Publisher · View at Google Scholar · View at Scopus
  5. T. Serafini, G. Zanghirati, and L. Zanni, “Gradient projection methods for large quadratic programs and applications in training support vector machines,” Optimization Methods and Software, vol. 20, pp. 353–378, 2003. View at Google Scholar · View at Scopus
  6. Y. Dai and R. Fletcher, “New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds,” Mathematical Programming, vol. 106, no. 3, pp. 403–421, 2006. View at Publisher · View at Google Scholar · View at Scopus
  7. G. Zanghirati and L. Zanni, “A parallel solver for large quadratic programs in training support vector machines,” Parallel Computing, vol. 29, no. 4, pp. 535–551, 2003. View at Publisher · View at Google Scholar · View at Scopus
  8. L. Zanni, T. Serafini, and G. Zanghirati, “Parallel software for training large scale support vector machines on multiprocessor systems,” Journal of Machine Learning Research, vol. 7, pp. 1467–1492, 2006. View at Google Scholar · View at Scopus
  9. H. Congying, W. Yongli, and H. Guoping, “On the convergence of asynchronous parallel algorithm for large-scale linearly constrained minimization problem,” Applied Mathematics and Computation, vol. 2, pp. 434–441, 2009. View at Google Scholar · View at Scopus
  10. Z. Fangying, H. Congying, and W. Yongli, “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 Scopus
  11. Y. Nesterov, “Smooth minimization of non-smooth functions,” Mathematical Programming, vol. 103, no. 1, pp. 127–152, 2005. View at Publisher · View at Google Scholar · View at Scopus
  12. A. Nemirovski, “Prox-method with rate of convergence O(1/t) for variational inequalities with lipschitz continuous monotone operators and smooth convex-concave saddle point problems,” SIAM Journal on Optimization, vol. 15, no. 1, pp. 229–251, 2005. View at Publisher · View at Google Scholar · View at Scopus
  13. A. Beck and M. Teboulle, “A fast iterative shrinkage-thresholding algorithm for linear inverse problems,” SIAM Journal on Imaging Sciences, vol. 2, pp. 183–202, 2009. View at Google Scholar
  14. P. Tseng, “On accelerated proximal gradient methods for convex-concave optimization,” SIAM Journal on Optimization. In press. View at Google Scholar
  15. T. Joachims, “Making large-scale SVM learning practical,” in Advances in Kernel Methods: Support Vector Learning, B. Scholkopf, C. J. C. Burges, and A. J. Smola, Eds., pp. 169–184, MIT Press, Cambridge, Mass, USA, 1998. View at Google Scholar