Table of Contents Author Guidelines Submit a Manuscript
Journal of Function Spaces
Volume 2018, Article ID 3742575, 12 pages
https://doi.org/10.1155/2018/3742575
Research Article

Inexact SA Method for Constrained Stochastic Convex SDP and Application in Chinese Stock Market

1Information and Engineering College, Dalian University, Dalian, China
2School of Mathematical Sciences, Dalian University of Technology, Dalian, China
3School of Finance, Zhejiang University of Finance and Economics, Hangzhou, China

Correspondence should be addressed to Shuang Chen; moc.361@7070gnauhsnehc

Received 4 August 2017; Revised 17 November 2017; Accepted 13 December 2017; Published 23 January 2018

Academic Editor: Dhananjay Gopal

Copyright © 2018 Shuang Chen 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. K. Ariyawansa and Y. Zhu, “A class of polynomial volumetric barrier decomposition algorithms for stochastic semidefinite programming,” Mathematics of Computation, vol. 80, no. 275, pp. 1639–1661, 2011. View at Google Scholar
  2. K. A. Ariyawansa and Y. Zhu, “Stochastic semidefinite programming: a new paradigm for stochastic optimization,” 4OR, vol. 4, no. 3, pp. 239–253, 2006. View at Google Scholar
  3. S. Jin, K. A. Ariyawansa, and Y. Zhu, “Homogeneous self-dual algorithms for stochastic semidefinite programming,” Journal of Optimization Theory and Applications, vol. 155, no. 3, pp. 1073–1083, 2012. View at Google Scholar
  4. S. Mehrotra and M. G. Gozevin, “Decomposition-based interior point methods for two-stage stochastic semidefinite programming,” SIAM Journal on Optimization, vol. 18, no. 1, pp. 206–222, 2007. View at Google Scholar
  5. Y. Zhu, J. Zhang, and K. Partel, “Location-aided routing with uncertainty in mobile ad hoc networks: A stochastic semidefinite programming approach,” Mathematical and Computer Modelling, vol. 53, no. 11-12, pp. 2192–2203, 2011. View at Publisher · View at Google Scholar · View at Scopus
  6. N. J. Higham, “Computing the nearest correlation matrix---a problem from finance,” IMA Journal of Numerical Analysis (IMAJNA), vol. 22, no. 3, pp. 329–343, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  7. F. Alizadeh, “Interior point methods in semidefinite programming with applications to combinatorial optimization,” SIAM Journal on Optimization, vol. 5, no. 1, pp. 13–51, 1995. View at Publisher · View at Google Scholar · View at MathSciNet
  8. K. Jiang, D. Sun, and K. C. Toh, “An inexact accelerated proximal gradient method for large scale linearly constrained convex SDP,” SIAM Journal on Optimization, vol. 22, no. 3, pp. 1042–1064, 2012. View at Google Scholar
  9. M. J. Todd, “Semidefinite optimization,” Acta Numerica, vol. 10, no. 126, pp. 515–560, 2001. View at Google Scholar
  10. L. Vandenberghe and S. Boyd, “Semidefinite programming,” SIAM Review, vol. 38, no. 1, pp. 49–95, 1996. View at Google Scholar
  11. H. Wolkowicz, R. Saigal, and L. Vandenberghe, Handbook of semidefinite programming: theory, algorithms, and applications, vol. 27, Kluwer Academic Pub, New York, NY, USA, 2000.
  12. J. Malick, “A dual approach to semidefinite least-squares problems,” SIAM Journal on Matrix Analysis and Applications, vol. 26, no. 1, pp. 272–284, 2004. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. H. Qi and D. Sun, “A quadratically convergent Newton method for computing the nearest correlation matrix,” SIAM Journal on Matrix Analysis and Applications, vol. 28, no. 2, pp. 360–385, 2006. View at Google Scholar
  14. K. C. Toh, R. H. Tutuncu, and M. J. Todd, “Inexact primal-dual path-following algorithms for a special class of convex quadratic SDP and related problems,” Pacific Journal of Optimization, vol. 3, pp. 135–164, 2007. View at Google Scholar
  15. S. Ghadimi and G. Lan, “Stochastic first- and zeroth-order methods for nonconvex stochastic programming,” Siam Journal on Optimization, vol. 23, no. 4, pp. 2341–2368, 2013. View at Google Scholar
  16. G. Lan, A. Nemirovski, and A. Shapiro, “Validation analysis of mirror descent stochastic approximation method,” Mathematical Programming, vol. 134, no. 2, pp. 425–458, 2012. View at Google Scholar
  17. G. Lan and S. Ghadimi, “Optimal stochastic approximation algorithms for strongly convex stochastic composite optimization i: a generic algorithmic framework,” Siam Journal on Optimization, vol. 22, no. 4, pp. 1469–1492, 2012. View at Google Scholar
  18. G. Lan and S. Ghadimi, “Optimal stochastic approximation algorithms for strongly convex stochastic composite optimization, ii: shrinking procedures and optimal algorithms,” Siam Journal on Optimization, vol. 23, no. 4, pp. 2061–2089, 2010. View at Google Scholar
  19. G. Lan, “An optimal method for stochastic composite optimization,” Mathematical Programming, vol. 133, no. 1-2, Ser. A, pp. 365–397, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  20. A. Nemirovski and D. Yudin, “On Cezaris convergence of the steepest descent method for approximating saddle point of convex-concave functions,” in Soviet Math. Dokl, vol. 19, 1978. View at Google Scholar
  21. A. Nemirovski, A. Juditsky, G. Lan, and A. Shapiro, “Robust stochastic approximation approach to stochastic programming,” SIAM Journal on Optimization, vol. 19, no. 4, pp. 1574–1609, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  22. H. Robbins and D. Siegmund, “A convergence theorem for nonnegative almost supermartingales and some applications,” in J. S. Rustagi, Optimizing Methods in Statistics, pp. 233–257, Academic Press, New York, NY, USA, 1971. View at Google Scholar
  23. A. S. Nemirovsky and D. B. Yudin, 1983, Problem complexity and method efficiency in optimization.