Skip to main content
SpringerLink
Log in

On a Commutative Class of Search Directions for Linear Programming over Symmetric Cones

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

Abstract

The commutative class of search directions for semidefinite programming was first proposed by Monteiro and Zhang (Ref. 1). In this paper, we investigate the corresponding class of search directions for linear programming over symmetric cones, which is a class of convex optimization problems including linear programming, second-order cone programming, and semidefinite programming as special cases. Complexity results are established for short-step, semilong-step, and long-step algorithms. Then, we propose a subclass of the commutative class for which we can prove polynomial complexities of the interior-point method using semilong steps and long steps. This subclass still contains the Nesterov–Todd direction and the Helmberg–Rendl–Vanderbei–Wolkowicz/Kojima–Shindoh–Hara/Monteiro direction. An explicit formula to calculate any member of the class is also given.

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. MONTEIRO, R. D. C., and ZHANG, Y., A Unified Analysis for a Class of Path-Following Primal-Dual Interior-Point Algorithms for Semidefinite Programming, Mathematical Programming, Vol. 81, pp. 281–299, 1998.

    Google Scholar 

  2. NESTEROV, Y. E., and TODD, M. J., Primal-Dual Interior-Point Methods for Self-Scaled Cones, SIAM Journal on Optimization, Vol. 8, pp. 324–364, 1998.

    Google Scholar 

  3. FAYBUSOVICH, L., Jordan Algebras, Symmetric Cones, and Interior-Point Methods, Technical Report, Department of Mathematics, Notre Dame University, 1995.

    Google Scholar 

  4. FAYBUSOVICH, L., Linear Systems in Jordan Algebras and Primal-Dual Interior-Point Algorithms, Journal of Computational and Applied Mathematics, Vol. 86, pp. 149–175, 1997.

    Google Scholar 

  5. STURM, J. F., Similarity and Other Spectral Relations for Symmetric Cones, Linear Algebra and Its Applications, Vol. 312, pp. 135–154, 2000.

    Google Scholar 

  6. SCHMIETA, S. H., and ALIZADEH, F., Associatiue Algebras, Symmetric Cones, and Polynomial-Time Interior-Point Algorithms, RUTCOR Research Report, Rutgers University, 1998.

  7. MONTEIRO, R. D. C., Primal-Dual Path-Following Algorithms for Semidefinite Programming, SIAM Journal on Optimization, Vol. 7, pp. 663–678, 1997.

    Google Scholar 

  8. ZHANG, Y., On Extending Some Primal-Dual Interior-Point Algorithms from Linear Programming to Semidefinite Programming, SIAM Journal on Optimization, Vol. 8, pp. 365–386, 1998.

    Google Scholar 

  9. GU, M., On Primal-Dual Interior-Point Methods for Semidefinite Programming, CAM Report 97–12, Department of Mathematics, University of California at Los Angeles, 1997.

  10. MONTEIRO, R. D. C., and TSUCHIYA, T., Polynomial Conuergence of Primal-Dual Algorithms for the Second-Order Cone Program Based on the MZ-Family of Directions, Mathematical Programming, Vol. 88, pp. 61–83, 2000.

    Google Scholar 

  11. TSUCHIYA, T., A Polynomial Primal-Dual Path-Following Algorithm for Second-Order Cone Programming, Research Memorandum 649, Institute of Statistical Mathematics, Tokyo, Japan, 1997.

    Google Scholar 

  12. TSUCHIYA, T., A Conuergence Analysis of the Scaling-Inuariant Primal-Dual Path-Following Algorithms for Second-Order Cone Programming, Optimization Methods and Software, Vols. 11–12, pp. 141–182, 1999.

    Google Scholar 

  13. HELMBERG, C., RENDL, F., VANDERBEI, R. J., and WOLKOWICZ, H., An Interior-Point Method for Semidefinite Programming, SIAM Journal on Optimization, Vol. 6, pp. 342–361, 1996.

    Google Scholar 

  14. KOJIMA, M., SHINDOH, S., and HARA, S., Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices, SIAM Journal on Optimization, Vol. 7, pp. 86–125, 1997.

    Google Scholar 

  15. FARAUT, J., and KOR'ANYI, A., Analysis on Symmetric Cones, Oxford University Press, New York, NY, 1994.

    Google Scholar 

  16. ALIZADEH, F., HAEBERLY, J. P. A., and OVERTON, M. L., Primal-Dual Interior-Point Methods for Semidefinite Programming, Technical Report 659, Computer Science Department, Courant Institute of Mathematical Sciences, New York University, 1994.

    Google Scholar 

  17. FAYBUSOVICH, L., and ARANA, R., A Long-Step Primal-Dual Algorithm for the Symmetric Programming Problem, Technical Report, Department of Mathematics, Notre Dame University, 2000.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The University of Electro-Communications, Chofu-Shi, Tokyo, Japan

    M. Muramatsu (Associate Professor)

Authors
  1. M. Muramatsu
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Muramatsu, M. On a Commutative Class of Search Directions for Linear Programming over Symmetric Cones. Journal of Optimization Theory and Applications 112, 595–625 (2002). https://doi.org/10.1023/A:1017920200889

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1017920200889

Search

Navigation