arXiv Analytics

Sign in

arXiv:2109.11729 [math.OC]AbstractReferencesReviewsResources

Optimal error bounds in the absence of constraint qualifications with applications to the $p$-cones and beyond

Scott B. Lindstrom, Bruno F. Lourenço, Ting Kei Pong

Published 2021-09-24, updated 2022-05-12Version 2

We prove tight H\"olderian error bounds for all $p$-cones. Surprisingly, the exponents differ in several ways from those that have been previously conjectured; moreover, they illuminate $p$-cones as a curious example of a class of objects that possess properties in 3 dimensions that they do not in 4 or more. Using our error bounds, we analyse least squares problems with $p$-norm regularization, where our results enable us to compute the corresponding KL exponents for previously inaccessible values of $p$. Another application is a (relatively) simple proof that most $p$-cones are neither self-dual nor homogeneous. Our error bounds are obtained under the framework of facial residual functions, and we expand it by establishing for general cones an optimality criterion under which the resulting error bound must be tight.

Comments: 30 pages, comments welcome. The title has changed. The paper was adjusted to use the framework of one-step facial residual functions. Section 2 was also expanded slightly
Categories: math.OC, cs.NA, math.NA
Subjects: 90C25, 52A20
Related articles: Most relevant | Search more
arXiv:1403.2816 [math.OC] (Published 2014-03-12, updated 2015-04-17)
S-Lemma with Equality and Its Applications
arXiv:math/0004064 [math.OC] (Published 2000-04-11)
The fractional - order controllers: Methods for their synthesis and application
arXiv:1402.7291 [math.OC] (Published 2014-02-28, updated 2014-05-27)
Optimal subgradient algorithms with application to large-scale linear inverse problems