Projectively Self-Concordant Barriers

Published Online:https://doi.org/10.1287/moor.2021.1215

References

  • 1. Bubeck S, Eldan R (2019) The entropic barrier: Exponential families, log-concave geometry, and self-concordance. Math. Oper. Res. 44(1):264–276.AbstractGoogle Scholar
  • 2. Chares R (2008) Cones and interior-point algorithms for structured convex optimization involving powers and exponentials. PhD thesis, Université Catholique de Louvain, Louvain-la-Neuve, Belgium.Google Scholar
  • 3. Freund RW, Jarre F, Schaible S (1996) On self-concordant barrier functions for conic hulls and fractional programming. Math. Programming 74:237–246.CrossrefGoogle Scholar
  • 4. Güler O (1997) Hyperbolic polynomials and interior-point methods for convex programming. Math. Oper. Res. 22:350–377.LinkGoogle Scholar
  • 5. Hildebrand R (2014) Canonical barriers on convex cones. Math. Oper. Res. 39(3):841–850.LinkGoogle Scholar
  • 6. Hildebrand R (2015) Centro-affine hypersurface immersions with parallel cubic form. Contributions Algebra Geometry 56(2):593–640.CrossrefGoogle Scholar
  • 7. Nemirovski A (1996) Lecture notes: Interior-point polynomial time methods for convex programming. Accessed January 1, 2022, https://www2.isye.gatech.edu/~nemirovs/Lect_IPM.pdf.Google Scholar
  • 8. Nesterov Y (2006) Constructing self-concordant barriers for convex cones. Discussion paper 2006/30, CORE, Louvain-la-Neuve, Belgium.Google Scholar
  • 9. Nesterov Y (2018) Lectures on Convex Optimization (Springer, Berlin).CrossrefGoogle Scholar
  • 10. Nesterov Y, Nemirovskii A (1994) Interior-Point Polynomial Algorithms In Convex Programming, vol. 13 in SIAM Studies in Applied Mathematics (SIAM, Philadelphia).CrossrefGoogle Scholar
  • 11. Nesterov YE, Todd MJ (1997) Self-scaled barriers and interior-point methods for convex programming. Math. Oper. Res. 22:1–42.LinkGoogle Scholar
  • 12. Nomizu K, Sasaki T (1994) Affine Differential Geometry: Geometry of Affine Immersions, vol. 111 of Cambridge Tracts in Mathematics (Cambridge University Press, Cambridge, UK).Google Scholar
  • 13. Renegar J (2001) A Mathematical View of Interior-Point Methods in Convex Optimization (SIAM, Philadelphia).CrossrefGoogle 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.