## Abstract

More than twenty years ago, Murray and Lootsma showed that Hessian matrices of the logarithmic barrier function become increasingly ill-conditioned at points on the barrier trajectory as the solution is approached. This paper explores some further characteristics of the barrier Hessian. We first show that, except in two special cases, the barrier Hessian is ill-conditioned in an entire region near the solution. At points in a more restricted region (including the barrier trajectory itself), this ill-conditioning displays a special structure connected with subspaces defined by the Jacobian of the active constraints. We then indicate how a Cholesky factorization with diagonal pivoting can be used to detect numerical rank-deficiency in the barrier Hessian, and to provide information about the underlying subspaces without making an explicit prediction of the active constraints. Using this subspace information, a close approximation to the Newton direction can be calculated by solving linear systems whose condition reflects that of the original problem.

Original language | English (US) |
---|---|

Pages (from-to) | 265-295 |

Number of pages | 31 |

Journal | Mathematical Programming |

Volume | 67 |

Issue number | 1-3 |

DOIs | |

State | Published - Oct 1994 |

## Keywords

- Barrier Hessian
- Barrier methods
- Ill-conditioning
- Interior methods
- Rank-revealing Cholesky factorization

## ASJC Scopus subject areas

- General Computer Science
- Computer Graphics and Computer-Aided Design
- Software
- Management Science and Operations Research
- Safety, Risk, Reliability and Quality
- General Mathematics
- Applied Mathematics