Error bounds, facial residual functions and applications to the exponential cone
Open Access
- 13 October 2022
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 200 (1) , 229-278
Abstract
We construct a general framework for deriving error bounds for conic feasibility problems. In particular, our approach allows one to work with cones that fail to be amenable or even to have computable projections, two previously challenging barriers. For the purpose, we first show how error bounds may be constructed using objects calledone-step facial residual functions. Then, we develop several tools to compute these facial residual functions even in the absence of closed form expressions for the projections onto the cones. We demonstrate the use and power of our results by computing tight error bounds for the exponential cone feasibility problem. Interestingly, we discover a natural example for which the tightest error bound is related to the Boltzmann–Shannon entropy. We were also able to produce an example of sets for which a Hölderian error bound holds but the supremum of the set of admissible exponents is not itself an admissible exponent.Keywords
All Related Versions
Funding Information
- Hong Kong Research Grants Council (PolyU153003/19p)
- Japan Society for the Promotion of Science (19K20217, (B)18H03206)
This publication has 44 references indexed in Scilit:
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward–backward splitting, and regularized Gauss–Seidel methodsMathematical Programming, 2011
- Global error bounds for piecewise convex polynomialsMathematical Programming, 2011
- Projection methods for conic feasibility problems: applications to polynomial sum-of-squares decompositionsOptimization Methods and Software, 2011
- Several Jordan-algebraic aspects of optimizationOptimization, 2008
- Clarke Subgradients of Stratifiable FunctionsSIAM Journal on Optimization, 2007
- Strong conical hull intersection property, bounded linear regularity, Jameson's property (G), and error bounds in convex optimizationMathematical Programming, 1999
- A study of projectionally exposed conesLinear Algebra and its Applications, 1990
- Regularizing the abstract convex programJournal of Mathematical Analysis and Applications, 1981
- Theory of conesLinear Algebra and its Applications, 1981
- The lattice of faces of a finite dimensional coneLinear Algebra and its Applications, 1973