Two properties of condition numbers for convex programs via implicitly defined barrier functions (Q1849258): Difference between revisions

The potential explosive growth of the condition numbers of the linear equations arising in interior-point methods is discussed. Two types of estimates on the growth of these condition numbers along the central path have been previously developed. In this paper, two bounds for such estimates are derived and stated in fundamentally different ways and shown to be compatible. Conic systems and their distance to infeasibility is discussed. A generalization of an earlier algorithm is given. The implicitly defined function approach enables a succinct consolidation of several results regarding self-concordant functions, the central path of a convex program, and conic systems and their distance to infeasibility.