Skip to main content
Log in

A trust region method for solving semidefinite programs

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

An Erratum to this article was published on 21 March 2013

Abstract

When using interior point methods for solving semidefinite programs (SDP), one needs to solve a system of linear equations at each iteration. For problems of large size, solving the system of linear equations can be very expensive. In this paper, we propose a trust region algorithm for solving SDP problems. At each iteration we perform a number of conjugate gradient iterations, but do not need to solve a system of linear equations. Under mild assumptions, the convergence of this algorithm is established. Numerical examples are given to illustrate the convergence results obtained.

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. Kočvara, M., Stingl, M.: On the solution of large-scale SDP problems by the modified barrier method using iterative solvers. Math. Program. 109, 413–444 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  2. Alizadeh, F., Pierre, J., Haeberly, A., Overton, M.L.: A new primal-dual interior-point method for semidefinite programming. In: Proceedings of the Fifth SIAM Conference on Applied Linear Algebra, pp. 113–117. SIAM, Philadelphia (1994)

    Google Scholar 

  3. Nesterov, Y., Nemirovskii, A.: Interior-Point Polynomial Algorithms in Convex Programming. SIAM Studies in Applied Mathematics. SIAM, Philadelphia (1994)

    Book  MATH  Google Scholar 

  4. Monteiro, R.D.C.: Primal-dual path following algorithms for semidefinite programming. SIAM J. Optim. 7, 663–678 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  5. Helmberg, C., Rendl, F., Vanderbei, R.: An interior point method for semidefinite programming. SIAM J. Optim. 6, 342–361 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  6. Toh, K.C.: Solving large scale semidefinite programs via an iterative solver on the augmented systems. SIAM J. Optim. 14, 670–698 (2004)

    Article  MathSciNet  Google Scholar 

  7. Zhao, X.Y., Sun, D.F., Toh, K.C.: A Newton-CG augmented Lagrangian method for semidefinite programming. SIAM J. Optim. 20, 1737–1765 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  8. Jarre, F., Rendl, F.: An augmented primal-dual method for linear conic programs. SIAM J. Optim. 19, 808–823 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  9. Kanzow, C., Nagel, C.: Semidefinite programming: new search direction, smoothing-type methods and numerical results. SIAM J. Optim. 13, 1–23 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  10. Burer, S., Monteiro, R.D.C.: A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization. Math. Program. 95, 329–357 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  11. Malick, J., Povh, J., Rendl, F., Wiegele, A.: Regularization methods for semidefinite programming. SIAM J. Optim. 1, 336–356 (2009)

    Article  MathSciNet  Google Scholar 

  12. Toh, K.C., Kojima, M.: Solving some large scale semidefinite programs via the conjugate residual method. SIAM J. Optim. 12, 669–691 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  13. Leibfritz, F., Mostafa, E.M.E.: An interior point constrained trust region method for a special class of nonlinear semidefinite programming. SIAM J. Optim. 12, 1048–1074 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  14. Conn, A.R., Gould, N.I.M., Toint, Pl.L.: Trust Region Methods. MPSSIAM Series on Optimization. SIAM, Philadelphia (2000)

    Book  MATH  Google Scholar 

  15. Helmberg, C.: Semidefinite Programming for Combinatorial Optimization. Konard-Zuse-Zent rum für informationstechnik Berlin, Germany, October 2000

  16. Micheaio, S.: Metric Spaces. Springer Undergraduate Mathematics Series. Springer, Berlin (2006)

    Google Scholar 

  17. Sun, D., Sun, J.: Semismooth matrix-valued functions. Math. Oper. Res. 27, 150–169 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  18. Hiriart-Urruty, J.-B., Lemaréchal, C.: Convex Analysis and Minimization Algorithms. Springer, Heidelberg (1993). Two volumes

    Google Scholar 

  19. Tseng, P.: Merit functions for semi-definite complementarity problems. Math. Program. 83, 159–185 (1998)

    MATH  Google Scholar 

  20. Pang, J.-S., Sun, D., Sun, J.: Semismooth Homeomorphisms and strong stability of semidefinite and Lorentz complementarity problems. Math. Oper. Res. 28, 39–63 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  21. Yuan, Y.: On the truncated conjugate gradient method. Math. Program. 87, 561–573 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  22. Saad, Y.: Iterative Methods for Sparse Linear Systems. PWS Publishing Company, Boston (1996)

    MATH  Google Scholar 

  23. Higham, N.J.: Computing a nearest symmetric positive semidefinite matrix. Linear Algebra Appl. 103, 103–118 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  24. Dolan, E.D., Moré, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201–213 (2002)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

The authors would like to thank Professor Florian Jarre for his advice and guidance, and also the editor and three referees for their helpful comments.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Aiqun Huang.

Additional information

This work is supported by National Natural Science Foundation of China 10971162.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Huang, A., Xu, C. A trust region method for solving semidefinite programs. Comput Optim Appl 55, 49–71 (2013). https://doi.org/10.1007/s10589-012-9514-7

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10589-012-9514-7

Keywords

Navigation