On Homogeneous Convex Cones, The Carathéodory Number, and the Duality Mapping

References

  • Faraut J., Korányi A.Analysis on Symmetric Cones (1994) (Oxford University Press, New York) Google Scholar
  • Güler O. Barrier functions in interior point methods. Math. Oper. Res. (1996) 21:860–885LinkGoogle Scholar
  • Güler O., Tunçel L. Characterization of the barrier parameter of homogeneous convex cones. Math. Programming (1998) 81:55–76CrossrefGoogle Scholar
  • Kaneyuki S., Tsuji T. Classification of homogeneous bounded domains of lower dimension. Nagoya Math. J. (1974) 53:1–46CrossrefGoogle Scholar
  • Koecher M. Positivitätbereiche in ℝn. Amer. J. Math. (1957) 79:575–596CrossrefGoogle Scholar
  • Nesterov Yu. E., Nemirovskii A. S.Interior-point polynomial algorithms in convex programming (1994) (SIAM Publications, Philadelphia, PA) CrossrefGoogle Scholar
  • Nesterov Yu. E., Todd M. J. Self-scaled barriers and interior-point methods for convex programming. Math. Oper. Res. (1997) 22:1–46LinkGoogle Scholar
  • Nesterov Yu. E. Primal-dual interior-point methods for self-scaled cones. SIAM J. Optim. (1998) 8:324–364CrossrefGoogle Scholar
  • Rockafellar R. T.Convex Analysis (1970) (Princeton University Press, Princeton, NJ) CrossrefGoogle Scholar
  • Schneider R.Convex Bodies: The Brunn-Minkowski Theory (1994) (Cambridge University Press, Cambridge, U.K.) Google Scholar
  • Tunçel L. Primal-dual symmetry and scale invariance of interior-point algorithms for convex optimization. Math. Oper. Res. (1998) 23:708–718LinkGoogle Scholar
  • Vinberg È. B. The theory of homogeneous cones. Trans. Moscow Math. Soc. (1965) 12:340–403Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.