Tight Error Bounds for Log-Determinant Cones Without Constraint Qualifications
Open Access
- 9 April 2025
- journal article
- research article
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 205 (3) , 1-42
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
Funding Information
- Japan Society for the Promotion of Science (23K16844, 21H03398)
- Hong Kong Research Grants Council (PolyU153001/22p)
This publication has 39 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
- Amenable cones: error bounds without constraint qualificationsMathematical Programming, 2019
- A unified approach to error bounds for structured convex optimization problemsMathematical Programming, 2017
- Strong Duality in Conic Linear Programming: Facial Reduction and Extended Duals2013
- Minimum volume ellipsoidWIREs Computational Statistics, 2009
- Strong conical hull intersection property, bounded linear regularity, Jameson's property (G), and error bounds in convex optimizationMathematical Programming, 1999
- Error Bounds for Convex Inequality Systems1998
- Error bounds in mathematical programmingMathematical Programming, 1997
- Error bounds and convergence analysis of feasible descent methods: a general approachAnnals of Operations Research, 1993