Tight error bounds for log-determinant cones without constraint qualifications
Preprint
Abstract
In this paper, without requiring any constraint qualifications, we establish tight error bounds for the log-determinant cone, which is the closure of the hypograph of the perspective function of the log-determinant function. This error bound is obtained using the recently developed framework based on one-step facial residual functions.Keywords
All Related Versions
This publication has 29 references indexed in Scilit:
- Convergence Analysis under Consistent Error BoundsFoundations of Computational Mathematics, 2022
- Error bounds, facial residual functions and applications to the exponential coneMathematical Programming, 2022
- Performance enhancements for a generic conic interior point algorithmMathematical Programming Computation, 2022
- Amenable cones: error bounds without constraint qualificationsMathematical Programming, 2019
- Facial Reduction Algorithms for Conic Optimization ProblemsJournal of Optimization Theory and Applications, 2012
- Minimum volume ellipsoidWIREs Computational Statistics, 2009
- Several Jordan-algebraic aspects of optimizationOptimization, 2008
- Strong conical hull intersection property, bounded linear regularity, Jameson's property (G), and error bounds in convex optimizationMathematical Programming, 1999
- Error bounds and convergence analysis of feasible descent methods: a general approachAnnals of Operations Research, 1993
- Regularizing the abstract convex programJournal of Mathematical Analysis and Applications, 1981