Skip to main content
SpringerLink
Log in

Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step

  • Original Paper
  • Published:
Numerical Algorithms Aims and scope Submit manuscript

Abstract

Interior-point methods for semidefinite optimization problems have been studied frequently, due to their polynomial complexity and practical implications. In this paper we propose a primal-dual infeasible interior-point algorithm that uses full Nesterov-Todd (NT) steps with a different feasibility step. We obtain the currently best known iteration bound for semidefinite optimization problems.

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

Access this article

Log in via an institution

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. Alizadeh, F.: Interior-point methods in semidefinite programming with applications to combinatorial optimization. SIAM J. Optim. 5, 13–51 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  2. Darvay, Z.: New interior point algorithms in linear programming. Adv. Model. Optim. 5(1), 51–92 (2003)

    MathSciNet  MATH  Google Scholar 

  3. De Klerk, E.: Aspects of Semidefinite Programming. Applied Optimization, vol. 65. Kluwer Academic, Dordrecht (2002)

    Google Scholar 

  4. Karisch, E.S., Rendl, F., Clausen, J.: Solving graph bisection problems with semidefinite programming. INFORMS J. Comput. 12(3), 177–191 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  5. Kojima, M., Shida, M., Hara, S.: Local convergence of predictor-corrector infeasible interior-point algorithm for SDPs and SDLCPs. Math. Program. Ser. A, 80, 129–160 (1998)

    MATH  Google Scholar 

  6. Kojima, M., Megiddo, N., Noma, T., Yoshise, A.: A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems. Lecture Notes in Comput. Sci., vol. 538. Springer, Berlin (1991)

    Book  Google Scholar 

  7. Liu, Z., Sun, W.: An infeasible interior-point algorithm with full-Newton step for linear optimization. Numer. Algorithms 46, 173–188 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  8. Luo, Z.Q., Sturm, J., Zhang, S.Z.: Superlinear convergence of a symmetric primal-dual path following algorithm for semidefinite programming. SIAM J. Optim. 8, 59–81 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  9. Lustig, I.J.: Feasible issues in a primal-dual interior point method for linear programming. Math. Program. 49, 145–162 (1990/1991)

    Article  MathSciNet  Google Scholar 

  10. Lütkepohl, H.: Handbook of Matrices. Wiley, Chichester (1996)

    MATH  Google Scholar 

  11. Mansouri, H., Roos, C.: A new full-Newton step O(n) infeasible interior-point algorithm for semidefinite optimization. Numer. Algorithms 52, 225–255 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  12. Mansouri, H., Roos, C.: Simplified O(nL) infeasible interior-point algorithm for linear optimization using full-Newton step. Optim. Methods Softw. 22(3), 519–530 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  13. Nesterov, Y.E., Todd, M.J.: Self-scaled barriers and interior-point methods for convex programming. Math. Oper. Res. 22(1), 1–42 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  14. Nesterov, Y.E., Todd, M.J.: Primal-dual interior-point methods for self-scaled cones. SIAM J. Optim. 8(2), 324–364 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  15. Peng, J., Roos, C., Terlaky, T.: New complexity analysis of the primal-dual method for semidefinite optimization based on the NT-direction. J. Optim. Theory Appl. 109(2), 327–343 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  16. Peng, J., Roos, C., Terlaky, T.: Self-regular functions and new search directions for linear and semidefinite optimization. Math. Program. Ser. A. 93(1), 129–171 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  17. Peng, J., Roos, C., Terlaky, T.: Self-regularity. A New Paradigm for Primal-Dual Interior-Point Algorithms. Princeton University Press, Princeton (2002)

    MATH  Google Scholar 

  18. Potra, F.A., Sheng, R.: A superlinear convergent primal-dual infeasible-interior-point algorithm for semidefinite programming. SIAM J. Optim. 8, 1007–1028 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  19. Roos, C.: A full-Newton step O(n) infeasible interior-point algorithm for linear optimization. SIAM J. Optim. 16(4), 1110–1136 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  20. Roos, C., Terlaky, T., Vial, J.-Ph.: Theory and Algorithm for Linear Optimization. An Interior-Point Approach. Wiley, Chichester (1997)

    Google Scholar 

  21. Wang, G.Q., Bai, Y.Q., Roos, C.: Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function. J. Math. Model. Algorithms 4, 409–433 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  22. Wolkowicz, H., Saigal, R., Vandenberghe, L.: Handbook of Semidefinite Programming, Theory, Algorithm, and Applications. Kluwer Academic Publishers, Dordrecht, The Netherlands (2000)

    Book  Google Scholar 

  23. Wang, G.Q., Bai, Y.Q.: A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd steps. Appl. Math. Comput. 215(3), 1047–1061 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  24. Zhang, Y.: On extending some primal-dual interior-point algorithms from linear programming to semidefinite programming. SIAM J. Optim. 8, 365–386 (1998)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Azarbaijan University of Tarbiat Moallem, Tabriz, Iran

    Behrouz Kheirfam

Authors
  1. Behrouz Kheirfam
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Behrouz Kheirfam.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kheirfam, B. Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step. Numer Algor 59, 589–606 (2012). https://doi.org/10.1007/s11075-011-9506-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11075-011-9506-1

Keywords

Mathematics Subject Classifications (2010)

Search

Navigation