Date of Original Version



Working Paper

Rights Management

All Rights Reserved

Abstract or Description

The analysis of iterative algorithms solving a conic feasibility problem Ay ∈ K, with A a linear map and K a regular, closed, convex cone, can be conveniently done in terms of Renegar’s condition number C(A) of the input data A. In this paper we define and characterize a condition number which exploits the possible factorization of K as a product of simpler cones. This condition number, which extends the one defined in [Math. Program., 91:163–174, 2001] for polyhedral conic systems, captures better the conditioning of the problem by filtering out, e.g., differences in scaling between components corresponding to different factors of K. We see these results as a step in developing a theory of conditioning that takes into account the structure of the problem.