## Abstract

We construct a general framework for deriving error bounds for conic feasibility problems. In particular, our approach allows one to work with cones that fail to be amenable or even to have computable projections, two previously challenging barriers. For the purpose, we first show how error bounds may be constructed using objects called one-step facial residual functions. Then, we develop several tools to compute these facial residual functions even in the absence of closed form expressions for the projections onto the cones. We demonstrate the use and power of our results by computing tight error bounds for the exponential cone feasibility problem. Interestingly, we discover a natural example for which the tightest error bound is related to the Boltzmann–Shannon entropy. We were also able to produce an example of sets for which a Hölderian error bound holds but the supremum of the set of admissible exponents is not itself an admissible exponent.

Original language | English |
---|---|

Pages (from-to) | 229-278 |

Number of pages | 50 |

Journal | Mathematical Programming |

Volume | 200 |

Issue number | 1 |

DOIs | |

Publication status | Published - 13 Oct 2022 |

## Keywords

- Error bounds
- Exponential cone
- Facial residual functions

## ASJC Scopus subject areas

- Software
- General Mathematics