Skip to main content
Log in

Characterization of the barrier parameter of homogeneous convex cones

  • Published:
Mathematical Programming Submit manuscript

Abstract

We characterize the smallest (best) barrier parameter of self-concordant barriers for homogeneous convex cones. In particular, we prove that this parameter is the same as the rank of the cone which is the number of steps in a recursive construction of the cone (Siegel domain construction). We also provide lower bounds on the barrier parameter in terms of the Carathéodory number of the cone. The bounds are tight for homogeneous self-dual cones. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.

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.

Similar content being viewed by others

References

  1. J. Dorfmeister, Homogeneous Siegel domains,Nagoya Math. J. 86 (1982) 39–83.

    Google Scholar 

  2. J. Faraut and A. Korányi,Analysis on Symmetric Cones (Oxford University Press, New York, 1994).

    Google Scholar 

  3. L. Faybusovich, Jordan algebras, symmetric cones and interior-point methods, Manuscript, Dept. of Mathematics, University of Notre Dame, IN, USA, 1995.

    Google Scholar 

  4. S.G. Gindikin, Analysis in homogeneous domains,Russian Math. Surveys 19 (1964) 1–89.

    Google Scholar 

  5. S.G. Gindikin,Tube domains and the Cauchy problem, Translation of Mathematical Monographs, Vol. 111 (AMS Providence, RI, 1992).

    Google Scholar 

  6. O. Güler, Barrier functions in interior point methods,Mathematics of Operations Research 21 (1996) 860–885.

    Google Scholar 

  7. O. Güler and L. Tunçel, Invariant barrier functions on homogeneous convex cones,in preparation.

  8. A. Krieg,Modular Forms on Half-Spaces of Quaternions, Lecture Notes in Mathematics, Vol. 1143 (Springer, New York, 1985).

    Google Scholar 

  9. A.S. Nemirovskii, Private communication, 1995.

  10. Yu.E. Nesterov and A.S. Nemirovskii,Interior-Point Polynomial Algorithms in Convex Programming (SIAM Publications, Philadelphia, PA, 1994).

    Google Scholar 

  11. Yu.E. Nesterov and M.J. Todd, Self-scaled barriers and interior-point methods for convex programming,Mathematics of Operations Research 22 (1997) 1–46.

    Google Scholar 

  12. Yu.E. Nesterov and M.J. Todd, Primal-dual interior-point methods for self-scaled cones, SIAM Journal on Optimization (1997), to appear.

  13. M. Ramana, L. Tunçel and H. Wolkowicz, Strong duality for semidefinite programming,SIAM Journal on Optimization (1997), to appear.

  14. O.S. Rothaus, Domains of Positivity.Abh. Math. Sem. Univ. Hamburg 24 (1960) 189–235.

    Google Scholar 

  15. O.S. Rothaus, The construction of homogeneous convex cones,Annals of Math. 83 (1966) 358–376.

    Google Scholar 

  16. R. Schneider,Convex Bodies: The Brunn—Minkowski Theory (Cambridge University Press, Cambridge, UK, 1993).

    Google Scholar 

  17. È.B. Vinberg, The theory of homogeneous cones,Trans. Moscow Math. Soc. 12 (1965) 340–403.

    Google Scholar 

  18. È.B. Vinberg, The structure of the group of automorphisms of a homogeneous convex cone,Trans. Moscow Math. Soc. 13 (1965) 63–93.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Research supported in part by an operating grant from NSERC of Canada.

Research supported in part by the National Science Foundation under grant DMS-9306318.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Güler, O., Tunçel, L. Characterization of the barrier parameter of homogeneous convex cones. Mathematical Programming 81, 55–76 (1998). https://doi.org/10.1007/BF01584844

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01584844

Keywords

Navigation