Systems Ay â‰¥ 0 with a degenerate cone of solutions are considered ill-posed since finite-precision algorithms are not expected to find points in the cone of solutions. Consequently, common conditionâ€¦ (More)

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â€¦ (More)

In a paper Cheung, Cucker and PeÃ±a (in press) [5] that can be seen as the first part of this one, we extended the well-known condition numbers for polyhedral conic systems C(A) Renegar (1994, 1995)â€¦ (More)