Optimization Online


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

Scott B. Lindstrom (scott.lindstrom***at***curtin.edu.au)
Bruno F. Lourenšo (bruno***at***ism.ac.jp)
Ting Kei Pong (tk.pong***at***polyu.edu.hk)

Abstract: We prove tight H÷lderian 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.

Keywords: error bounds, facial residual functions, H÷lderian error bounds

Category 1: Linear, Cone and Semidefinite Programming


Download: [PDF]

Entry Submitted: 09/24/2021
Entry Accepted: 09/24/2021
Entry Last Modified: 05/15/2022

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society