Tight Error Bounds for Log-Determinant Cones Without Constraint Qualifications
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.
Authors
- Bruno F. Lourenço (ORCID: https://orcid.org/0000-0003-2369-0107)
- Scott B. Lindstrom (ORCID: https://orcid.org/0000-0003-4287-4788)
- Ting Kei Pong (ORCID: https://orcid.org/0000-0001-5862-2986)
- Ying Lin (ORCID: https://orcid.org/0000-0001-5087-7941)
Institutions
- Hong Kong Polytechnic University (HK)
- Curtin University (AU)
- The Institute of Statistical Mathematics (JP)
Publication Details
- Journal
- Journal of Optimization Theory and Applications
- Published
- 2025-04-09
- DOI
- https://doi.org/10.1007/s10957-025-02644-1
- Citations
- 1
- Primary Topic
- Advanced Optimization Algorithms Research
- Type
- article
- Field-Weighted Citation Impact
- 2.63
Funders
- Hong Kong Polytechnic University
- Japan Society for the Promotion of Science