Skip to main content
Log in

Homogeneous Self-dual Algorithms for Stochastic Semidefinite Programming

  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

Ariyawansa and Zhu have proposed a new class of optimization problems termed stochastic semidefinite programs to handle data uncertainty in applications leading to (deterministic) semidefinite programs. For stochastic semidefinite programs with finite event space, they have also derived a class of volumetric barrier decomposition algorithms, and proved polynomial complexity of certain members of the class. In this paper, we consider homogeneous self-dual algorithms for stochastic semidefinite programs with finite event space. We show how the structure in such problems may be exploited so that the algorithms developed in this paper have complexity similar to those of the decomposition algorithms mentioned above.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Algorithm 1

Similar content being viewed by others

References

  1. Kall, P., Wallace, S.: Stochastic Programming. Wiley, New York (1994)

    MATH  Google Scholar 

  2. Todd, M.J.: Semidefinite optimization. Acta Numer. 10, 515–560 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  3. Ariyawansa, K.A., Zhu, Y.: Stochastic semidefinite programming: a new paradigm for stochastic optimization. 4OR 4(3), 239–253 (2006). An earlier version of this paper appeared as Technical Report 2004-10 of the Department of Mathematics, Washington State University, Pullman, WA 99164-3113, in October 2004

    Article  MathSciNet  MATH  Google Scholar 

  4. Ariyawansa, K.A., Zhu, Y.: A class of polynomial volumetric barrier decomposition algorithms for stochastic semidefinite programming. Math. Comput. 80, 1639–1661 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  5. Todd, M.J., Toh, K.C., Tütüncü, R.H.: On the Nesterov-Todd direction in semidefinite programming. SIAM J. Optim. 8, 769–796 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  6. Potra, F., Sheng, R.: On homogeneous interior-point algorithms for semidefinite programming. Optim. Methods Softw. 9, 161–184 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  7. Toh, K.C., Todd, M.J., Tütüncü, R.H.: SDPT3—a MATLAB software package for semidefinite programming. Optim. Methods Softw. 11/12, 545–581 (1999)

    Article  Google Scholar 

Download references

Acknowledgements

The work of S.J. was performed while he was visiting Washington State University. Research supported in part by the Chinese National Foundation under Grants No. 51139005 and 51179147. K.A.A. research supported in part by the US Army Research Office under Grant DAAD 19-00-1-0465 and by Award W11NF-08-1-0530. Y.Z. research supported in part by ASU West MGIA Grant 2007.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to K. A. Ariyawansa.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jin, S., Ariyawansa, K.A. & Zhu, Y. Homogeneous Self-dual Algorithms for Stochastic Semidefinite Programming. J Optim Theory Appl 155, 1073–1083 (2012). https://doi.org/10.1007/s10957-012-0110-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10957-012-0110-x

Keywords

Navigation