Some characterizations and properties of the “distance to ill-posedness” and the condition measure of a conic linear system

Abstract.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“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). Renegar defined the “distance to ill-posedness”, ρ(d), to be the smallest change in the data Δd=(ΔA,Δb) for which the system P(d+Δd) is “ill-posed”, i.e., d+Δd is in the intersection of the closure of feasible and infeasible instances d’=(A’,b’) of P(·). Renegar also defined the “condition measure” of the data instance d as C(d):=∥d∥/ρ(d), and showed that this measure is a natural extension of the familiar condition measure associated with systems of linear equations. This study presents two categories of results related to ρ(d), the distance to ill-posedness, and C(d), the condition measure of d. The first category of results involves the approximation of ρ(d) as the optimal value of certain mathematical programs. We present ten different mathematical programs each of whose optimal values provides an approximation of ρ(d) to within certain constants, depending on whether P(d) is feasible or not, and where the constants depend on properties of the cones and the norms used. The second category of results involves the existence of certain inscribed and intersecting balls involving the feasible region of P(d) or the feasible region of its alternative system, in the spirit of the ellipsoid algorithm. These results roughly state that the feasible region of P(d) (or its alternative system when P(d) is not feasible) will contain a ball of radius r that is itself no more than a distance R from the origin, where the ratio R/r satisfies R/r≤c1C(d), and such that r≥ and R≤c3C(d), where c1,c2,c3 are constants that depend only on properties of the cones and the norms used. Therefore the condition measure C(d) is a relevant tool in proving the existence of an inscribed ball in the feasible region of P(d) that is not too far from the origin and whose radius is not too small.

[1]  Yurii Nesterov,et al.  Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.

[2]  Jorge R. Vera,et al.  On the complexity of linear programming under finite precision arithmetic , 1998, Math. Program..

[3]  Mokhtar S. Bazaraa,et al.  Nonlinear Programming: Theory and Algorithms , 1993 .

[4]  S. Smale,et al.  On a theory of computation and complexity over the real numbers; np-completeness , 1989 .

[5]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[6]  James Renegar,et al.  Condition Numbers, the Barrier Method, and the Conjugate-Gradient Method , 1996, SIAM J. Optim..

[7]  Jorge R. Vera Ill-Posedness and the Complexity of Deciding Existence of Solutions to Linear Programs , 1996, SIAM J. Optim..

[8]  A. S. Lewis,et al.  Group Invariance and Convex Matrix Analysis , 1996, SIAM J. Matrix Anal. Appl..

[9]  Farid Alizadeh,et al.  Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization , 1995, SIAM J. Optim..

[10]  Sharon Filipowski On the Complexity of Solving Sparse Symmetric Linear Programs Specified with Approximate Data , 1997, Math. Oper. Res..

[11]  Stephen Smale,et al.  Some Remarks on the Foundations of Numerical Analysis , 1990, SIAM Rev..

[12]  S. Smale,et al.  On a theory of computation and complexity over the real numbers; np-completeness , 1989 .

[13]  Robert M. Freund,et al.  Dual gauge programs, with applications to quadratic programming and the minimum-norm problem , 1987, Math. Program..

[14]  Jorge Rafael,et al.  Ill-posedness in mathematical programming and problem-solving with approximate data , 1992 .

[15]  James Renegar,et al.  Incorporating Condition Measures into the Complexity Theory of Linear Programming , 1995, SIAM J. Optim..

[16]  丸山 徹 Convex Analysisの二,三の進展について , 1977 .

[17]  V. Klee,et al.  Helly's theorem and its relatives , 1963 .

[18]  James Renegar,et al.  Linear programming, complexity theory and elementary functional analysis , 1995, Math. Program..

[19]  J. Renegar Some perturbation theory for linear programming , 1994, Math. Program..

[20]  Robert M. Freund,et al.  Condition measures and properties of the central trajectory of a linear program , 1998, Math. Program..