Projectively Self-Concordant Barriers

Roland Hildebrand ()
Additional contact information
Roland Hildebrand: Laboratoire Jean Kuntzmann, University Grenoble Alpes, French National Centre for Scientific Research, 38000 Grenoble, France

Mathematics of Operations Research, 2022, vol. 47, issue 3, 2444-2463

Abstract: Self-concordance is the most important property required for barriers in convex programming. It is intrinsically linked to the affine structure of the underlying space. Here we introduce an alternative notion of self-concordance that is linked to the projective structure. A function on a set X in an affine space is projectively self-concordant if and only if it can be extended to an affinely self-concordant logarithmically homogeneous function on the conic extension of X . The feasible sets in conic programs, notably linear and semidefinite programs, are naturally equipped with projectively self-concordant barriers. However, the interior-point methods used to solve these programs use only affine self-concordance. We show that estimates used in the analysis of interior-point methods are tighter for projective self-concordance, in particular inner and outer approximations of the set. This opens the way to a better tuning of parameters in interior-points algorithms to allow larger steps and hence faster convergence. Projective self-concordance is also a useful tool in the theoretical analysis of logarithmically homogeneous barriers on cones.

Keywords: Primary: 90C51; secondary: 90C25; interior-point methods; self-concordant barriers (search for similar items in EconPapers)
Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/moor.2021.1215 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormoor:v:47:y:2022:i:3:p:2444-2463

Access Statistics for this article

More articles in Mathematics of Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().