The Structured Distance to Ill-Posedness for Conic Systems
نویسنده
چکیده
Consider two finite-dimensional normed spaces X and Y , a fixed convex cone K ⊂ X, and a linear mapping A : X → Y . We call A well-posed if AK = Y . In particular, in the purely linear case K = X, well-posedness coincides with surjectivity. Our interest is in the “distance to ill-posedness”: that is, we seek the smallest structured linear perturbation ∆A : X → Y such that the perturbed mapping A + ∆A is not well-posed. When K = X and the
منابع مشابه
A Condition Number for Second Order Conic Systems
In this note we define a condition number C (A) for the feasibility problem of homogeneous second order linear conic systems. This condition number extends that defined by the first two authors in Math. Program. 91:163–174 (2001) for homogeneous polyhedral linear conic systems. We show that it shares some of its properties —it can be characterized as a relativised inverse to the distance to ill...
متن کاملSome characterizations and properties of the "distance to ill-posedness" and the condition measure of a conic linear system
A conic linear system is a system of the form P(d) : find x that solves b− Ax ∈ CY , x ∈ CX , where CX and CY are closed convex cones, and the data for the system is d = (A, b). This system is“wellposed” to the extent that (small) changes in the data (A, b) do not alter the status of the system (the system remains solvable or not). Renegar defined the “distance to ill-posedness”, ρ(d), to be th...
متن کاملOn the Grassmann condition number
We give new insight into the Grassmann condition of the conic feasibility problem find x ∈ L ∩K \ {0}. (1) Here K ⊆ V is a regular convex cone and L ⊆ V is a linear subspace of the finite dimensional Euclidean vector space V . The Grassmann condition of (1) is the reciprocal of the distance from L to the set of ill-posed instances in the Grassmann manifold where L lives. We consider a very gene...
متن کاملSome Characterizations and Properties of the " Distance to Ill - Posedness " and the Condition Measure of a Conic Linear System 1
A conic linear system is a system of the form P: find x that solves b-Ax E Cy, E Cx, where Cx and Cy are closed convex cones, and the data for the system is d = (A, b). This system is"well-posed" to the extent that (small) changes in the data (A, b) do not alter the status of the system (the system remains solvable or not). Intuitively, the more well-posed the system is, the easier it should be...
متن کاملA Numerical Algorithm for Zero Counting. II: Distance to Ill-posedness and Smoothed Analysis
We show a Condition Number Theorem for the condition number of zero counting for real polynomial systems. That is, we show that this condition number equals the inverse of the normalized distance to the set of ill-posed systems (i.e., those having multiple real zeros). As a consequence, a smoothed analysis of this condition number follows.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Oper. Res.
دوره 29 شماره
صفحات -
تاریخ انتشار 2004